Hyperequivalence of logic programs with respect to supported models
DOI10.1007/S10472-009-9119-8zbMATH Open1165.68349OpenAlexW2106279850MaRDI QIDQ1028652FDOQ1028652
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
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic programming (68N17)
Cites Work
- Nested expressions in logic programs
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- Title not available (Why is that?)
- Semantical considerations on nonmonotonic logic
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Discovering classes of strongly equivalent logic programs
- Characterization of strongly equivalent logic programs in intermediate logics
- Logics in Artificial Intelligence
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- On the relation between default and autoepistemic logic
- Title not available (Why is that?)
- Logic Programming
- Negation as failure in the head
- Characterizations of the disjunctive stable semantics by partial evaluation
- Title not available (Why is that?)
- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
- Sound and complete inference rules for SE-consequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Logic Programming and Nonmonotonic Reasoning
- Relativized Hyperequivalence of Logic Programs for Modular Programming
Cited In (6)
- Model-based recasting in answer-set programming
- Relativized hyperequivalence of logic programs for modular programming
- 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
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- Relativized Hyperequivalence of Logic Programs for Modular Programming
Uses Software
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)
