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
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
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
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Logic programs for consistently querying data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Revisiting epistemic specifications
Logic programming, knowledge representation, and nonmonotonic reasoning
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
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 P 1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P 1 currently has to be decoupled from the evaluation of P 2 using an intermediate step which collects the desired consequences of P 1 and provides them as input to P 2 . 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 P 1 into a so-called manifold program , which allows for accessing all desired consequences of P 1 within a single answer set. Then, this manifold program can be evaluated jointly with P 2 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 an application, we present an encoding for computing the ideal extension of an abstract argumentation framework.