Removing Redundancy from Answer Set Programs

DOI10.1007/978-3-540-89982-2_66MaRDI QIDQ5504694zbMATH OpenOpenAlexFDO

Authors Tomi Janhunen

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_66

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Modularity in smodels Programs
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

Cites work

• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• Extending and implementing the stable model semantics
• Logic Programming and Nonmonotonic Reasoning
• Redundancy in logic. III: Non-monotonic reasoning

Cited in

(7)

• Redundancy elimination with a lexicographic solved form
• Redundancy elimination for LF
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• modopt
• Cumulativity Tailored for Nonmonotonic Reasoning
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
• DIRT: a literature-based benchmark suite for grounders

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Removing Redundancy from Answer Set Programs

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