Answer Set Programming Modulo Acyclicity
From MaRDI portal
Publication:3449199
DOI10.1007/978-3-319-23264-5_13zbMath1370.68044OpenAlexW2237679549MaRDI QIDQ3449199
Benjamin Kaufmann, Tomi Janhunen, Torsten Schaub, Martin Gebser, Jori Bomanson
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
Related Items (5)
Shared aggregate sets in answer set programming ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ The External Interface for Extending WASP ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Chinese remainder encoding for Hamiltonian cycles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- SAT Modulo Graphs: Acyclicity
- Declarative encodings of acyclicity properties
- Solution Enumeration for Projected Boolean Search Problems
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Constraint Answer Set Solving
- Tight logic programs
This page was built for publication: Answer Set Programming Modulo Acyclicity
