SAT modulo graphs: acyclicity

DOI10.1007/978-3-319-11558-0_10zbMATH Open1432.68328OpenAlexW1514300868MaRDI QIDQ2938490FDOQ2938490

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• 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
• On relation between constraint answer set programming and satisfiability modulo theories
• Writing declarative specifications for clauses
• 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

Uses Software

• ASSAT
• Chaff
• NiVER

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)