Hyperequivalence of logic programs with respect to supported models

DOI10.1007/S10472-009-9119-8zbMath1165.68349OpenAlexW2106279850MaRDI QIDQ1028652

Stefan Woltran, Miroslaw Truszczynski

Publication date: 6 July 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.3700

Mathematics Subject Classification ID

Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (6)

An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Model-based recasting in answer-set programming ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming

Uses Software

• ASSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical considerations on nonmonotonic logic
• On the relation between default and autoepistemic logic
• Nested expressions in logic programs
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• The Semantics of Predicate Logic as a Programming Language
• Negation as failure in the head
• Characterizations of the disjunctive stable semantics by partial evaluation
• Characterization of strongly equivalent logic programs in intermediate logics
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Logics in Artificial Intelligence
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Logic Programming and Nonmonotonic Reasoning
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Strongly equivalent logic programs

This page was built for publication: Hyperequivalence of logic programs with respect to supported models