On the public citation graph
Unification in extensions of shallow equational theories
0 signed · 44 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.1006/inco.1994.1043openalex-snapshot
Syntacticness, Cycle-Syntacticness, and Shallow Theories
inferredcites →https://doi.org/10.1006/jsco.1995.1020openalex-snapshot
Theorem Proving with Ordering and Equality Constrained Clauses
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-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferredcites →https://doi.org/10.1007/3-540-59200-8_70openalex-snapshot
Some independence results for equational unification
inferredcites →https://doi.org/10.1007/3-540-61464-8_65openalex-snapshot
Decidable approximations of term rewriting systems
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/3-540-63104-6_2openalex-snapshot
Decidable call by need computations in term rewriting (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-63104-6_32openalex-snapshot
Soft typing for ordered resolution
inferredcites →https://doi.org/10.1007/978-94-017-0435-9openalex-snapshot
Automated Deduction — A Basis for Applications
inferredcites →https://doi.org/10.1109/lics.1995.523285openalex-snapshot
Sequentiality, second order monadic logic and tree automata
inferredcites →https://doi.org/10.1109/lics.1996.561464openalex-snapshot
Basic paramodulation and decidable theories
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/11814771_45openalex-snapshot
Tree Automata with Equality Constraints Modulo Equational Theories
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_19openalex-snapshot
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_13openalex-snapshot
Complexity of Linear Standard Theories
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_28openalex-snapshot
Invited Talk: Rewrite-Based Deduction and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_29openalex-snapshot
Towards an Automatic Analysis of Security Protocols in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_2openalex-snapshot
On the Expressivity and Applicability of Model Representation Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_9openalex-snapshot
First-Order Automatic Literal Model Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_13openalex-snapshot
Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_20openalex-snapshot
The Joinability and Unification Problems for Confluent Semi-constructor TRSs
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_22openalex-snapshot
Superposition for Fixed Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_7openalex-snapshot
From Search to Computation: Redundancy Criteria and Simplification at Work
inferred← citeshttps://doi.org/10.1007/s10817-020-09546-zopenalex-snapshot
SPASS-AR: A First-Order Theorem Prover Based on Approximation-Refinement into the Monadic Shallow Linear Fragment
inferred← citeshttps://doi.org/10.1007/s11786-012-0134-5openalex-snapshot
Superposition as a Decision Procedure for Timed Automata
inferred← citeshttps://doi.org/10.1007/s11786-012-0135-4openalex-snapshot
Superposition Decides the First-Order Logic Fragment Over Ground Theories
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.024openalex-snapshot
Some Undecidable Approximations of TRSs
inferred← citeshttps://doi.org/10.1016/j.ic.2005.10.002openalex-snapshot
Modular proof systems for partial functions with Evans equality
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.006openalex-snapshot
Tree automata with equality constraints modulo equational theories
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00022-1openalex-snapshot
The unification problem for confluent right-ground term rewriting systems
inferred← citeshttps://doi.org/10.1145/1805950.1805957openalex-snapshot
Superposition for fixed domains
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2962openalex-snapshot
The Unification Problem for Confluent Semi-Constructor TRSs
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.