Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
From MaRDI portal
Abstract: Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, several related and yet substantially different answer set programs exist for a given problem. Sometimes these encodings may display significantly different performance. Uncovering precise formal links between these programs is often important and yet far from trivial. This paper presents formal results carefully relating a number of interesting program rewritings. It also provides the proof of correctness of system Projector concerned with automatic program rewritings for the sake of efficiency. Under consideration in Theory and Practice of Logic Programming (TPLP).
Recommendations
- Strongly equivalent logic programs
- Characterization of strongly equivalent logic programs in intermediate logics
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- scientific article; zbMATH DE number 1884383
- scientific article; zbMATH DE number 3956409
- Discovering classes of strongly equivalent logic programs
- A Characterization of Strong Equivalence for Logic Programs with Variables
- Possibilistic nested logic programs and strong equivalence
- Strong equivalence of logic programs under the infinite-valued semantics
Cites work
- A bird's-eye view of forgetting in answer-set programming
- A Characterization of Strong Equivalence for Logic Programs with Variables
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- A short introduction to intuitionistic logic
- Abstract gringo
- Cplus2ASP: computing action language \({\mathcal C}+\) in answer set programming
- Cut-free formulations for a quantified logic of here and there
- Estimating grounding sizes of logic programs under answer set semantics
- First-order modular logic programs and their conservative extensions
- Handbook of knowledge representation.
- scientific article; zbMATH DE number 140388 (Why is no real title available?)
- scientific article; zbMATH DE number 1453058 (Why is no real title available?)
- scientific article; zbMATH DE number 5212421 (Why is no real title available?)
- scientific article; zbMATH DE number 3099240 (Why is no real title available?)
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logics in Artificial Intelligence
- Modularity Aspects of Disjunctive Stable Models
- Nested expressions in logic programs
- Nonmonotonic causal theories
- Performance tuning in answer set programming
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Propositional semantics for disjunctive logic programs
- Stable models and circumscription
- Strongly equivalent logic programs
- Synonymous theories and knowledge representations in answer set programming
- Weight constraints as nested expressions
Cited in
(5)- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- scientific article; zbMATH DE number 3846863 (Why is no real title available?)
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Strongly equivalent logic programs
This page was built for publication: Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063883)
