Hyperequivalence of logic programs with respect to supported models

DOI10.1007/S10472-009-9119-8MaRDI QIDQ1028652zbMATHOpenAlexFDO

Authors Stefan Woltran, Mirosław Truszczyński

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

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

Recommendations

• scientific article; zbMATH DE number 3956409
• scientific article; zbMATH DE number 4018380
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Relativized hyperequivalence of logic programs for modular programming
• scientific article; zbMATH DE number 2077072
• Logic Programming
• scientific article; zbMATH DE number 1931684
• Layer Supported Models of Logic Programs
• On well-founded models for logic programs

Cites work

• scientific article; zbMATH DE number 7817 (Why is no real title available?)
• scientific article; zbMATH DE number 97788 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 4197966 (Why is no real title available?)
• scientific article; zbMATH DE number 4185059 (Why is no real title available?)
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• 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
• Characterization of strongly equivalent logic programs in intermediate logics
• Characterizations of the disjunctive stable semantics by partial evaluation
• Discovering classes of strongly equivalent logic programs
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logics in Artificial Intelligence
• Negation as failure in the head
• Nested expressions in logic programs
• On the relation between default and autoepistemic logic
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Semantical considerations on nonmonotonic logic
• Sound and complete inference rules for SE-consequence
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• Strong equivalence made easy: nested expressions and weight constraints
• Strongly equivalent logic programs
• The Semantics of Predicate Logic as a Programming Language

Cited in

(6)

• An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
• 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
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Model-based recasting in answer-set programming

Describes a project that uses

Uses Software

• ASSAT

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

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