Search

It is commonly known that the conjunctive query entailment problem for certain extensions of (the well-known ontology language) ALC is computationally harder than their knowledge base satisfiability problem while for others the complexities coincide, both under the standard and the finite-model semantics. We expose a uniform principle behind this divide by identifying a wide class of (finitely) locally-forward description logics, for which we prove that (finite) query entailment problem can be solved by a reduction to exponentially many calls of the (finite) knowledge base satisfiability problem. Consequently, our algorithm yields tight ExpTime upper bounds for locally-forward logics with ExpTime-complete knowledge base satisfiability problem, including logics between ALC and μALCHbregQ (and more), as well as ALCSCC with global cardinality constraints, for which the complexity of querying remained open. Moreover, to make our technique applicable in future research, we provide easy-to-check sufficient conditions for a logic to be locally-forward based on several novel versions of the model-theoretic notion of unravellings. Together with existing results, this provides a nearly complete classification of the "benign" vs. "malign" primitive modelling features extending ALC, missing out only the Self operator. We then show a rather surprising result, namely that the conjunctive entailment problem for ALCSelf is exponentially harder than for ALC. This places the seemingly innocuous Self operator among the "malign" modelling features, like inverses, transitivity or nominals. [ABSTRACT FROM AUTHOR]

This paper presents BlockCode, a web application developed to create board games that support the learning of computer programming logic. The goal of the games created with BlockCode is to move a bunny around a board using block-based programming in order to collect all the carrots that are placed on the board. In every game, the bunny has to deal with obstacles, represented by rocks and holes, which have to be avoided using the commands available. BlockCode was designed for teachers and students: teachers can create games, specifying the arrangement of the boards; and students play the games, specifying the sequence of commands with the aim of collecting all the carrots. [ABSTRACT FROM AUTHOR]

The paper is based on an ethnographic inquiry into how the artists associated with Purulia Chhau, a traditional masked dance theatre form in the Purulia district of West Bengal, India, are innovating new ways of reaching out to a wider audience through online measures and how such a fusion of technology and tradition is transforming the art form itself. Based on an immersive inductive-iterative approach, in-depth interviews of performers and community elders were carried out intermittently over 127 days. The digital presence of the artists was also examined. The study reveals the role of small media technologies such as smart phones and the use of online platforms not just in the revival and transformation of their indigenous medium but also in the mediatization of their religion. Furthermore, given that the traditional role of Purulia Chhau as a ritualistic meaning-making conduit has been to disseminate mythological narratives, the study brings to fore how attempts in converging the traditional art form with new digital media platforms such as YouTube and Facebook over the past decade has effectuated a considerable alteration to the underlying rhetoric and message being conveyed. This, in turn has remoulded the traditional context of its primary intertwined ritual, the Shiv Gaajan, as identified. Apart from mediatization, the logic of the digital technologies and their audiences necessitating a drastic shift in both form and content of the traditional expression also underscores the theory of technological determinism at play. The paper argues that despite considerable compromise on the original narratives and associated rituals, accommodating new technologies has ensured the visibility, outreach, and economic sustenance of Purulia Chhau and its artists. [ABSTRACT FROM AUTHOR]

An Electrical and Computer Engineering Laboratory exercise has been included in the junior year fall term to partially bridge the theory to practice gap for multiple basic electrical and computer engineering topics. The laboratory investigates facets of power electronics and computer control for students who have recently been introduced to the theory of transistor bridge circuits for voltage polarity control in their electronics class, and digital pulse width modulation for DC motor speed control in their first computer logic class. After brief study of its specification, students follow a lab sequence to set up and instrument a commercial H-bridge to first record polarity and magnitude of output voltages under specified input conditions, and subsequently to observe DC motor response to the same inputs. DC power polarity and averaging through Pulse Width Modulation (PWM), as well as the collateral realities of brushed DC motor noise and logic versus power supply levels become clear to most student for the very first time. [ABSTRACT FROM AUTHOR]

Copyright of Cuadernos de Música, Artes Visuales y Artes Escénicas is the property of Pontificia Universidad Javeriana and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The field of Mechatronics and Robotics Engineering is emerging as a distinct academic discipline, but has no standardized curriculum. In order to define such a curriculum, a survey is prepared with lists of potential concept inventory items, and asks university faculty, students and practicing engineers to identify which concepts lie at the core of MRE. Because of the interdisciplinary nature of the field, a wide range of basic concepts including physical quantities and units, circuit analysis, digital logic, programming, computeraided design, solid mechanics, dynamic systems and controls, and mathematics are considered. The results of this survey identify gaps between existing undergraduate curricula, student experience, and employer expectations, and continuing work will provide insight into the direction of a unifying curricular design for MRE education. [ABSTRACT FROM AUTHOR]

The article discusses internet platforms, social media platforms, have been at the epicenter of a number of public harms in years. Topics include social media has in years become a substantial new vector for the spread of hateful and violent conduct; and government and political bodies including the United States Congress have, in response, initiated numerous inquiries to the steps internet.

Copyright of Sistema is the property of Asociacion de Revistas Culturales de Espana and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Temporal logic is of importance in theoretical computer science for its application in formal verification, to state requirements of hardware or software systems. Linear temporal logic is an appropriate logical environment to formalize Yablo's paradox which is seemingly non-self-referential and basically has a sequential structure. We give a brief review of Yablo's paradox and its various versions. Formalization of these paradoxes yields some theorems in Linear Temporal Logic (LTL) for which we give syntactic proofs using an appropriate axiomatization of LTL. [ABSTRACT FROM AUTHOR]

The occupied area, power consumption, and delay are the most crucial and critical factors in constructing integrated circuits. Due to the reduced occupied area, highly low power consumption, and extremely high speed of quantum-dot cellular automata (QCA) technology, it is one of the finest alternatives to complementary metal–oxide–semiconductor (CMOS) technology for nanoscale construction of circuits. On the other hand, fault tolerance becomes crucial in QCA due to the inherent sensitivity of quantum dots to various sources of errors and faults. These errors can arise from environmental disturbances, manufacturing imperfections, thermal fluctuations, and other factors. The presence of defects or faults can significantly impact the functionality and accuracy of QCA systems, leading to incorrect computation or signal corruption. To address these challenges, fault-tolerant structures are designed in QCA systems. These structures are specifically engineered to detect, tolerate, and mitigate the effects of faults, thereby enhancing the reliability and robustness of QCA-based computation. Fault-tolerant designs aim to ensure that the system can continue to operate correctly even in the presence of defects or faults. In QCA, proposed a fault-tolerant majority gate is necessary to ensure reliable computation in the presence of defects or faults. The fault-tolerant majority gate is a fundamental component in digital logic circuits, and it plays a crucial role in performing computations. It takes multiple input signals and produces an output based on the majority of those inputs. In classical computing, the majority gates are typically implemented using transistors. Therefore, t his paper introduces a new and efficient fault-tolerant 3-input majority voter (FT MV3) using 11 simple and rotated cells in the QCA technology, which is 100% and 90.47% tolerant against single-cell and double-cell omission defects. The recommended FT MV3 gate verification is confirmed using some physical proofs. Afterward, to illustrate the performance of the introduced gate, three fault-tolerant computational circuits, including multiplexer, adder and ALU, are presented using the introduced FT MV3 gate. The comparison of the proposed fault tolerant ALU to the best coplanar design shows a 28.80% and 34.01% reduction of cell count and occupied area, respectively. All circuits are simulated using QCADesigner 2.0.3 software. [ABSTRACT FROM AUTHOR]

• Asset management is being disrupted by digital asset management platforms (DAMPs). • Like other digital platforms, cost savings are coupled to market share concentration. • Unlike other digital platforms, disruption mostly involves incremental innovation. • This has encouraged the continued dominance of large financial rather than tech firms. • It has also reinforced the position of leading incumbent asset management centers. While contemporary technological disruption is increasingly conceptualized in terms of the logic and paradoxes of the digital platform economy, discussions of "FinTech" have only engaged to a limited extent with these debates—particularly from an economic geographic standpoint. Here we fill this gap by proposing an adapted Global Financial Network (GFN) framework for conceptualizing the organizational and geographic logic of the digital platform economy in finance, and applying it to examine the impact of the digital platform model on asset management. As we will show, asset management is being profoundly disrupted by what we dub digital asset management platforms—or DAMPs—which encompass services including index fund and ETF provision, robo-advising, and analytics and trading support. Like other digital platforms, DAMPs do not so much leverage technology to enhance their competitiveness within markets, as to radically restructure the market itself. Also, like other platforms, their rise has produced a winner-take-all paradox of centralization through democratization that defies predictions of technology-enabled industry decentralization. However, the logic and implications of the rise of DAMPs diverges, in other respects, from non-financial digital platforms, as finance has long possessed an informational intensity and regulatory and organizational fluidity characteristic of the digital platform economy. Consequently, the digital platform model has mostly developed endogenously in asset management through incremental innovation by major financial firms—in a process that has reinforced the position of leading incumbent asset management centers, and above all New York—rather than being introduced from the outside by upstart technology firms and clusters. [ABSTRACT FROM AUTHOR]

Object caches are used to minimize data traffic in various areas of Information Technology, including computer networks. In this scenario, they are usually hosted in proxies, storing page objects (texts, figures, among others), and implementing access control policies. Its correct operation can provide a significant gain of performance in data exchange since it allows the immediate response of requested resources. This study aims to discuss the different states of the efficiency of two distinct types of computer network caches and determine the changing dynamics of these states with Logic Eτ. [ABSTRACT FROM AUTHOR]

Quantum-dot Cellular Automata (QCA) is a technology that has the potential to create nano communication systems that are both highly efficient in power consumption and compact in size When compared to CMOS enabled electronic devices, QCA can achieve faster operation speed, higher density and lower power dissipation which becomes a boon, in digital logic design. In this paper, proposed work of designing sequential circuits using QCA has been achieved. An efficient JK flip-flop design along with 2-bit, 3-bit, 4-bit and 8-bit shift registers which can be further scaled up to N-bits using the same proposed design of flip-flop is observed. Also, the fault tolerance of proposed JK flip-flop design against single cell addition and deletion defects are presented in this paper. After conducting a performance comparison and thorough analysis of energy dissipation, it has been determined that the proposed designs bear lower cost and lower energy dissipations. Using QCADesigner tool, the validation of functions and processes of all proposed sequential designs has been done accordingly. [ABSTRACT FROM AUTHOR]

• Outlines the rationale and process of an incumbent car manufacturer's digital workplace transformation. • Proposes subtraction logic to digital workplace transformation, and by extension digital transformation, in juxtaposition to addition logic echoed in prior literature. • Addition logic grounds in the appropriation of digital technologies' affordances to create new workplace routines. • Subtraction logic emphasises removal of existing workplace technology (or inscribed institutional rules) to abandon workplace routines that conflict with the intended digital workplace. • Illustrates how workplace routines change when digital workplace transformation follows subtraction logic. • Synthesises addition and subtraction logic in one digital workplace transformation process model. Digital technology enables the transformation of work and workplaces. Previous digital workplace transformation (DWT) literature has shown how organisations add new digital technologies to create new workplace routines. However, such an emphasis on addition may hinder scholarship from recognising that some established workplace technologies and routines must disappear for new ones to emerge. Adopting the concept of deinstitutionalisation, we examine the rationale for and the process of how an organisation abandons workplace routines that conflict with its intended DWT. Referring to this as subtraction logic, we advance two contributions. First, we conceptualise how deinstitutionalisation of established workplace routines and technologies unfolds in DWT by outlining a process model that synthesises addition and subtraction. Second, we highlight the underlying rationales for DWT. With these insights, we shift the gaze from the dominant addition logic, which advocates for appropriating new digital technologies, to the equally important value of subtraction, i.e., removing existing workplace technologies (or inscribed institutional rules) to abandon workplace routines that conflict with the intended DWT. Hence, our study highlights the oft-ignored subtraction logic in DWT. [ABSTRACT FROM AUTHOR]

Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. This paper reports a realization of a 2:1 MUX, a concatenable digital logic element, based on electrothermal frequency tuning of electrically connected multiple arch resonators. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized. [ABSTRACT FROM AUTHOR]

Abstract: Reversible logic has captured significant attention in recent time as reducing power consumption is one of the main concern of digital logic design. It consumes less power by recovering bit loss from its unique input–output mapping. In this paper, we propose a reversible control unit, which is first ever proposed in literature. Two new 4×4 reversible gates, namely HL gate and BJ gate, are proposed to design reversible decoder and J-K flip-flop. An algorithm has been shown to design a reversible control unit. On the way to design the control unit, we propose reversible decoder, sequence counter, instruction register and control logic gates. These circuits are analyzed with the existing ones. The comparative results show that the proposed design outperforms the existing designs in terms of numbers of gates, garbage outputs, delay and quantum cost. In addition, some lower bounds on the numbers of gates and garbage outputs of the proposed control unit have also been presented. [Copyright &y& Elsevier]

Abstract: Computers can help in teaching logic; however, this ability is not particularly useful since it is reported that students lack understanding of deduction methods. Current logical methods are based on a conceptualization formed from a language for formulas that can be structured as in abstracted trees or sets, and from semantics in terms of truth values formulated as tables or drawn as marks on trees and sets. This paper proposes a unifying description methodology based on the notion of flow progressing through a system of six stages. Truth values and formulas are visualized as “things that flow”, i.e., things that can be created, received, processed, released and transferred. Accordingly, a conceptual map can be drafted for the propagation of these flow things during the process of truth-value evaluation or the chain of formula constructions. The new methodology presents a viable contribution for building a deeper understanding of proofs. This aid to understanding is demonstrated in examples adapted from the resolution method [Copyright &y& Elsevier]

Abstract: This work is a complementary part for what we proposed in [1]. In this paper, an undergraduate design experience for special purpose 4-bit microprocessor using the skills learned from digital logic design and Microprocessors courses is presented. The experience started in [1] by designing the ALU using the hardware printed circuit board and we are following it by completing the design by the instruction set architecture and the microprogram code. Our microprocessor contains – in addition to the ALU- six registers: A 4-bit accumulator register, Flag register that holds only zero (Z) and carry (C) flags, Program counter register (PC), Memory address register (MAR), Instruction register (IR), and Buffer Register. All programs and data are stored in the 1k RAM. [Copyright &y& Elsevier]

Abstract: A lot of work has been done in the field of multi-valued model checking home and abroad. But some research works are not perfect. Some problems in the semantic definitions of temporal operators and corresponding model checking algorithms are found in the paper “Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic”. Some counterexamples are given to show these errors. On the basis of the discussion, some sound semantic definitions of temporal operators and correct algorithms of model checking for some temporal operators are given. [Copyright &y& Elsevier]

Abstract: A model for credit-card-based electronic payment systems is analyzed through BAN logic and Kailar logic. And against its lack of the mechanism of ciphertext analysis, Kailar logic is extended to process the analysis of ciphertext. [Copyright &y& Elsevier]

In this paper a new class of intuitionistic fuzzy implications is introduced. Fulfillment of some axioms and properties together with Modus Ponens and Modus Tollens inference rules is investigated. Negation induced by implication is presented. [ABSTRACT FROM AUTHOR]

Abstract: Owing to their inherent nature, terrorist activities could be highly diversified. The risk assessment becomes a crucial component as it helps us weigh pros and cons versus possible actions or some planning pursuits. The recognition of threats and their relevance/seriousness is an integral part of the overall process of classification, recognition, and assessing eventual actions undertaken in presence of acts of chem.-bio terrorism. In this study, we introduce an overall scheme of risk assessment realized on a basis of classification results produced for some experimental data capturing the history of previous threat cases. The structural relationships in these experimental data are first revealed with the help of information granulation – fuzzy clustering. We introduce two criteria using which information granules are evaluated, that is (a) representation capabilities which are concerned with the quality of representation of numeric data by abstract constructs such as information granules, and (b) interpretation aspects which are essential in the process of risk evaluation. In case of representation facet of information granules, we demonstrate how a reconstruction criterion quantifies their quality. Three ways in which interpretability is enhanced are studied. First, we show how to construct the information granules with extended cores (where the uncertainty associated with risk evaluation could be reduced) and shadowed sets, which provide a three-valued logic perspective of information granules given in the form of fuzzy sets. Subsequently, we show a way of interpreting fuzzy sets via an optimized set of its α-cuts. [Copyright &y& Elsevier]

The importance and the role of fuzzy evaluation topics in the domain of evaluation of learning performance are discussed. Some connections and applications of these topics with the content of consecrated topics in a university environment examination are explored. A special emphasis is given to the applications of classical and fuzzy logic in the process of aggregation of specialist opinions. [ABSTRACT FROM AUTHOR]

One of the main challenges of modern processor designs is the implementation of scalable and efficient mechanisms to detect memory access order violations as a result of out-of-order execution. Conventional structures performing this task are complex, inefficient and power-hungry. This fact has generated a large body of work on optimizing address-based memory disambiguation logic, namely the load-store queue. In this paper we review the most significant proposals in this research field, focusing on our own contributions. [ABSTRACT FROM AUTHOR]

This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous agents that can interact with each other, and can exhibit both proactive and reactive behaviour allowing them to function in dynamic environments by adjusting their goals and plans when changes happen in such environments. KGP provides a highly modular agent architecture that integrates a collection of reasoning and physical capabilities, synthesised within transitions that update the agent's state in response to reasoning, sensing and acting. Transitions are orchestrated by cycle theories that specify the order in which transitions are executed while taking into account the dynamic context and agent preferences, as well as selection operators for providing inputs to transitions. [ABSTRACT FROM AUTHOR]

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-as- failure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes. [ABSTRACT FROM AUTHOR]

Summary: It is widely believed, that randomness exists in Nature. In fact such an assumption underlies many scientific theories and is embedded in the foundations of quantum mechanics. Assuming that this hypothesis is valid one can use natural phenomena, like radioactive decay, to generate random numbers. Today, computers are capable of generating the so-called pseudorandom numbers. Such series of numbers are only seemingly random (bias in the randomness quality can be observed). Question whether people can produce random numbers, has been investigated by many scientists in the recent years. The paper “Humans can consciously generate random numbers sequences…” published recently in Medical Hypotheses made claims that were in many ways contrary to state of art; it also stated far-reaching hypotheses. So, we decided to repeat the experiments reported, with special care being taken of proper laboratory procedures. Here, we present the results and discuss possible implications in computer and other sciences. [Copyright &y& Elsevier]

This paper develops an inductive theory of predictive common sense reasoning. The theory provides the basis for an integrated solution to the three traditional problems of reasoning about change; the frame, qualification, and ramification problems. The theory is also capable of representing non-deterministic events, and it provides a means for stating defeasible preferences over the outcomes of conflicting simultaneous events. [ABSTRACT FROM AUTHOR]

This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation for prioritized logic programs, is inspired by the semantics of Prioritized Logic Programming and enriched with the use of structural information of preference of Answer Set Optimization Programming. Specifically, the analysis of the logic program is carried out together with the analysis of preferences in order to determine the choice order and the sets of comparable models. The new semantics is compared with other approaches known in the literature and complexity analysis is also performed, showing that, with respect to other similar approaches previously proposed, the complexity of computing preferred stable models does not increase. [ABSTRACT FROM AUTHOR]