Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Annals of Mathematics and Artificial Intelligence
Average case results for satisfiability algorithms under the random-clause-width model
Annals of Mathematics and Artificial Intelligence
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
On Exact Selection of Minimally Unsatisfiable Subformulae
Annals of Mathematics and Artificial Intelligence
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Solving peptide sequencing as satisfiability
Computers & Mathematics with Applications
A Bottom-Up Approach to Clausal Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Finding models for blocked 3-SAT problems in linear time by systematical refinement of a sub-model
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Complexity issues related to propagation completeness
Artificial Intelligence
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
| Hi-index | 0.89 |