Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The USA-Advisor: A Case Study in Answer Set Planning
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
The INFOMIX system for advanced integration of incomplete and inconsistent data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Inferring acceptable arguments with Answer Set Programming
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Updating Epistemic Logic Programs*
Journal of Logic and Computation
Logic programs for consistently querying data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The computational complexity of ideal semantics
Artificial Intelligence
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Nested epistemic logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Revisiting epistemic specifications
Logic programming, knowledge representation, and nonmonotonic reasoning
Hi-index | 0.00 |
In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P1 as input to another program P2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P1 currently has to be decoupled from the evaluation of P2 using an intermediate step which collects the desired consequences of P1 and provides them as input to P2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P1 into a so-called manifold program, which allows for accessing all desired consequences of P1 within a single answer set. Then, this manifold program can be evaluated jointly with P2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications.