Modular Equivalence for Normal Logic Programs

Reference:

Emilia Oikarinen and Tomi Janhunen. Modular equivalence for normal logic programs. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 412–416, Riva del Garda, Italy, August 2006. IOS Press.

Abstract:

A Gaifman-Shapiro-style architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The resulting module theorem properly strengthens Lifschitz and Turner's splitting set theorem for normal logic programs. Consequently, the respective notion of equivalence between modules, i.e. modular equivalence, proves to be a congruence relation. Moreover, it is shown how our translation-based verification method is accommodated to the case of modular equivalence; and how the verification of weak/visible equivalence can be optimized as a sequence of module-level tests.

Suggested BibTeX entry:

@inproceedings{OJ06:ecai,
    address = {Riva del Garda, Italy},
    author = {Emilia Oikarinen and Tomi Janhunen},
    booktitle = {Proceedings of the 17th European Conference on Artificial Intelligence},
    editor = {Gerhard Brewka and Silvia Coradeschi and Anna Perini and Paolo Traverso},
    month = {August},
    pages = {412--416},
    publisher = {IOS Press},
    title = {Modular Equivalence for Normal Logic Programs},
    year = {2006},
}