Answer set programming modulo acyclicity

DOI10.3233/FI-2016-1398MaRDI QIDQ4589188zbMATH OpenOpenAlexFDO

Authors Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub

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

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Answer set programming modulo acyclicity
• scientific article; zbMATH DE number 6747915
• SAT modulo graphs: acyclicity
• Integrating answer set programming and constraint logic programming
• Extensions of answer set programming

Cited in

(16)

• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• Analysis of cyclic fault propagation via ASP
• SAT modulo graphs: acyclicity
• Declarative encodings of acyclicity properties
• Answer set programming modulo acyclicity
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• plasp 3: towards effective ASP planning
• The Seventh Answer Set Programming Competition: Design and Results
• The External Interface for Extending WASP
• Inconsistency proofs for ASP: the ASP-DRUPE format
• scientific article; zbMATH DE number 6747915 (Why is no real title available?)
• Exploiting Database Management Systems and Treewidth for Counting
• A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
• Capturing (optimal) relaxed plans with stable and supported models of logic programs
• Constraint answer set programming: integrational and translational (or SMT-based) approaches

Describes a project that uses

Uses Software

• clasp

This page was built for publication: Answer set programming modulo acyclicity

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