Modularity Aspects of Disjunctive Stable Models

DOI10.1007/978-3-540-72200-7_16MaRDI QIDQ5425407zbMATH OpenOpenAlexFDO

Authors Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran

Publication date 13 November 2007

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3484, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.9996

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where fully declarative and nonmonotonic languages are applied. In this context, obtaining a modular structure for programs is by no means straightforward since the output of an entire program cannot in general be composed from the output of its components. To better understand the effects of disjunctive information on modularity we restrict the scope of analysis to the case of disjunctive logic programs (DLPs) subject to stable-model semantics. We define the notion of a DLP-function, where a well-defined input/output interface is provided, and establish a novel module theorem which indicates the compositionality of stable-model semantics for DLP-functions. The module theorem extends the well-known splitting-set theorem and enables the decomposition of DLP-functions given their strongly connected components based on positive dependencies induced by rules. In this setting, it is also possible to split shared disjunctive rules among components using a generalized shifting technique. The concept of modular equivalence is introduced for the mutual comparison of DLP-functions using a generalization of a translation-based verification method.

Recommendations

• Modularity aspects of disjunctive stable models
• Modular nonmonotonic logic programming revisited
• Modularity in smodels Programs
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• A semantics for modular general logic programs

Cited in

(17)

• The splitting property of stable models
• On abstract modular inference systems and solvers
• Promoting modular nonmonotonic logic programs
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Answer Set Programming: A Primer
• Relativized hyperequivalence of logic programs for modular programming
• Modularity aspects of disjunctive stable models
• Modular nonmonotonic logic programming revisited
• scientific article; zbMATH DE number 4121977 (Why is no real title available?)
• Module theorem for the general theory of stable models
• Modularity in smodels Programs
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
• Modularization of logic programs
• On the foundations of grounding in answer set programming

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Modularity Aspects of Disjunctive Stable Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425407)