Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs

Reference:

Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 134–148, Porto, Portugal, September 2007. Springer.

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 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 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.

Suggested BibTeX entry:

@inproceedings{JarvisaloO:ICLP07,
    address = {Porto, Portugal},
    author = {Matti J\"arvisalo and Emilia Oikarinen},
    booktitle = {Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007)},
    editor = {Ver\'onica Dahl and Ilkka Niemel\"a},
    month = {September},
    pages = {134--148},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Extended {ASP} Tableaux and Rule Redundancy in Normal Logic Programs},
    volume = {4670},
    year = {2007},
}