ACM Computing Surveys (CSUR)
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Annals of Mathematics and Artificial Intelligence
A propositional theorem prover to solve planning and other problems
Annals of Mathematics and Artificial Intelligence
Lemma and cut strategies for propositional model elimination
Annals of Mathematics and Artificial Intelligence
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
Journal of Automated Reasoning
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
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
Present and Future of Practical SAT Solving
Complexity of Constraints
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
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity issues related to propagation completeness
Artificial Intelligence
Hi-index | 0.89 |