Answer Set Programming Modulo Acyclicity*
From MaRDI portal
Publication:4589188
DOI10.3233/FI-2016-1398zbMath1373.68170OpenAlexW2555981498MaRDI QIDQ4589188
Tomi Janhunen, Torsten Schaub, Martin Gebser, Jori Bomanson, Benjamin Kaufmann
Publication date: 9 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2016-1398
Related Items (8)
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Exploiting Database Management Systems and Treewidth for Counting ⋮ Inconsistency Proofs for ASP: The ASP - DRUPE Format ⋮ Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination ⋮ Analysis of cyclic fault propagation via ASP ⋮ plasp 3: Towards Effective ASP Planning ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ The External Interface for Extending WASP
Uses Software
This page was built for publication: Answer Set Programming Modulo Acyclicity*
