On the public citation graph
Tree Automata with Equality Constraints Modulo Equational Theories
0 signed · 42 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/jsco.1995.1048openalex-snapshot
Automata for Reduction Properties Solving
inferredcites →https://doi.org/10.1007/10721959_21openalex-snapshot
Rewriting for Cryptographic Protocol Verification
inferredcites →https://doi.org/10.1007/10721975_2openalex-snapshot
Tree Automata and Term Rewrite Systems
inferredcites →https://doi.org/10.1007/11539452_19openalex-snapshot
Selecting Theories and Recursive Protocols
inferredcites →https://doi.org/10.1007/11814771_45openalex-snapshot
Tree Automata with Equality Constraints Modulo Equational Theories
inferredcites →https://doi.org/10.1007/3-540-45610-4_8openalex-snapshot
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
inferredcites →https://doi.org/10.1007/3-540-45610-4_9openalex-snapshot
Decidability and Closure Properties of Equational Tree Languages
inferredcites →https://doi.org/10.1007/3-540-45789-5_5openalex-snapshot
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
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-58201-0_88openalex-snapshot
Pumping, cleaning and symbolic constraints solving
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_34openalex-snapshot
Automata-Based Analysis of Recursive Cryptographic Protocols
inferredcites →https://doi.org/10.1007/bfb0032738openalex-snapshot
Set-based analysis for logic programming and tree automata
inferredcites →https://doi.org/10.1007/bfb0052362openalex-snapshot
Unification in extensions of shallow equational theories
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferredcites →https://doi.org/10.1016/j.entcs.2004.05.018openalex-snapshot
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1145/358722.358740openalex-snapshot
Timestamps in key distribution protocols
inferredcites →https://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_75openalex-snapshot
Unranked Tree Automata with Sibling Equalities and Disequalities
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_18openalex-snapshot
On the Completeness of Context-Sensitive Order-Sorted Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_15openalex-snapshot
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_13openalex-snapshot
Satisfiability of a Spatial Logic with Tree Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_19openalex-snapshot
Protocol Verification Via Rigid/Flexible Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_25openalex-snapshot
Tree Automata with Global Constraints
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-02979-0_17openalex-snapshot
TAGED Approximations for Temporal Properties Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_17openalex-snapshot
Automatic Generation of Invariants for Circular Derivations in SUP(LA)
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.1016/j.jlap.2007.10.006openalex-snapshot
Tree automata with equality constraints modulo equational theories
inferred← citeshttps://doi.org/10.1093/logcom/exu074openalex-snapshot
BDI: a new decidable clause class
inferred← citeshttps://doi.org/10.1109/icstw.2010.17openalex-snapshot
SAT Solvers for Queries over Tree Automata with Constraints
inferred← citeshttps://doi.org/10.1145/1805950.1805957openalex-snapshot
Superposition for fixed domains
inferred← citeshttps://doi.org/10.22028/d291-25997openalex-snapshot
Saturation-based decision procedures for fixed domain and minimal model validity
inferred← citeshttps://doi.org/10.29007/8m7fopenalex-snapshot
BDI: A New Decidable First-order Clause Class
inferred← citeshttps://doi.org/10.70675/1d2faef9z4870z4465za5eez55259099d9d9openalex-snapshot
Régularité et contraintes de descendance : équations algébriques
showing the first 19 of 20 · page through all 20
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.