@inproceedings{
    Oikarinen07:lpnmr,
    editor = "Baral, Chitta and Brewka, Gerhard and Schlipf, John",
    author = "Oikarinen, Emilia",
    publisher = "Springer-Verlag",
    note = "Poster",
    responsibleauthor = "Oikarinen, Emilia",
    title = "Modularity in Smodels Programs",
    url = "http://www.springerlink.com/content/a66j1225u7371138",
    series = "Lecture Notes in Artificial Intelligence",
    booktitle = "Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings",
    address = "Tempe, Arizona, USA",
    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.",
    month = "May",
    volume = "4483",
    flags = "RAE ACPT public",
    year = "2007",
    impactfactor = "D4",
    pages = "321--326"
}