Generic tableaux for answer set programming

Authors:
Martin Gebser;Torsten Schaub
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Universität Potsdam, Potsdam, Germany and School of Computing Science at Simon Fraser University, Burnaby, Canada and IIIS at Griffith University, Brisbane, Aust ...
Venue:
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Year:
2007

Citing 11
Cited 4

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Weight constraints as nested expressions

Theory and Practice of Logic Programming
Unrestricted vs restricted cut in a tableau method for Boolean circuits

Annals of Mathematics and Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Properties of programs with monotone and convex constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Extended asp tableaux and rule redundancy in normal logic programs1

Theory and Practice of Logic Programming
On the relation among answer set solvers

Annals of Mathematics and Artificial Intelligence
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs. To this end, we generalize previous work characterizing computations in ASP by means of tableau methods. We start with a very basic core fragment in which rule heads and bodies consist of atomic literals.We then gradually extend this setting by focusing on the concept of an aggregate, understood as an operation on a collection of entities. We exemplify our framework by applying it to conjunctions in rule bodies, cardinality constraints as used in smodels, and finally to disjunctions in rule heads.