Equivalence Between Answer-Set Programs Under (Partially) Fixed Input

DOI10.1007/978-3-319-30024-5_6zbMATH Open1475.68053OpenAlexW2465565760MaRDI QIDQ2807074FDOQ2807074

Authors Bernhard Bliem, Stefan Woltran

Publication date 19 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30024-5_6

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Equivalence between answer-set programs under (partially) fixed input
• scientific article; zbMATH DE number 2090116
• Partial Functions and Equality in Answer Set Programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Logics in Artificial Intelligence
• Logic Programming
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

Cited in

(7)

• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Inlining external sources in answer set programs
• Equivalence between answer-set programs under (partially) fixed input

This page was built for publication: Equivalence Between Answer-Set Programs Under (Partially) Fixed Input

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