|
11
|
Approximating Minimal Unsatisfiable Subformulae by Means of Adaptive Core Search
– Renato Bruni
- 2002
|
|
6
|
Exact Selection of Minimal Unsatisfiable Subformulae for Special Classes of Propositional Formulae
– Renato Bruni
- 2002
|
|
1
|
A Complete Adaptive Algorithm for Propositional Satisfiability
– Renato Bruni, Antonio Sassano
- 2000
|
|
54
|
New methods for 3-SAT decision and worst-case analysis
– O. Kullmann
- 1999
|
|
|
A Logic-Based Approach to Polymer Sequence Analysis ∗
– Renato Bruni
- 2009
|
|
|
New Updating Criteria for Conflict-Based Branching Heuristics in DPLL Algorithms for Satisfiability
– Renato Bruni, Andrea Santori
|
|
1
|
Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers
– Renato Bruni, Andrea Santori
|
|
107
|
Algorithms for the Satisfiability (SAT) Problem: A Survey
– Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
- 1996
|
|
10
|
Partial Instantiation Methods for Inference in First Order Logic
– J.N. Hooker, G. Rago, V. Chandru, A. Shrivastava
- 2000
|
|
|
Optimization Methods in Logic
– John Hooker
- 2003
|
|
8
|
Heuristics for SAT algorithms: Searching for some foundations
– Oliver Kullmann
- 1998
|
|
46
|
Satisfiability Testing with More Reasoning and Less Guessing
– Allen Van Gelder, Yumi K. Tsuji
- 1995
|
|
1
|
Automatic Generation of Implied Clauses for SAT
– Lyndon Drake, Alan Frisch, Toby Walsh
- 2002
|
|
10
|
Algorithms for SAT/TAUT decision based on various measures
– O. Kullmann, H. Luckhardt
- 1999
|
|
1
|
How good are branching rules in DPLL?
– Ming Ouyang
- 1996
|
|
1
|
PROPOSITIONAL THEOREM PROVING: ADVANCED LEMMA STRATEGIES AND MULTI-AGENT SEARCH
– Fumiaki Okushi
- 1998
|
|
6
|
The Partial Rehabilitation of Propositional Resolution
– Allen Van Gelder, Fumiaki Kamiya
- 1996
|
|
8
|
Simultaneous Construction of Refutations and Models for Propositional Formulas
– Allen Van Gelder
- 1995
|
|
11
|
Fast Heuristics for the Maximum Feasible Subsystem Problem
– John W. Chinneck
- 2001
|
