Answer set programming modulo acyclicity
From MaRDI portal
Publication:3449199
DOI10.1007/978-3-319-23264-5_13zbMATH Open1370.68044OpenAlexW2237679549MaRDI QIDQ3449199FDOQ3449199
Authors: Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub 
Publication date: 4 November 2015
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_13
Recommendations
Cites Work
- Extending and implementing the stable model semantics
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Constraint Answer Set Solving
- Solution Enumeration for Projected Boolean Search Problems
- Conflict-driven answer set solving: from theory to practice
- Declarative encodings of acyclicity properties
- Title not available (Why is that?)
- Tight logic programs
- Title not available (Why is that?)
- SAT modulo graphs: acyclicity
Cited In (12)
- Chinese remainder encoding for Hamiltonian cycles
- Space-efficient planar acyclicity constraints. A declarative pearl
- SAT modulo graphs: acyclicity
- Title not available (Why is that?)
- Answer set programming modulo acyclicity
- On relation between constraint answer set programming and satisfiability modulo theories
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Declarative encodings of acyclicity properties
- The External Interface for Extending WASP
- Title not available (Why is that?)
- Hamiltonian cycle reconfiguration with answer set programming
- Shared aggregate sets in answer set programming
Uses Software
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 Q3449199)
