Strong order equivalence

DOI10.1007/S10472-006-9027-0zbMATH Open1105.68100OpenAlexW1981209807MaRDI QIDQ854968FDOQ854968

Authors: 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

Recommendations

• Strongly equivalent logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming and Nonmonotonic Reasoning
• Strong equivalence of qualitative optimization problems
• Infinitary equilibrium logic and strongly equivalent logic programs

zbMATH Keywords

complexityanswer set programmingpreferencesprogram equivalences

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Strong equivalence made easy: nested expressions and weight constraints
• Comparisons and computation of well-founded semantics for disjunctive logic programs
• Strongly equivalent logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Autoepistemic logic
• Title not available (Why is that?)
• Logic Programming
• Title not available (Why is that?)
• Diagnostic reasoning with A-Prolog
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Inductive Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Preferred answer sets for extended logic programs
• Negation by default and unstratifiable logic programs
• Title not available (Why is that?)
• 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
• A semantic framework for preference handling in answer set programming
• Title not available (Why is that?)
• Logics in Artificial Intelligence

Cited In (6)

• On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
• Title not available (Why is that?)
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Strong equivalence of qualitative optimization problems
• Complexity results for answer set programming with bounded predicate arities and implications

Uses Software

• GULP

This page was built for publication: Strong order equivalence

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