Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

DOI10.1007/978-3-642-29700-7_24zbMath1304.68166OpenAlexW195133914MaRDI QIDQ2898000

Wen-Hui Zhang, Wei Chen, Kaile Su, Yanyan Xu

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)

Uses Software

• SBSAT

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