On the public citation graph
Narrowing based procedures for equational disunification
0 signed · 51 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.
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.
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-15976-2_7openalex-snapshot
NARROWER: a new algorithm for unification and its application to Logic Programming
inferredcites →https://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferredcites →https://doi.org/10.1007/3-540-16442-1_9openalex-snapshot
Design and implementation of a generic, logic and functional programming language
inferredcites →https://doi.org/10.1007/3-540-16761-7_60openalex-snapshot
A Strong restriction of the inductive completion procedure
inferredcites →https://doi.org/10.1007/3-540-50667-5_57openalex-snapshot
OBJ: Programming with equalities, subsorts, overloading and parameterization
inferredcites →https://doi.org/10.1007/3-540-53904-2_87openalex-snapshot
Detecting redundant narrowing derivations by the LSE-SL reducibility test
inferredcites →https://doi.org/10.1007/3-540-54233-7_156openalex-snapshot
Complete axiomatizations of some quotient term algebras
inferredcites →https://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferredcites →https://doi.org/10.1007/bf01893885openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferredcites →https://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferredcites →https://doi.org/10.1007/bfb0036921openalex-snapshot
Incremental construction of unification algorithms in equational theories
inferredcites →https://doi.org/10.1016/0022-0000(82)90006-xopenalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0019-9958(85)80005-xopenalex-snapshot
Semantic confluence tests and completion methods
inferredcites →https://doi.org/10.1109/lics.1988.5122openalex-snapshot
Proof by consistency in equational theories
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1998.0203openalex-snapshot
Negation Elimination in Empty or Permutative Theories
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_17openalex-snapshot
Negation elimination in equational formulae
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_2openalex-snapshot
Rewriting techniques for software engineering
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_88openalex-snapshot
Pumping, cleaning and symbolic constraints solving
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_8openalex-snapshot
On the use of constraints in automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_15openalex-snapshot
Extending constructive negation for partial functions in lazy functional-logic languages
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_2openalex-snapshot
Nominal Equational Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_17openalex-snapshot
Disunification for Ultimately Periodic Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_7openalex-snapshot
Rewrite Proofs and Computations
inferred← citeshttps://doi.org/10.1007/bfb0014425openalex-snapshot
On the operational semantics of the algebraic and logic programming language LPG
inferred← citeshttps://doi.org/10.1007/bfb0016857openalex-snapshot
ECOLOG: an Environment for constraint logics
inferred← citeshttps://doi.org/10.1007/bfb0030616openalex-snapshot
E-unification by means of tree tuple synchronized grammars
inferred← citeshttps://doi.org/10.1007/bfb0052365openalex-snapshot
Solving disequations modulo some class of rewrite systems
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00024-zopenalex-snapshot
Analyses of unsatisfiability for equational logic programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.02.002openalex-snapshot
On Solving Nominal Disunification Constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.009openalex-snapshot
A metamodel of access control for distributed environments: Applications and properties
inferred← citeshttps://doi.org/10.1017/s1471068406002924openalex-snapshot
Constraint functional logic programming over finite domains
inferred← citeshttps://doi.org/10.1017/s1471068409003780openalex-snapshot
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
inferred← citeshttps://doi.org/10.1023/b:cons.0000006182.84033.6eopenalex-snapshot
Disunification in ACI1 Theories
inferred← citeshttps://doi.org/10.1111/j.1600-0471.1993.tb00042.xopenalex-snapshot
The early history of the Hejaz: a response to Garth Bawden
inferred← citeshttps://doi.org/10.1111/j.1600-0471.1999.tb00142.xopenalex-snapshot
The Arab nomadic people and the cultural interface between the ‘Fertile Crescent’ and ‘Arabia Felix’
inferred← citeshttps://doi.org/10.1145/179812.179813openalex-snapshot
On solving equations and disequations
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot
A Nominal Approach to Equational Problems in Languages with Binders
inferred← citeshttps://doi.org/10.46298/dmtcs.240openalex-snapshot
E-unification by means of tree tuple synchronized grammars
inferred← citeshttps://doi.org/10.46298/entics.14777openalex-snapshot
Strong Nominal Semantics for Fixed-Point Constraints
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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.