Sciweavers

Share
SAT
2010
Springer
127views Hardware» more  SAT 2010»
8 years 2 months ago
Symmetry and Satisfiability: An Update
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
FMCAD
2006
Springer
8 years 8 months ago
Tracking MUSes and Strict Inconsistent Covers
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
Éric Grégoire, Bertrand Mazure, C&ea...
ECAI
2006
Springer
8 years 8 months ago
Extracting MUSes
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
Éric Grégoire, Bertrand Mazure, C&ea...
KI
1999
Springer
8 years 8 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
DATE
2000
IEEE
136views Hardware» more  DATE 2000»
8 years 8 months ago
On Applying Incremental Satisfiability to Delay Fault Testing
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah...
SARA
2009
Springer
8 years 11 months ago
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
Philippe Jégou, Lionel Paris
books