On the public citation graph

Incremental construction of unification algorithms in equational theories

https://doi.org/10.1007/bfb0036921
0 signed · 95 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-12727-5_16openalex-snapshot
Confluent and coherent equational term rewriting systems application to proofs in abstract data types
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11548133_24openalex-snapshot
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_16openalex-snapshot
Confluent and coherent equational term rewriting systems application to proofs in abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_18openalex-snapshot
Combining unification algorithms for confined regular equational theories
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_7openalex-snapshot
NARROWER: a new algorithm for unification and its application to Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_9openalex-snapshot
Design and implementation of a generic, logic and functional programming language
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_95openalex-snapshot
E-unification algorithms for a class of confluent term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_16openalex-snapshot
Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_20openalex-snapshot
Improving basic narrowing techniques
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_23openalex-snapshot
Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_153openalex-snapshot
Outer narrowing for equational theories based on constructors
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_60openalex-snapshot
Narrowing with built-in theories
inferred← citeshttps://doi.org/10.1007/3-540-50676-4_8openalex-snapshot
Fundamental mechanisms for artificial intelligence programming languages
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_25openalex-snapshot
Normalizing narrowing for weakly terminating and confluent systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_12openalex-snapshot
Associative-Commutative Unification
inferred← citeshttps://doi.org/10.1007/978-3-030-63595-4_5openalex-snapshot
Variants in the Infinitary Unification Wonderland
inferred← citeshttps://doi.org/10.1007/978-3-030-63595-4_6openalex-snapshot
Variant Satisfiability of Parameterized Strings
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_1openalex-snapshot
Symbolic Computation in Maude: Some Tapas
inferred← citeshttps://doi.org/10.1007/978-3-032-04848-6_1openalex-snapshot
Symbolic Computation and Verification Methods in Maude
inferred← citeshttps://doi.org/10.1007/978-3-032-04848-6_6openalex-snapshot
A Completion Procedure for Equational Rewriting Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_4openalex-snapshot
Conditional Narrowing Modulo in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_6openalex-snapshot
Infinite-State Model Checking of LTLR Formulas Using Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-319-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_21openalex-snapshot
Natural Narrowing for General Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_6openalex-snapshot
Effectively Checking the Finite Variant Property
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_13openalex-snapshot
Symbolic Model Checking of Infinite-State Systems Using Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_27openalex-snapshot
Unification and Narrowing in Maude 2.4
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_1openalex-snapshot
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_2openalex-snapshot
Constraint Based Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot
Twenty Years of Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_5openalex-snapshot
Folding Variant Narrowing and Optimal Variant Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-22444-7_11openalex-snapshot
Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_22openalex-snapshot
Proving Safety Properties of Rewrite Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_31openalex-snapshot
Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_13openalex-snapshot
Linear Paramodulation modulo Equality
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_2openalex-snapshot
Symbolic Reasoning Methods in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1007/bf00248250openalex-snapshot
A class of confluent term rewriting systems and unification
inferred← citeshttps://doi.org/10.1007/bf01069968openalex-snapshot
Equality control methods in machine theorem proving
inferred← citeshttps://doi.org/10.1007/bf01189020openalex-snapshot
Narrowing based procedures for equational disunification
inferred← citeshttps://doi.org/10.1007/bf01202035openalex-snapshot
Conditional narrowing modulo a set of equations
inferred← citeshttps://doi.org/10.1007/bfb0012845openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1007/s10990-007-9000-6openalex-snapshot
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90017-1openalex-snapshot
Rewriting systems on FP expressions to reduce the number of sequences yielded
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90175-1openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90007-8openalex-snapshot
Schematization of infinite sets of rewrite rules generated by divergent completion processes
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90006-9openalex-snapshot
Logic programming with equations
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90040-aopenalex-snapshot
Compilation of set terms in the logic data language (LDL)
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.024openalex-snapshot
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.004openalex-snapshot
Narrowing and Rewriting Logic: from Foundations to Applications
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.015openalex-snapshot
Variant Narrowing and Equational Unification
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100501openalex-snapshot
A partial evaluation framework for order-sorted equational programs modulo axioms
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101036openalex-snapshot
Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.002openalex-snapshot
Folding variant narrowing and optimal variant termination
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.06.003openalex-snapshot
Twenty years of rewriting logic
inferred← citeshttps://doi.org/10.1016/j.scico.2013.07.014openalex-snapshot
A rewriting logic approach to the formal specification and verification of web applications
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.001openalex-snapshot
Constrained narrowing for conditional equational theories modulo axioms
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.001openalex-snapshot
Variant-based satisfiability in initial algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.008openalex-snapshot
Complete symbolic reachability analysis using back-and-forth narrowing
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80003-6openalex-snapshot
Computing with rewrite systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80025-1openalex-snapshot
Unification in combinations of collapse-free regular theories
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80015-xopenalex-snapshot
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1051/ita/1984180301911openalex-snapshot
Construction d'un plus petit ordre de simplification
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00005openalex-snapshot
Automatic Verification of Finite Variant Property Beyond Convergent Equational Theories
inferred← citeshttps://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferred← citeshttps://doi.org/10.1145/2003476.2003488openalex-snapshot
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
inferred← citeshttps://doi.org/10.1145/319838.319873openalex-snapshot
Equations, sets, and reduction semantics for functional and logic programming
inferred← citeshttps://doi.org/10.1145/3563822.3568017openalex-snapshot
Symbolic Reachability Analysis of Distributed Systems using Narrowing and Heuristic Search
inferred← citeshttps://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
inferred← citeshttps://doi.org/10.1145/800055.802022openalex-snapshot
Rewriting systems on FP expressions that reduce the number of sequences they yield
inferred← citeshttps://doi.org/10.4204/eptcs.306.21openalex-snapshot
Most General Variant Unifiers
inferred← citeshttps://doi.org/10.4204/eptcs.325.10openalex-snapshot
Variant-based Equational Unification under Constructor Symbols
inferred← citeshttps://doi.org/10.4204/eptcs.421.5openalex-snapshot
Nominal Equational Rewriting and Narrowing
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.299openalex-snapshot
Refinement Types as Higher Order Dependency Pairs
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.31openalex-snapshot
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
inferred← citeshttps://doi.org/10.4995/thesis/10251/130206openalex-snapshot
Partial Evaluation of Rewriting Logic Theories
inferred← citeshttps://doi.org/10.4995/thesis/10251/190915openalex-snapshot
Modeling and Analysis of Advanced Cryptographic Primitives and Security Protocols in Maude-NPA
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.