Modularity in Smodels Programs

Reference:

Emilia Oikarinen. Modularity in smodels programs. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings, volume 4483 of Lecture Notes in Artificial Intelligence, pages 321–326, Tempe, Arizona, USA, May 2007. Springer-Verlag. Poster.

Abstract:

A recently proposed module system for answer set programming is generalized for the input language of the Smodels system. To show that the stable model semantics is compositional and modular equivalence is a congruence for composition of Smodels program modules, a general translation-based scheme for introducing syntactic extensions of the module system is presented. A characterization of the compositionality of the semantics is used as an alternative condition for module composition, which allows compositions of modules even in certain cases with positive recursion between the modules to be composed.

Suggested BibTeX entry:

@inproceedings{Oikarinen07:lpnmr,
    address = {Tempe, Arizona, USA},
    author = {Emilia Oikarinen},
    booktitle = {Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings},
    editor = {Chitta Baral and Gerhard Brewka and John Schlipf},
    month = {May},
    note = {Poster},
    pages = {321--326},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Artificial Intelligence},
    title = {Modularity in Smodels Programs},
    volume = {4483},
    year = {2007},
}

See www.springerlink.com ...