A Characterization of Strong Equivalence for Logic Programs with Variables

DOI10.1007/978-3-540-72200-7_17zbMath1149.68335OpenAlexW1527039196MaRDI QIDQ5425408

No author found.

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)

Related Items (19)

Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Model-based recasting in answer-set programming ⋮ Here and There with Arithmetic ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ First-order modular logic programs and their conservative extensions ⋮ Proving infinitary formulas ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Cut-free formulations for a quantified logic of here and there ⋮ Strongly Equivalent Temporal Logic Programs ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ Stable models and circumscription ⋮ Transforming gringo rules into formulas in a natural way ⋮ Temporal Here and There ⋮ 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)

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