Extended ASP tableaux and rule redundancy in normal logic programs

Details Extended ASP tableaux and rule redundancy in normal logic programs Extended ASP tableaux and rule redundancy in normal logic programs

2008-09-18

arxiv.org/abs/0809.3204v1

Theory and Practice of Logic Programming, 8(5-6):691-716, 2008

Computer Science

Artificial Intelligence

27 pages, 5 figures, 1 table

Scientific paper

10.1017/S1471068408003578

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 sets of clauses, and separate Extended ASP Tableaux from ASP Tableaux by giving a polynomial-length proof for a family of normal logic programs P_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 lengths of proofs in ASP. Closely related to Extended ASP Tableaux, we empirically investigate the effect of redundant rules on the efficiency of ASP solving. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

Extended ASP tableaux and rule redundancy in normal logic programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extended ASP tableaux and rule redundancy in normal logic programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extended ASP tableaux and rule redundancy in normal logic programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-281970