Extended ASP tableaux and rule redundancy in normal logic programs

Authors:
Matti Järvisalo;Emilia Oikarinen
Affiliations:
Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland;Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland
Venue:
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Year:
2007

Citing 16
Cited 5

Negation as failure

Readings in nonmonotonic reasoning
A machine program for theorem-proving

Communications of the ACM
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
A short proof of the pigeon hole principle using extended resolution

ACM SIGACT News
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica
Why are there so many loop formulas?

ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
What's a head without a body?

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
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
On the relation between answer set and sat procedures (or, between cmodels and smodels)

ICLP'05 Proceedings of the 21st international conference on Logic Programming
The nomore++ approach to answer set solving

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Removing Redundancy from Answer Set Programs

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
Achieving compositionality of the stable model semantics for smodels programs1

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

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser& Schaub, ICLP 2006], with an added extension rule.We investigate the power of Extended ASP Tableaux both theoretically and empirically. We study the relationship of Extended ASP Tableaux with the Extended Resolution proof system defined by Tseitin for clause sets, and separate Extended ASP Tableaux from ASP Tableaux by giving a polynomial length proof of a family of normal logic programs {Πn} for which ASP Tableaux has exponential length minimal proofs with respect to n. Additionally, Extended ASP Tableaux imply interesting insight into the effect of program simplification on the length of proofs in ASP. Closely related to Extended ASP Tableaux, we empirically investigate the effect of redundant rules on the efficiency of ASP solving.