Preprocessing of Complex Non-Ground Rules in Answer Set Programming

DOI10.4230/LIPIcs.ICLP.2012.247zbMath1281.68068OpenAlexW2255903435MaRDI QIDQ5398063

Stefan Woltran, Michael Morak

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 programmingpreprocessinghypertree decomposition

Mathematics Subject Classification ID

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

Related Items (6)

Lpopt: a rule optimization tool for 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 ⋮ Abstraction for non-ground answer set programs ⋮ Backdoors to tractable answer set programming

This page was built for publication: Preprocessing of Complex Non-Ground Rules in Answer Set Programming