On solving the equality problem in theories defined by Horn clauses
Theoretical Computer Science
On word problems in equational theories
14th International Colloquium on Automata, languages and programming
Journal of Symbolic Computation
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
Two Results on Ordering for Resolution with Merging and Linear Format
Journal of the ACM (JACM)
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Experiment with an automatic theorem-prover having partial ordering inference rules
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Constraints in computational logics
Heuristics used by HERBY for semantic tree theorem proving
Annals of Mathematics and Artificial Intelligence
A model and a first analysis of distributed-search contraction-based strategies
Annals of Mathematics and Artificial Intelligence
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference
Journal of Automated Reasoning
Cancellative abelian monoids and related structures in refutational theorem proving (Part I)
Journal of Symbolic Computation
Cancellative abelian monoids and related structures in refutational theorem proving (part II)
Journal of Symbolic Computation
On the Completeness of Arbitrary Selection Strategies for Paramodulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Completeness and Redundancy in Constrained Clause Logic
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Constructing decision procedures in equational clausal logic
Fundamenta Informaticae
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
ACM Transactions on Computational Logic (TOCL)
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A taxonomy of theorem-proving strategies
Artificial intelligence today
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Constructing Decision Procedures in Equational Clausal Logic
Fundamenta Informaticae
Automated Deduction Techniques for Studying Rough Algebras
Fundamenta Informaticae
From diagrammatic confluence to modularity
Theoretical Computer Science
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
| Hi-index | 0.01 |