What's a head without a body?

Authors:
Christian Anger;Martin Gebser;Tomi Janhunen;Torsten Schaub
Affiliations:
Universität Potsdam, Postfach 90 03 27, D--14439 Potsdam, Germany;Universität Potsdam, Postfach 90 03 27, D--14439 Potsdam, Germany;Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland;Universität Potsdam, Postfach 90 03 27, D--14439 Potsdam, Germany
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 4
Cited 6

Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
The nomore++ approach to answer set solving

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

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
Extended ASP tableaux and rule redundancy in normal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Advanced techniques for answer set programming

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concepts in Answer Set Programming (ASP) are normally defined in terms of atoms.We show that the treatment of atoms and bodies (of rules) as equitable computational objects may yield exponential speed-ups, even for standard ASP-solvers such as smodels. To this end, we give simple transformations providing solvers with access to both kinds of objects and show that some families of examples can be solved exponentially faster after they have been transformed. We prove that these transformations may yield exponentially smaller search spaces.