On functional dependencies in q-Horn theories
Artificial Intelligence
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
Annals of Mathematics and Artificial Intelligence
Generalizations of Matched CNF Formulas
Annals of Mathematics and Artificial Intelligence
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
Present and Future of Practical SAT Solving
Complexity of Constraints
Does This Set of Clauses Overlap with at Least One MUS?
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A decision-making procedure for resolution-based SAT-solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Observed lower bounds for random 3-SAT phase transition density using linear programming
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving
Constraints
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
Hi-index | 0.00 |