A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
unification in typed lambda calculus
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Equations and rewrite rules: a survey
Equations and rewrite rules: a survey
Mechanical theorem proving and artificial intelligence languages.
Mechanical theorem proving and artificial intelligence languages.
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
Equational methods in first order predicate calculus
Journal of Symbolic Computation
On the descriptive power of term rewriting systems
Journal of Symbolic Computation
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
Associative-commutative unification
Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Complexity of matching problems
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Journal of Symbolic Computation
Efficient solution of linear diophantine equations
Journal of Symbolic Computation
Knuth-Bendix procedure and Buchberger algorithm: a synthesis
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Constrained equational reasoning
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Unification in commutative theories
Journal of Symbolic Computation
Using types as search keys in function libraries
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
The role of term symmetry in E-completion procedures
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Debugging Larch Shared Language Specifications
IEEE Transactions on Software Engineering
Completion of integral polynomials by AC-term completion
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Combining matching algorithms: The regular case
Journal of Symbolic Computation
Z-module reasoning: an equality-oriented proving method with built-in ring axioms
Journal of the ACM (JACM)
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
On solving equations and disequations
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Termination via conditional reductions
CSC '91 Proceedings of the 19th annual conference on Computer Science
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
Cancellative abelian monoids and related structures in refutational theorem proving (Part I)
Journal of Symbolic Computation
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Fatal steps of Knuth-Bendix completion
Nordic Journal of Computing
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Context-Sensitive AC-Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Completion of a set of rules modulo a set of equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On using ground joinable equations in equational theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Computer algebra handbook
Journal of Automated Reasoning
Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Journal of Functional Programming
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Information and Computation
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
ACM Transactions on Computational Logic (TOCL)
AI Communications - CASC
Structures for Abstract Rewriting
Journal of Automated Reasoning
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
Towards a Sharing Strategy for the Graph Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Cut Elimination in Deduction Modulo by Abstract Completion
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Combinable Extensions of Abelian Groups
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The Markgraf Karl refutation procedure
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
An equational approach to theorem proving in first-order predicate calculus
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Equational reasoning using AC constraints
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Mathematical Structures in Computer Science
Annals of Mathematics and Artificial Intelligence
A Computational Definition of the Notion of Vectorial Space
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
On the implementation of construction functions for non-free concrete data types
ESOP'07 Proceedings of the 16th European conference on Programming
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Abstract critical pairs and confluence of arbitrary binary relations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A dependency pair framework for A∨C-termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Canonized rewriting and ground AC completion modulo shostak theories
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
AC completion with termination tools
CADE'11 Proceedings of the 23rd international conference on Automated deduction
The graph rewriting calculus: confluence and expressiveness
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
What do we know when we know that a theory is consistent?
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Tactics for reasoning modulo AC in coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Compilation techniques for associative-commutative normalisation
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Automated Deduction Techniques for Studying Rough Algebras
Fundamenta Informaticae
Automating Algebraic Proofs in Algebraic Logic
Fundamenta Informaticae
Computability closure: ten years later
Rewriting Computation and Proof
From diagrammatic confluence to modularity
Theoretical Computer Science
| Hi-index | 0.01 |