On the public citation graph
The decidability of simultaneous rigid E-unification with one variable
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.1007/3-540-51081-8_123openalex-snapshot
Efficient ground completion
inferredcites →https://doi.org/10.1007/3-540-59338-1_25openalex-snapshot
Rigid E-unification simplified
inferredcites →https://doi.org/10.1007/3-540-61208-4_20openalex-snapshot
Proof-search in intuitionistic logic based on constraint satisfaction
inferredcites →https://doi.org/10.1007/3-540-61377-3_38openalex-snapshot
Simultaneous rigid E-unification is undecidable
inferredcites →https://doi.org/10.1007/3-540-61511-3_67openalex-snapshot
Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification
inferredcites →https://doi.org/10.1007/3-540-63385-5_52openalex-snapshot
The undecidability of simultaneous rigid E-unification with two variables
inferredcites →https://doi.org/10.1007/978-1-4684-8968-2_11openalex-snapshot
Choice of Terms in Quantifier Rules of Constructive Predicate Calculus
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0052370openalex-snapshot
The decidability of simultaneous rigid E-unification with one variable
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/0304-3975(94)90101-5openalex-snapshot
Bottom-up tree pushdown automata: classification and connection with rewrite systems
inferredcites →https://doi.org/10.1016/0304-3975(96)00092-8openalex-snapshot
The undecidability of simultaneous rigid E-unification
inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(69)90065-5openalex-snapshot
Tree generating regular systems
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0529224-9openalex-snapshot
Lower Bounds on Herbrand's Theorem
inferredcites →https://doi.org/10.1109/lics.1988.5121openalex-snapshot
Rigid E-unification is NP-complete
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1109/lics.1994.316041openalex-snapshot
Rigid E/spl I.oarr/-unifiability is DEXPTIME-complete
inferredcites →https://doi.org/10.1109/lics.1996.561467openalex-snapshot
Decidability problems for the prenex fragment of intuitionistic logic
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1145/359545.359570openalex-snapshot
An algorithm for reasoning about equality
inferredcites →https://doi.org/10.1145/800105.803406openalex-snapshot
Complexity of finitely presented algebras
inferredcites →https://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2797openalex-snapshot
Logic with Equality: Partisan Corroboration and Shifted Pairing
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_22openalex-snapshot
Decidable Fragments of Simultaneous Rigid Reachability
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_173openalex-snapshot
Monadic simultaneous rigid E-unification and related problems
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_52openalex-snapshot
The undecidability of simultaneous rigid E-unification with two variables
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_1openalex-snapshot
Yuri, Logic, and Computer Science
inferred← citeshttps://doi.org/10.1007/978-94-010-0630-9_4openalex-snapshot
Kanger’s Choices in Automated Reasoning
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00123-6openalex-snapshot
Monadic simultaneous rigid E-unification
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00317-xopenalex-snapshot
Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
inferred← citeshttps://doi.org/10.1109/lics.1998.705662openalex-snapshot
Herbrand's theorem, automated reasoning and semantic tableaux
inferred← citeshttps://doi.org/10.1109/lics.1998.705663openalex-snapshot
The relation between second-order unification and simultaneous rigid E-unification
showing the first 12 of 13 · page through all 13
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.