Information Processing Letters
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
AMUSE: a minimally-unsatisfiable subformula extractor
Proceedings of the 41st annual Design Automation Conference
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Local-search Extraction of MUSes
Constraints
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
Boosting a complete technique to find MSS and MUS thanks to a local search oracle
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Matched formulas and backdoor sets
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
How many conflicts does it need to be unsatisfiable?
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
On variables with few occurrences in conjunctive normal forms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Variable minimal unsatisfiability
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Minimal false quantified boolean formulas
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On davis-putnam reductions for minimally unsatisfiable clause-sets
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
| Hi-index | 0.00 |