SAT Modulo Graphs: Acyclicity
From MaRDI portal
Publication:2938490
DOI10.1007/978-3-319-11558-0_10zbMath1432.68328OpenAlexW1514300868MaRDI QIDQ2938490
Tomi Janhunen, Martin Gebser, Jussi Rintanen
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_10
Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)
Related Items (8)
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Answer Set Programming Modulo Acyclicity ⋮ The Design of the Sixth Answer Set Programming Competition ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination ⋮ Space-Efficient Planar Acyclicity Constraints ⋮ Writing Declarative Specifications for Clauses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving parity games by a reduction to SAT
- Evaluating the effect of semi-normality on the expressiveness of defaults
- ASSAT: computing answer sets of a logic program by SAT solvers
- Compiling finite linear CSP into SAT
- Stable models and difference logic
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- The Minimum Spanning Tree Constraint
- Some (in)translatability results for normal logic programs and propositional theories
- A logic of nonmonotone inductive definitions
- Verification of Timed Automata via Satisfiability Checking
- Logics in Artificial Intelligence
- Depth-First Search and Linear Graph Algorithms
- Theory and Applications of Satisfiability Testing
- Computer Aided Verification
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
This page was built for publication: SAT Modulo Graphs: Acyclicity
