First-order modular logic programs and their conservative extensions
From MaRDI portal
Abstract: Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. We show how the notion of a conservative extension can be used to justify the common projection rewriting. This note is under consideration for publication in Theory and Practice of Logic Programming.
Recommendations
Cites work
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A Tarskian informal semantics for answer set programming
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Answer set programming and plan generation
- Knowledge Forgetting in Answer Set Programming
- Logic Programming and Nonmonotonic Reasoning
- Performance tuning in answer set programming
- Stable models and circumscription
- Strongly equivalent logic programs
- Weight constraints as nested expressions
Cited in
(6)- On syntactic forgetting under uniform equivalence
- Promoting modular nonmonotonic logic programs
- scientific article; zbMATH DE number 1354137 (Why is no real title available?)
- Conservative extension concepts for nonmonotonic knowledge bases
- Modular answer set programming as a formal specification language
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
This page was built for publication: First-order modular logic programs and their conservative extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593056)
