Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets

DOI10.1007/978-3-540-77684-0_5MaRDI QIDQ5445291zbMATH OpenOpenAlexFDO

Authors Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran

Publication date 4 March 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-77684-0_5

Mathematics Subject Classification ID

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

Recommendations

• Logics in Artificial Intelligence
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• Logic Programming
• A characterization of answer sets for logic programs
• A common view on strong, uniform, and other notions of equivalence in answer-set programming

Cites work

• A generalization of the Lin-Zhao theorem
• Answer set programming based on propositional satisfiability
• ASSAT: computing answer sets of a logic program by SAT solvers
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 2085248 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Strong equivalence made easy: nested expressions and weight constraints
• Strongly equivalent logic programs
• The DLV system for knowledge representation and reasoning
• The well-founded semantics for general logic programs
• Tight logic programs
• Why are there so many loop formulas?

Cited in

(10)

• Hyperequivalence of logic programs with respect to supported models
• Equivalence between answer-set programs under (partially) fixed input
• Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
• On elementary loops of logic programs
• scientific article; zbMATH DE number 5996835 (Why is no real title available?)
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Model-based recasting in answer-set programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets

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