SAT modulo graphs: acyclicity

DOI10.1007/978-3-319-11558-0_10MaRDI QIDQ2938490zbMATH OpenOpenAlexFDO

Authors Martin Gebser, Tomi Janhunen, 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)

Recommendations

• Answer set programming modulo acyclicity
• Answer set programming modulo acyclicity
• scientific article; zbMATH DE number 6747915
• Space-efficient planar acyclicity constraints. A declarative pearl
• Satisfiability of acyclic and almost acyclic CNF formulas

Cites work

• scientific article; zbMATH DE number 5605058 (Why is no real title available?)
• scientific article; zbMATH DE number 2090300 (Why is no real title available?)
• scientific article; zbMATH DE number 6747915 (Why is no real title available?)
• A logic of nonmonotone inductive definitions
• ASSAT: computing answer sets of a logic program by SAT solvers
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Compiling finite linear CSP into SAT
• Computer Aided Verification
• Depth-First Search and Linear Graph Algorithms
• Evaluating the effect of semi-normality on the expressiveness of defaults
• Fast and Flexible Difference Constraint Propagation for DPLL(T)
• Logics in Artificial Intelligence
• Solving parity games by a reduction to SAT
• Some (in)translatability results for normal logic programs and propositional theories
• Stable models and difference logic
• The Minimum Spanning Tree Constraint
• Theory and Applications of Satisfiability Testing
• Verification of timed automata via satisfiability checking

Cited in

(12)

• 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
• Space-efficient planar acyclicity constraints. A declarative pearl
• Answer set programming modulo acyclicity
• Satisfiability modulo user propagators
• On relation between constraint answer set programming and satisfiability modulo theories
• Writing declarative specifications for clauses
• Unfolding boxes with local constraints
• Declarative encodings of acyclicity properties
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers

Describes a project that uses

Uses Software

• NiVER
• Chaff
• ASSAT

This page was built for publication: SAT modulo graphs: acyclicity

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