Unit Refutations and Horn Sets
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A derived algorithm for evaluating ε-expressions over abstract sets
Journal of Symbolic Computation - Special issue on automatic programming
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On functional dependencies in q-Horn theories
Artificial Intelligence
Average case results for satisfiability algorithms under the random-clause-width model
Annals of Mathematics and Artificial Intelligence
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
Journal of Automated Reasoning
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
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
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Artificial Intelligence
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
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
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Computation of renameable Horn backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
Automatic decidability and combinability
Information and Computation
Worst case bounds for some NP-Complete modified Horn-SAT problems
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.01 |