On the public citation graph

E-unification by means of tree tuple synchronized grammars

https://doi.org/10.1007/bfb0030616
0 signed · 35 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.1006/inco.1994.1043openalex-snapshot
Syntacticness, Cycle-Syntacticness, and Shallow Theories
inferredcites →https://doi.org/10.1006/jsco.1996.0077openalex-snapshot
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
inferredcites →https://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-53904-2_90openalex-snapshot
Narrowing directed by a graph of terms
inferredcites →https://doi.org/10.1007/3-540-58156-1_19openalex-snapshot
Combination techniques for non-disjoint equational theories
inferredcites →https://doi.org/10.1007/3-540-58715-2_131openalex-snapshot
Solving a unification problem under constrained substitutions using tree automata
inferredcites →https://doi.org/10.1007/3-540-59200-8_71openalex-snapshot
Regular substitution sets: A means of controlling E-unification
inferredcites →https://doi.org/10.1007/3-540-61735-3_13openalex-snapshot
A strict border for the decidability of E-unification for recursive functions
inferredcites →https://doi.org/10.1007/bf01189020openalex-snapshot
Narrowing based procedures for equational disunification
inferredcites →https://doi.org/10.1007/bfb0016864openalex-snapshot
Some new decidability results on positive and negative set constraints
inferredcites →https://doi.org/10.1016/0304-3975(93)90108-6openalex-snapshot
Complete axiomatizations of some quotient term algebras
inferredcites →https://doi.org/10.1016/0743-1066(92)90024-wopenalex-snapshot
Logic programming with functions and predicates: The language Babel
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1016/s0747-7171(89)80015-xopenalex-snapshot
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
inferredcites →https://doi.org/10.1109/lics.1996.561464openalex-snapshot
Basic paramodulation and decidable theories
inferredcites →https://doi.org/10.1142/s0129054197000057openalex-snapshot
Pattern Languages Versus Parallel Communicating Grammar Systems
inferredcites →https://doi.org/10.1145/174675.177899openalex-snapshot
A needed narrowing strategy
inferredcites →https://doi.org/10.1145/36330.36332openalex-snapshot
Matching, unification and complexity
inferredcites →https://doi.org/10.1147/rd.254.0327openalex-snapshot
Positive First-Order Logic Is NP-Complete
inferredcites →https://doi.org/10.22028/d291-26125openalex-snapshot
Tree grammars with multilinear interpretation
inferredcites →https://doi.org/10.3233/fi-1995-24126openalex-snapshot
NARROWING STRATEGIES FOR ARBITRARY CANONICAL REWRITE SYSTEMS
inferredcites →https://doi.org/10.46298/dmtcs.240openalex-snapshot
E-unification by means of tree tuple synchronized grammars

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45127-7_15openalex-snapshot
Weakly Regular Relations and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_14openalex-snapshot
Synchronized Tree Languages Revisited and New Applications
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_28openalex-snapshot
TTSLI: An Implementation of Tree-Tuple Synchronized Languages
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_10openalex-snapshot
Regular Sets of Descendants for Constructor-Based Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_10openalex-snapshot
A New Result about the Decidability of the Existential One-Step Rewriting Theory
inferred← citeshttps://doi.org/10.1007/bfb0000483openalex-snapshot
On partial validation of logic programs
inferred← citeshttps://doi.org/10.1007/bfb0052365openalex-snapshot
Solving disequations modulo some class of rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0052368openalex-snapshot
Decidable approximations of sets of descendants and sets of normal forms
inferred← citeshttps://doi.org/10.1007/bfb0056619openalex-snapshot
A general framework for R-unification problems
inferred← citeshttps://doi.org/10.46298/dmtcs.300openalex-snapshot
A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars
inferred← citeshttps://doi.org/10.70675/ce5447cezb7f1z45c3zaa9az916e8f3dc4f5openalex-snapshot
Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité
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.