Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

DOI10.1007/978-3-642-29700-7_24MaRDI QIDQ2898000zbMATH OpenOpenAlexFDO

Authors Yanyan Xu, Kaile Su, Wenhui Zhang, Wei Chen

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_24

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Applying modern SAT-solvers to solving hard problems
• Solving satisfiability using decomposition and the most constrained subproblem
• Solving constraint satisfaction problems with SAT modulo theories
• On problems as hard as CNF-SAT
• Efficient SAT solving under assumptions
• On the greedy algorithm for satisfiability
• scientific article; zbMATH DE number 5575002
• Application of SAT-approach for solving combinatorial problems

Describes a project that uses

Uses Software

• SBSAT

This page was built for publication: Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

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