|
47
|
Extracting small unsatisfiable cores from unsatisfiable Boolean formula
– Lintao Zhang, Sharad Malik
|
|
21
|
AMUSE: A Minimally-Unsatisfiable Subformula Extractor
– Yoonna Oh, Maher N. Mneimneh, Zaher S. Andraus, Karem A. Sakallah, Igor L. Markov
- 2004
|
|
8
|
benchmarks from Automotive Product Configuration, http://www-sr.informatik.uni-tuebingen.de/~sinz/DC
– SAT
|
|
13
|
MUP: A Minimal Unsatisfiability Prover
– Jinbo Huang
- 2005
|
|
20
|
On Computing Minimum Unsatisfiable Cores
– I. Lynce, J. Marques-Silva, Investigação E Desenvolvimento
- 2003
|
|
201
|
BerkMin: a fast and robust sat-solver
– Evgueni Goldberg, Yakov Novikov
- 2002
|
|
909
|
Chaff: Engineering an Efficient SAT Solver
– Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
- 2001
|
|
22
|
On finding all minimally unsatisfiable subformulas
– Mark H. Liffiton, Karem A. Sakallah
- 2005
|
|
338
|
An extensible SAT-solver
– N Eén, N Sörensson
- 2004
|
|
28
|
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
– Herbert Fleischner, Oliver Kullmann, Stefan Szeider A
- 2000
|
|
29
|
Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
– Gennady Davydov, Inna Davydova, Hans Kleine
- 1998
|
|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
33
|
The complexity of facets resolved
– C H Papadimitriou, D Wolfe
- 1985
|
|
20
|
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization
– James Bailey, Peter J. Stuckey
- 2005
|
|
31
|
Formal Methods for the Validation of Automotive Product Configuration Data
– Carsten Sinz, Andreas Kaiser, Wolfgang Küchlin
- 2003
|
|
39
|
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
– Ron Aharoni, Nathan Linial
|
|
59
|
A comparative study of two Boolean formulations of FPGA Detailed routing constraints
– Gi-joon Nam, Fadi Aloul, Karem Sakallah, Rob Rutenbar
- 2001
|
|
32
|
Verification of proofs of unsatisfiability for CNF formulas
– Evgueni Goldberg, Yakov Novikov
|
|
92
|
Automatic Abstraction without Counterexamples
– K. L. McMillan , Nina Amla
- 2002
|
