Preprocessing of complex non-ground rules in answer set programming

DOI10.4230/LIPICS.ICLP.2012.247MaRDI QIDQ5398063zbMATH OpenOpenAlexFDO

Authors Michael Morak, Stefan Woltran

Publication date 25 February 2014

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2012/3626/pdf/24.pdf

zbMATH Keywords

answer set programminghypertree decompositionpreprocessing

Mathematics Subject Classification ID

Applications of graph theory (05C90) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Optimizing answer set computation via heuristic-based decomposition
• The power of non-ground rules in Answer Set Programming
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

Cited in

(7)

• Backdoors to tractable answer set programming
• The power of non-ground rules in Answer Set Programming
• Optimizing answer set computation via heuristic-based decomposition
• selp: a single-shot epistemic logic program solver
• Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
• Abstraction for non-ground answer set programs
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

This page was built for publication: Preprocessing of complex non-ground rules in answer set programming

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