Information and Computation
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
Information Processing Letters
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
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
AMUSE: a minimally-unsatisfiable subformula extractor
Proceedings of the 41st annual Design Automation Conference
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
Generalizations of Matched CNF Formulas
Annals of Mathematics and Artificial Intelligence
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
Computing unsatisfiable k-SAT instances with few occurrences per variable
Theoretical Computer Science
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Theoretical Computer Science
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
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Matched formulas and backdoor sets
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science
On variables with few occurrences in conjunctive normal forms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
| Hi-index | 0.00 |