On functional dependencies in q-Horn theories
Artificial Intelligence
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
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
Annals of Mathematics and Artificial Intelligence
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
Artificial Intelligence
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
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 formula hierarchy over the hypercube
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.04 |