Showing papers on "Computational logic published in 2019"

Digital forensics and investigations meet artificial intelligence

Abstract: In the frame of Digital Forensic (DF) and Digital Investigations (DI), the “Evidence Analysis” phase has the aim to provide objective data, and to perform suitable elaboration of these data so as to help in the formation of possible hypotheses, which could later be presented as elements of proof in court. The aim of our research is to explore the applicability of Artificial Intelligence (AI) along with computational logic tools – and in particular the Answer Set Programming (ASP) approach — to the automation of evidence analysis. We will show how significant complex investigations, hardly solvable for human experts, can be expressed as optimization problems belonging in many cases to the $\mathbb {P}$ or $\mathbb {N}\mathbb {P}$ complexity classes. All these problems can be expressed in ASP. As a proof of concept, in this paper we present the formalization of realistic investigative cases via simple ASP programs, and show how such a methodology can lead to the formulation of tangible investigative hypotheses. We also sketch a design for a feasible Decision Support System (DSS) especially meant for investigators, based on artificial intelligence tools.

The middle ground-ancestral logic

Abstract: Many efforts have been made in recent years to construct formal systems for mechanizing general mathematical reasoning. Most of these systems are based on logics which are stronger than first-order logic (FOL). However, there are good reasons to avoid using full second-order logic (SOL) for this task. In this work we investigate a logic which is intermediate between FOL and SOL, and seems to be a particularly attractive alternative to both: ancestral logic. This is the logic which is obtained from FOL by augmenting it with the transitive closure operator. While the study of this logic has so far been mostly model-theoretical, this work is devoted to its proof theory (which is much more relevant for the task of mechanizing mathematics). Two natural Gentzen-style proof systems for ancestral logic are presented: one for the reflexive transitive closure, and one for the non-reflexive one. We show that these systems are sound for ancestral logic and provide evidence that they indeed encompass all forms of reasoning for this logic that are used in practice. The two systems are shown to be equivalent by providing translation algorithms between them. We end with an investigation of two main proof-theoretical properties: cut elimination and constructive consistency proof.

AC Computing Methodology for RF-Powered IoT Devices

Abstract: In this paper, an alternating current (ac) computing methodology is proposed for integration into wirelessly powered devices, such as radio-frequency (RF) tags and sensor nodes. Contrary to the traditional platforms that integrate direct current (dc)-powered computational logic along with the rectification and regulation stages, in the proposed approach, the harvested RF signal is directly used to power the data processing circuitry by leveraging the charge-recycling and adiabatic circuit theory. A near-field-based wireless power harvesting system with an 8-bit arithmetic logic unit is developed to evaluate the proposed framework. Simulation results in 45-nm technology demonstrate that the overall power consumption can be reduced by up to 16 times as compared to the conventional approach that relies on ac-to-dc conversion and static CMOS logic. This reduction in power enables significant computation capability for the RF-powered devices. Several important characteristics, such as the impact of circuit size on overhead and processing power, impact of voltage scaling on circuit operation, and power consumption, are investigated. Some important design issues and related tradeoffs are also discussed.

Enumeration in Data Management (Dagstuhl Seminar 19211)

Abstract: This report documents the program and the outcomes of Dagstuhl Seminar 19211 "Enumeration in Data Management". The goal of the seminar was to bring together researchers from various fields of computer science, including the Databases, Computational Logic, and Algorithms communities, and establish the means of collaboration towards considerable progress on the topic. Specifically, we aimed at understanding the recent developments, identifying the important open problems, and initiating collaborative efforts towards solutions thereof. In addition, we aimed to build and disseminate a toolkit for data-centric enumeration problems, including algorithmic techniques, proof techniques, and important indicator problems. Towards the objectives, the seminar included tutorials on the topic, invited talks, presentations of open problems, working groups on the open problems, discussions on platforms to compile the community knowledge, and the construction of various skeletons of such compilations.

Quantum Probability: a reliable tool for an agent or a reliable source of reality?

Abstract: In this paper we attempt to analyze the concept of quantum probability within quantum computation and quantum computational logic. While the subjectivist interpretation of quantum probability explains it as a reliable predictive tool for an agent in order to compute measurement outcomes, the objectivist interpretation understands quantum probability as providing reliable information of a real state of affairs. After discussing these different viewpoints we propose a particular objectivist interpretation grounded on the idea that the Born rule provides information about an intensive realm of reality. We then turn our attention to the way in which the subjectivist interpretation of probability is presently applied within both quantum computation and quantum computational logic. Taking as a standpoint our proposed intensive account of quantum probability we discuss the possibilities and advantages it might open for the modeling and development of both quantum computation and quantum computational logic.

Multi-context systems in dynamic environments

Abstract: Multi-Context Systems (MCSs) are able to formally model, in Computational Logic, distributed systems composed of heterogeneous sources, or “contexts”, interacting via special rules called “bridge rules”. In this paper, we consider how to enhance flexibility and generality in bridge-rules definition and use. In particular, we introduce and discuss some formal extensions of MCSs aimed to their practical application in dynamic environments, and we provide guidelines for implementations.

Design of Memristor – CMOS based logic gates and logic circuits

Abstract: Recent researches are mostly focused on technology scaling as well as device size minimization design techniques following Moore’s law. Conventional computing architectures are unable to fulfill modern application demands. Memristor is a promising alternative device which has been developed by many researchers [2] to draw attention of its structure for numerous applications which includes computational logic, memory implementations and neuromorphic systems. This paper emphasizes the basic properties of memristor at the device level. Different digital circuits have been designed for logic operations and DSP applications. Design methodologies are developed for proper circuit design, and circuit parameters are taken from a very detailed device model and optimization techniques. The transient response of Hybrid CMOS-memristor based logic gates and different adder circuits (i.e, half adder, full adder, carry-save adder) and multiplier circuit are performed in Cadence 180nm technology.

Applications of non-monotonic reasoning to automotive product configuration using answer set programming

Abstract: In automotive industry, validation and maintenance of product configuration data is a complex task Both orders from the customers and new product line designs from the R&D department are subject to a set of configuration rules to be satisfied In this work, non-monotonic computational logic, answer set programming in particular, is applied to industrial-scale automotive product configuration problems This methodology provides basic validation of the product configuration documentation and validation of single product orders, where Reiter style diagnosis provides minimal changes needed to correct an invalid order or a product configuration rule set In addition, a method for discovering groups of product configuration variables that are strongly related can be obtained by small modification of the basic logic program, and by the usage of cautious and brave reasoning methods As a result, options that are used in every, or respectively in no configuration, can easily be identified, as well as groups of options that are always used together or not at all Finally it is possible to single out mandatory and obsolete options, relative to a preselected set of included or excluded options Experimental results on an industrial dataset show applicability, example results, and computational feasibility with computation times on the order of seconds using a state-of-the-art answer set solver on standard PC hardware

Signal Shaping at Interface of Wireless Power Harvesting and AC Computational Logic

Abstract: The wirelessly powered adiabatic logic has introduced significant power savings in the design of the computational logic. We explore energy-efficient interfacing of one of the most efficient adiabatic logic families, pass-transistor adiabatic logic (PAL), with RF harvested signal. The interface circuit, signal shaper, transforms the bipolar sinusoidal input voltage to nonnegative unipolar sinusoidal output that serves as the power clock signal for PAL. A theoretical analysis of the operation of the signal shaper is presented and verified using simulations in 65 nm CMOS technology. The designed shaper, when interfaced with 8-bit multiplier implemented using PAL, demonstrates the settling time of a few clock periods and high power conversion efficiency as high as 90%.

Toward Public Opinion Monitoring System of Large-Scale Data with Lambda Architecture

Abstract: The public opinion monitoring system can monitor the latest information at any time and manage the network information activities by focusing on the website information about hot issues and key areas. The traditional Lambda architecture does not write abstract data on the storage layer, and the data latency and cost are relatively high on the storage. In this paper, we use the improved Lambda-based architecture to support stream and batch computing to make computational logic reused. The improved Lambda architecture enables the storage of unified historical data in full volume and online real-time incremental data. The storage can support high-throughput real-time write, as well as multi-field combination search and full-text retrieval.

Quantum-like behavior without quantum physics III : Logic and memory.

Abstract: We employ some of the machinery developed in previous work to investigate the inferential and memory functions of quantum-like neural networks. We set up a logical apparatus to implement this in the form of a Gentzen sequent calculus which codifies some of the combinatory rules for the state spaces of the neuronal networks introduced earlier. We discuss memory storage in this context and along the way find formal proof that synchronicity promotes binding and storage. These results lead to an algorithmic fragment in calculus that simulates the memory function known as pattern completion. This claim is tested by noting that the failure of certain steps in the algorithm leads to memory deficits essentially identical to those found in such pathologies as Alzheimer's dementia, schizophrenia, and certain forms of autism. Moreover, a specific "power-of-two" wiring architecture and computational logic, which have been postulated and observed across many brain circuits, emerge spontaneously from our model. We draw conclusions concerning the possible nature of such mental processes qua computations.

KBSET -- Knowledge-Based Support for Scholarly Editing and Text Processing

Abstract: KBSET supports a practical workflow for scholarly editing, based on using LaTeX with dedicated commands for semantics-oriented markup and a Prolog-implemented core system. Prolog plays there various roles: as query language and access mechanism for large Semantic Web fact bases, as data representation of structured documents and as a workflow model for advanced application tasks. The core system includes a LaTeX parser and a facility for the identification of named entities. We also sketch future perspectives of this approach to scholarly editing based on techniques of computational logic.

Completely decentralized community-based online games based on block chain technology

Abstract: The invention discloses a completely decentralized community-based online games based on block chain technology, belonging to the computer field, and being characterized in that the account managementof the game, the user state and the important assets are stored on the block chain; the core asset logic of the game is completed on the intelligent contract, the user's rendering material, the localrendering logic and the computational logic are operated on the user's local computer; in a large online game involving many people, relatively low-degree nodes are connected to form a partition plane, and/or the game content is divided into a plurality of service object groups based on user clustering and game scenarios, wherein each service object group has an independent node as a new centralserver to assume the role of an information exchange center, and new information exchange is generated between the new central servers; and non-critical in-game interaction data, which is not suitablefor storage on the chunk chain, is placed on a new central server for computational purposes.

Computational thinking with the web crowd using CodeMapper

Abstract: It has been argued that computational thinking should precede computer programming in the course of a career in computing. This argument is the basis for the slogan "logic first, syntax later" and the development of many cryptic syntax removed programming languages such as Scratch!, Blockly and Visual Logic. The goal is to focus on the structuring of the semantic relationships among the logical building blocks to yield solutions to computational problems. In this paper, we introduce a new programming platform, called the CodeMapper, in which learners are able to build computational logic in independent modules and aggregate them to create complex modules. CodeMapper is an abstract development environment in which rapid visual prototyping of systems is possible by combining already developed independent modules in logical steps.

The merits of compositional abstraction: A case study in propositional logic

Abstract: We revisit a well-established and old topic in computational logic: algorithms – such as the one by Quine-McCluskey – that convert a formula of propositional logic into a semantically equivalent disjunctive normal form whose clauses are all prime implicants of that formula. This exercise in education is meant to honor Bernhard Steffen, who made important contributions in formal verification and its use of compositional abstraction, and who is a role model in transferring research insights into teaching addressed at students with varying skill levels. The algorithm we propose here is indeed compositional and can teach students about the value of compositional abstractions – making use of simple lattice-theoretic and semantic concepts.

Development of Projects in IT

Abstract: This article demonstrates that whatever the descriptions of computational algorithms, what they present are some types of heuristics in the computational logic for the optimization of the acquisitions and treatments of information. The information acquired is always stored in digital media, organized in a group with indexing access in any order, which allows them to be related to indexer types of another group in digital media. The methodology is based on the generation of a unique indexing in such a way that the information is ordered hierarchically. Once a single indexing is made into a digital media, the algorithm can describe the order in which the information should be displayed or worked. The result is the availability of the information in a more optimized time in relation to a conventional logic, and always meeting the project objective. The choice of one of the types of heuristics, the indexing ordering and the crossing between digital media leads to the obtaining of a greater or lesser time in the access to the information and in its treatment, where normally the lack of this indexation is cause of delay in access or even of the absence of some data.

Metadata driven orchestration engine

Abstract: An efficient reusable, extensible light weight framework statelessly orchestrates system activities in any application which involves a series of sequential or parallel set of activities involving computational logic, data retrieval and persistence services. Actual orchestration steps and activities and computational logic are specified into configuration files, separate from the orchestration engine itself, thereby eliminating the need to code for such logic and activities. The framework can eliminate the need to code business logic and orchestration of data retrieval services by externalizing them into configuration files, resulting in lower costs to implement, test and maintain such system during its lifespan.

Tools in Term Rewriting for Education.

Abstract: Term rewriting is a Turing complete model of computation. When taught to students of computer science, key properties of computation as well as techniques to analyze programs on an abstract level are conveyed. This paper gives a swift introduction to term rewriting and presents several automatic tools to analyze term rewrite systems which were developed by the Computational Logic Group at the University of Innsbruck. These include the termination tool TTT2, the confluence prover CSI, the completion tools mkbTT and KBCV, the complexity tool TcT, the strategy tool AutoStrat, as well as FORT, an implementation of the decision procedure for the first-order theory for a decidable class of rewrite systems. Besides its applications in research, this software pool has also proved invaluable for teaching, e.g., in multiple editions of the International Summer School on Rewriting.