Answer set programming modulo acyclicity
From MaRDI portal
Publication:3449199
Recommendations
Cites work
- scientific article; zbMATH DE number 1696838 (Why is no real title available?)
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Conflict-driven answer set solving: from theory to practice
- Constraint Answer Set Solving
- Declarative encodings of acyclicity properties
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- SAT modulo graphs: acyclicity
- Solution Enumeration for Projected Boolean Search Problems
- The well-founded semantics for general logic programs
- Tight logic programs
Cited in
(12)- Chinese remainder encoding for Hamiltonian cycles
- Space-efficient planar acyclicity constraints. A declarative pearl
- SAT modulo graphs: acyclicity
- scientific article; zbMATH DE number 25189 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Shared aggregate sets in answer set programming
- Hamiltonian cycle reconfiguration with answer set programming
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)