Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

DOI10.1007/978-3-540-72200-7_12MaRDI QIDQ5425403zbMATH OpenOpenAlexFDO

Authors Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran

Publication date 13 November 2007

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_12

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Complexity results for answer set programming with bounded predicate arities and implications
• Removing Redundancy from Answer Set Programs
• Preprocessing of complex non-ground rules in answer set programming
• Semantical characterizations and complexity of equivalences in answer set programming
• The power of non-ground rules in Answer Set Programming

Cited in

(5)

• Complexity results for answer set programming with bounded predicate arities and implications
• The power of non-ground rules in Answer Set Programming
• Preprocessing of complex non-ground rules in answer set programming
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Removing Redundancy from Answer Set Programs

This page was built for publication: Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

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