A Characterization of Strong Equivalence for Logic Programs with Variables

DOI10.1007/978-3-540-72200-7_17MaRDI QIDQ5425408zbMATH OpenOpenAlexFDO

Authors

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_17

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Infinitary equilibrium logic and strongly equivalent logic programs
• Strongly equivalent logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• scientific article; zbMATH DE number 1884383
• Infinitary Equilibrium Logic and Strong Equivalence

Cited in

(30)

• Transforming gringo rules into formulas in a natural way
• An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
• Infinitary equilibrium logic and strongly equivalent logic programs
• Temporal here and there
• Strong equivalence of logic programs with abstract constraint atoms
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Strongly Equivalent Temporal Logic Programs
• Discovering classes of strongly equivalent logic programs
• Sound and complete inference rules for SE-consequence
• Synonymous theories and knowledge representations in answer set programming
• Characterization of strongly equivalent logic programs in intermediate logics
• scientific article; zbMATH DE number 1761902 (Why is no real title available?)
• Model-based recasting in answer-set programming
• First-order modular logic programs and their conservative extensions
• Proving infinitary formulas
• scientific article; zbMATH DE number 1884383 (Why is no real title available?)
• Strong equivalence made easy: nested expressions and weight constraints
• Modular answer set programming as a formal specification language
• Stable models and circumscription
• Logic Programming and Nonmonotonic Reasoning
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Partial Functions and Equality in Answer Set Programming
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Safe Formulas in the General Theory of Stable Models (Preliminary Report)
• Here and There with Arithmetic
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Cut-free formulations for a quantified logic of here and there
• On Heuer's procedure for verifying strong equivalence

This page was built for publication: A Characterization of Strong Equivalence for Logic Programs with Variables

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