90 search results - page 7 / 18 » On the Structure of Industrial SAT Instances |
69
Voted
SAT
2009
Springer
15 years 4 months ago
2009
Springer
The concept of backdoor variables has been introduced as a structural property of combinatorial problems that provides insight into the surprising ability of modern satisfiability...
ATS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
88
Voted
AAAI
2008
14 years 12 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
FOCI
2007
IEEE
15 years 4 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
60
Voted
JSAT
2008
14 years 9 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...