This paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). The graphs show how a literal can be derived ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
This paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). The graphs show how a literal can be derived from the program, and they evaluate in an argumentative way why necessary assumptions about literals not contained in an answerset hold. With the set of all asl-explanation graphs for a literal and an answerset, it is possible to explain and justify thoroughly why the literal is or is not contained in that answerset. Additionally, we provide a criterion to improve the clarity of explanations by pruning nodes without loss of information and selecting most significant asl-explanation graphs.
We present DIAMOND, an implementation of Brewka and Woltran's abstract dialectical frameworks (ADFs). The system uses answer set programming encodings to compute interpretations of ADFs according to various semant...
详细信息
ISBN:
(纸本)9781614994367;9781614994350
We present DIAMOND, an implementation of Brewka and Woltran's abstract dialectical frameworks (ADFs). The system uses answer set programming encodings to compute interpretations of ADFs according to various semantics. We evaluate the performance of the system using an actual reasoning problem as opposed to using randomly generated frameworks.
One of the major reasons for the success of answer set programming in recent years was the shift from a theorem proving to a constraint programming view: problems are represented such that stable models, respectively ...
详细信息
One of the major reasons for the success of answer set programming in recent years was the shift from a theorem proving to a constraint programming view: problems are represented such that stable models, respectively answersets, rather than theorems correspond to solutions. This shift in perspective proved extremely fruitful in many areas. We believe that going one step further from a "hard'' to a "soft'' constraint programming paradigm, or, in other words, to a paradigm of qualitative optimization, will prove equally fruitful. In this paper we try to support this claim by showing that several generic problems in logic based problem solving can be understood as qualitative optimization problems, and that these problems have simple and elegant formulations given adequate optimization constructs in the knowledge representation language.
Challenging fields like real-time videogames constitute an ideal, reproducible and controllable ground for researching and experimenting on the new developments of incremental reasoners for answer set programming (ASP...
详细信息
ISBN:
(纸本)9783031248405;9783031248412
Challenging fields like real-time videogames constitute an ideal, reproducible and controllable ground for researching and experimenting on the new developments of incremental reasoners for answer set programming (ASP). On the other hand, declarative methods show potential in cutting down development costs in commercial videogames: nonetheless, fulfilling the strict time requirements of this type of stream reasoning-like application is still an unsurpassed obstacle. Incremental reasoning techniques might help in overcoming this latter. In this work we report about the integration of an incremental ASP engine in a framework conceived for adding declarative decision-making modules in the typical videogame development workflow. Namely, the two systems are Incremental-DLV2, a recently introduced multi-shot incremental solver based on the ASP semantics, and ThinkEngine, a tool for developing declarative modules working in the context of the Unity game engine. After describing the features of both systems, we give an example showing how to program a declarative-based videogame character. We discuss how we adapted the architecture of ThinkEngine for accommodating incremental reasoning, and report about experiments showing the impact in performance after the introduction of Incremental-DLV2.
Research on cyber-physical systems has gained importance and we see an increasing number of applications ranging from ordinary cars to autonomous systems. The latter are of increasing interest requiring additional fun...
详细信息
ISBN:
(数字)9783030794637
ISBN:
(纸本)9783030794620;9783030794637
Research on cyber-physical systems has gained importance and we see an increasing number of applications ranging from ordinary cars to autonomous systems. The latter are of increasing interest requiring additional functionality like self-healing capabilities for improving availability. For autonomous systems, it is not only important to detect failures during operation, but also to come up with their causes. In this paper, we contribute to the foundations of diagnosis. We introduce a method for modeling cyber-physical systems considering behavior over time, in order to make use of model-based reasoning for computing diagnosis candidates. In particular, we discuss a thermal model coupled with a controller for keeping temperature within pre-defined values and show how this contributes to the computation of diagnoses given an unexpected behavior. The discussed modeling principles can be used as a blueprint for similar systems where controllers are coupled with a physical system. Diagnosis results obtained when using the thermal model and the observed diagnosis time, which was a fraction of a second, seem to indicate the applicability of the presented approach for industrial applications.
The development of Semantic Web technology has produced massive resource description framework(RDF)data,most of which are collected from the Internet of Things in the form of streams and analyzed in real *** to reason...
详细信息
ISBN:
(纸本)9781665431293
The development of Semantic Web technology has produced massive resource description framework(RDF)data,most of which are collected from the Internet of Things in the form of streams and analyzed in real *** to reason and query RDF streams,and to mine valuable information from the streams for decision-making has become a hot research *** event processing(CEP) can perform real-time analysis of event streams,but the processed data usually lacks semantic information,is not suitable for semantic interoperability between multi-source heterogeneous data,and cannot combine data streams with domain *** order to solve the above problems,CEPR,a complex event processing method based on RDF flow,is *** is based on answer set programming ASP,using LARS that extends ASP,combining Datalog and relational algebra,to implement RDF flow inference and query on the Flink *** the PHM 2010 tool wear data set to evaluate the performance of CEPR,and compare CEPR with C-SPARQL and *** show that CEPR has a greater advantage in query latency.
In recent work, we provided a formulation of ASP programs in terms of linear logic theories. Based on this work, in this paper we propose and discuss a modified answerset Semantics, "Resource-based answerset Se...
详细信息
ISBN:
(纸本)9783642405648
In recent work, we provided a formulation of ASP programs in terms of linear logic theories. Based on this work, in this paper we propose and discuss a modified answerset Semantics, "Resource-based answerset Semantics".
In this paper, we propose a variant of answer set programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, ...
详细信息
In this paper, we propose a variant of answer set programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (QEL(F)(=)). Then, we proceed to incorporate a new kind of logical term, intensional set (a construct commonly used to denote the set of objects characterised by a given formula), and to extend QEL(F)(=) semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count, sum, maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QEL(F)(=) interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to define sum in terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the Alog language, when we restrict to that syntactic fragment.
Only formal methods can guarantee the correctness of a circuit, but are usually very time and memory consuming. Therefore, efficient formal verification is key in the design of complex circuits. Many verification tech...
详细信息
ISBN:
(纸本)9798400704109
Only formal methods can guarantee the correctness of a circuit, but are usually very time and memory consuming. Therefore, efficient formal verification is key in the design of complex circuits. Many verification techniques have been introduced, which mostly fail to give bounds for the time complexity of the verification process. To overcome this issue, Polynomial Formal Verification (PFV) was introduced. This paper introduces a novel approach to PFV of circuits, by leveraging the concept of constant cutwidth. We divide the circuit into subgraphs, one for every output. This makes the verification of every subgraph only dependent on the cutwidth of the circuit and independent of the bitwidth. One main problem we solve is the passing of information between those subgraphs. The approach enables formal verification in linear time for circuits with constant cutwidth. As many different types of adders have a constant cutwidth, we can prove that those are verifiable in linear time. Those theoretical findings are backed by experiments including different adder architectures with up to 10k bit wide inputs.
This is an expository article about the solution to the frame problem proposed in 1980 by Raymond Reiter. For years, his "frame default" remained untested and suspect. But developments in some seemingly unre...
详细信息
This is an expository article about the solution to the frame problem proposed in 1980 by Raymond Reiter. For years, his "frame default" remained untested and suspect. But developments in some seemingly unrelated areas of computer science-logic programming and satisfiability solvers-eventually exonerated the frame default and turned it into a basis for important applications.
暂无评论