Strong order equivalence

DOI10.1007/s10472-006-9027-0zbMath1105.68100OpenAlexW1981209807MaRDI QIDQ854968

Wolfgang Faber, Kathrin Konczak

Publication date: 20 December 2006

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

Full work available at URL: https://doi.org/10.1007/s10472-006-9027-0

zbMATH Keywords

complexitypreferencesanswer set programmingprogram equivalences

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items

Complexity results for answer set programming with bounded predicate arities and implications, Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

Uses Software

• GULP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negation by default and unstratifiable logic programs
• Preferred answer sets for extended logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Autoepistemic logic
• Knowledge Representation, Reasoning and Declarative Problem Solving
• A framework for compiling preferences in logic programs
• Using methods of declarative logic programming for intelligent information agents
• Semantics of (disjunctive) logic programs based on partial evaluation
• Diagnostic reasoning with A-Prolog
• A semantic framework for preference handling in answer set programming
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Comparisons and computation of well-founded semantics for disjunctive logic programs
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Logics in Artificial Intelligence
• Inductive Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs