Communications of the ACM
Automated deduction by theory resolution
Journal of Automated Reasoning
What you always wanted to know about clause graph resolution
Proc. of the 8th international conference on Automated deduction
Inference with path resolution and semantic graphs
Journal of the ACM (JACM)
Generating connection calculi from tableau and sequent based proof systems
Artificial intelligence and its applications
Theory links: Applications to automated theorem proving
Journal of Symbolic Computation
Inferencing on an arbitrary set of links
Proceedings of the Second International Symposium on Methodologies for intelligent systems
HARP: a tableau-based theorem prover
Journal of Automated Reasoning
First-order logic and automated theorem proving
First-order logic and automated theorem proving
An application of P4-free graphs in theorem-proving
Proceedings of the third international conference on Combinatorial mathematics
Reexamining intractability of tableau methods
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
Journal of the ACM (JACM)
First-Order Theorem Proving Using Conditional Rewrite Rules
Proceedings of the 9th International Conference on Automated Deduction
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Reductions for non-clausal theorem proving
Theoretical Computer Science
Fast Subsumption Checks Using Anti-Links
Journal of Automated Reasoning
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates
Journal of Automated Reasoning
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
An Efficient Proof Method for Non-clausal Reasoning
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Ordered Resolution vs. Connection Graph Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Prime implicate normal form for ALC concepts
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Tableaux for Projection Computation and Knowledge Compilation
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Linkless normal form for ALC concepts and TBoxes
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Formal versus rigorous mathematics: how to get your papers published
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Duality in knowledge compilation techniques
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Normal forms for knowledge compilation
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Adapting Classical Inference Techniques To Multiple-Valued Logics Using Signed Formulas
Fundamenta Informaticae
| Hi-index | 0.01 |