On the public citation graph
The unification of infinite sets of terms and its applications
0 signed · 43 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-54233-7_122openalex-snapshot
Logic programming with recurrence domains
inferredcites →https://doi.org/10.1007/bf00245019openalex-snapshot
Non-negative integer basis algorithms for linear equations with integer coefficients
inferredcites →https://doi.org/10.1007/bfb0013079openalex-snapshot
The unification of infinite sets of terms and its applications
inferredcites →https://doi.org/10.1016/0004-3702(89)90012-xopenalex-snapshot
On the existence of nonterminating queries for a restricted class of PROLOG-clauses
inferredcites →https://doi.org/10.1016/0304-3975(89)90007-8openalex-snapshot
Schematization of infinite sets of rewrite rules generated by divergent completion processes
inferredcites →https://doi.org/10.1016/0304-3975(90)90066-qopenalex-snapshot
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
inferredcites →https://doi.org/10.1016/b978-0-444-88771-9.50008-8openalex-snapshot
Compilation of Recursive Two-Literal Clauses into Unification Algorithms**This work was supported by the “Sonderforschungsbereich 314, D2” of the German Science Foundation (DFG).
inferredcites →https://doi.org/10.1016/s0747-7171(89)80025-2openalex-snapshot
Efficient solution of linear diophantine equations
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.2307/2272384openalex-snapshot
J. A. Robinson. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 (1965), pp. 227–234.
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.1995.1140openalex-snapshot
Recurrence Domains: Their Unification and Application to Logic Programming
inferred← citeshttps://doi.org/10.1006/jsco.1997.0114openalex-snapshot
Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1006/jsco.1997.0186openalex-snapshot
Completion of Rewrite Systems with Membership Constraints Part II: Constraint Solving
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_10openalex-snapshot
Proof and Model Generation with Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_48openalex-snapshot
A General Method for Using Schematizations in Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_20openalex-snapshot
Primal grammars and unification modulo a binary clause
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_48openalex-snapshot
Computational representations of herbrand models using grammars
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_44openalex-snapshot
Comparing computational representations of Herbrand models
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_33openalex-snapshot
A Unified View of Tree Automata and Term Schematisations
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_9openalex-snapshot
Constraints in Term Algebras (Short Survey)
inferred← citeshttps://doi.org/10.1007/978-3-322-91230-5_6openalex-snapshot
Phänomene der Knuth-Bendix Vervollständigung
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_11openalex-snapshot
Dei: A Theorem Prover for Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_4openalex-snapshot
I-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_32openalex-snapshot
Perfect Discrimination Graphs: Indexing Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_28openalex-snapshot
Infinite Families of Finite String Rewriting Systems and Their Confluence
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_5openalex-snapshot
The Connection Method, Constraints and Model Building
inferred← citeshttps://doi.org/10.1007/bf01294596openalex-snapshot
On unification of terms with integer exponents
inferred← citeshttps://doi.org/10.1007/bfb0030608openalex-snapshot
Set operations for recurrent term schematizations
inferred← citeshttps://doi.org/10.1007/bfb0055775openalex-snapshot
On the word, subsumption, and complement problem for recurrent term schematizations
inferred← citeshttps://doi.org/10.1007/s10472-010-9200-3openalex-snapshot
Simplified handling of iterated term schemata
inferred← citeshttps://doi.org/10.1007/s10817-006-9064-8openalex-snapshot
Tree Tuple Languages from the Logic Programming Point of View
inferred← citeshttps://doi.org/10.1007/s10817-014-9309-xopenalex-snapshot
A Complete Superposition Calculus for Primal Grammars
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.007openalex-snapshot
The first order theory of primal grammars is decidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00345-0openalex-snapshot
On the non-termination of MDG-based abstract state enumeration
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00052-7openalex-snapshot
Unification of infinite sets of terms schematized by primal grammars
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80669-8openalex-snapshot
Improving Termination of MDG-Based Abstract State Enumeration via Term Schematization
inferred← citeshttps://doi.org/10.1017/s0960129518000208openalex-snapshot
Linear pattern matching of compressed terms and polynomial rewriting
inferred← citeshttps://doi.org/10.3233/fi-1997-30105openalex-snapshot
Tree Automata and Automated Model Building
inferred← citeshttps://doi.org/10.3233/fi-1999-39304openalex-snapshot
A Comprehensive Setting for Matching and Unification over Iterative Terms
showing the first 30 of 31 · page through all 31
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.