Program Correspondence under the Answer-Set Semantics: The Non-ground Case

DOI10.1007/978-3-540-89982-2_49zbMath1185.68173OpenAlexW1523341975MaRDI QIDQ5504682

Johannes Oetsch, Hans Tompits

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_49

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

Model-based recasting in answer-set programming ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Modular Answer Set Programming as a Formal Specification Language

Cites Work

• Unnamed Item
• Circumscription - a form of non-monotonic reasoning
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Unfolding partiality and disjunctions in stable model semantics
• The DLV system for knowledge representation and reasoning
• Logics in Artificial Intelligence
• Logics in Artificial Intelligence
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Logic Programming
• Strongly equivalent logic programs

This page was built for publication: Program Correspondence under the Answer-Set Semantics: The Non-ground Case