Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic 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
Mixing abstract and concrete modules: specification, development and prototyping
ICSE '90 Proceedings of the 12th international conference on Software engineering
The role of term symmetry in E-completion procedures
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
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
Unification for completely commutative theories
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
Termination via conditional reductions
CSC '91 Proceedings of the 19th annual conference on Computer Science
Constraints in computational logics
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Fatal steps of Knuth-Bendix completion
Nordic Journal of Computing
Non-deterministic Computations in ELAN
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
On Coherence Properties in Team Rewriting Models of Concurrency
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
UNIMOK: A System for Combining Equational Unification Algorithm
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
RTA '01 Proceedings of the 12th 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
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Computer algebra handbook
Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Journal of Functional Programming
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
ACM Transactions on Computational Logic (TOCL)
A ρ-calculus of explicit constraint application
Higher-Order and Symbolic Computation
Structures for Abstract Rewriting
Journal of Automated Reasoning
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
A semantic framework for open processes
Theoretical Computer Science
Towards a Sharing Strategy for the Graph Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Diagrammatic Confluence and Completion
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Annals of Mathematics and Artificial Intelligence
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Building extended canonizers by graph-based deduction
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Abstract critical pairs and confluence of arbitrary binary relations
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
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Confluent Term Rewriting for Only-knowing Logics
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
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
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Termination of context-sensitive rewriting with built-in numbers and collection data structures
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Compilation techniques for associative-commutative normalisation
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Confluence of non-left-linear TRSs via relative termination
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Lazy narrowing with simplification
Computer Languages
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
Simplification Orderings: History Of Results
Fundamenta Informaticae
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
Fundamenta Informaticae
Hi-index | 0.00 |