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

DOI10.1007/978-3-540-77684-0_5zbMath1138.68559OpenAlexW1484234566MaRDI QIDQ5445291

Stefan Woltran, Hans Tompits, Torsten Schaub, Martin Gebser

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 in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (4)

On elementary loops of logic programs ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Model-based recasting in answer-set programming ⋮ Hyperequivalence of logic programs with respect to supported models

Uses Software

• ASSAT

Cites Work

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

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