On the public citation graph

Ordering constraints on trees

https://doi.org/10.1007/bfb0017470
0 signed · 52 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.1001openalex-snapshot
Decidability of the Existential Theory of Infinite Terms with Subterm Relation
inferredcites →https://doi.org/10.1007/3-540-18088-5_6openalex-snapshot
On word problems in equational theories
inferredcites →https://doi.org/10.1007/3-540-53904-2_115openalex-snapshot
Any ground associative-commutative theory has a finite canonical system
inferredcites →https://doi.org/10.1007/3-540-54233-7_155openalex-snapshot
Satisfiability of systems of ordinal notations with the subterm property is decidable
inferredcites →https://doi.org/10.1007/3-540-55253-7_22openalex-snapshot
Basic superposition is complete
inferredcites →https://doi.org/10.1007/3-540-55602-8_185openalex-snapshot
Basic paramodulation and superposition
inferredcites →https://doi.org/10.1007/3-540-55602-8_186openalex-snapshot
Theorem proving with ordering constrained clauses
inferredcites →https://doi.org/10.1007/3-540-56610-4_77openalex-snapshot
About the theory of tree embedding
inferredcites →https://doi.org/10.1007/3-540-56868-9_25openalex-snapshot
Encompassment properties and automata with constraints
inferredcites →https://doi.org/10.1007/3-540-56868-9_28openalex-snapshot
A precedence-based total AC-compatible ordering
inferredcites →https://doi.org/10.1007/978-1-4471-3227-1_9openalex-snapshot
Constraints in Term Algebras (Short Survey)
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bfb0032066openalex-snapshot
Equational formulas in order-sorted algebras
inferredcites →https://doi.org/10.1016/0020-0190(93)90226-yopenalex-snapshot
Simple LPO constraint solving methods
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0747-7171(92)90016-wopenalex-snapshot
A new method for undecidability proofs of first order theories
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0019-9958(85)80005-xopenalex-snapshot
Semantic confluence tests and completion methods
inferredcites →https://doi.org/10.1016/s0304-3975(96)00049-7openalex-snapshot
The first-order theory of lexicographic path orderings is undecidable
inferredcites →https://doi.org/10.1142/s0129054190000278openalex-snapshot
SOLVING SYMBOLIC ORDERING CONSTRAINTS
inferredcites →https://doi.org/10.1145/23005.24037openalex-snapshot
Decidability of the purely existential fragment of the theory of term algebras
inferredcites →https://doi.org/10.2307/2268308openalex-snapshot
Concatenation as a basis for arithmetic

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.2002.3146openalex-snapshot
Practical Algorithms for Deciding Path Ordering Constraint Satisfaction
inferred← citeshttps://doi.org/10.1006/jsco.1996.0077openalex-snapshot
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
inferred← citeshttps://doi.org/10.1007/11532231_10openalex-snapshot
The Decidability of the First-Order Theory of Knuth-Bendix Order
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_12openalex-snapshot
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_1openalex-snapshot
Constraints and Constraint Solving: An Introduction
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_1openalex-snapshot
Solved Forms for Path Ordering Constraints
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_4openalex-snapshot
Constraints in term algebras an overview of constraint solving techniques
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_69openalex-snapshot
Combination of constraint solving techniques: An algebraic point of view
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_18openalex-snapshot
Proving Termination Using Recursive Path Orders and SAT Solving
inferred← citeshttps://doi.org/10.1007/bfb0016865openalex-snapshot
Solving simplification ordering constraints
inferred← citeshttps://doi.org/10.1007/s13218-010-0015-5openalex-snapshot
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00147-3openalex-snapshot
Combination of constraint solvers for free and quasi-free structures
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00021-xopenalex-snapshot
Orienting rewrite rules with the Knuth–Bendix order
inferred← citeshttps://doi.org/10.1023/a:1009868906501openalex-snapshot
A Methodological View of Constraint Solving
inferred← citeshttps://doi.org/10.1051/ita:2005039openalex-snapshot
Theories of orders on the set of words
inferred← citeshttps://doi.org/10.1109/lics.2000.855777openalex-snapshot
A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering
inferred← citeshttps://doi.org/10.1109/lics.2003.1210047openalex-snapshot
Orienting equalities with the Knuth-Bendix order
inferred← citeshttps://doi.org/10.1109/lics.2017.8005141openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
inferred← citeshttps://doi.org/10.1145/1055686.1055692openalex-snapshot
Knuth--bendix constraint solving is NP-complete
inferred← citeshttps://doi.org/10.1145/503272.503292openalex-snapshot
The first-order theory of subtyping constraints
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:21)2018openalex-snapshot
Defining Recursive Predicates in Graph Orders
inferred← citeshttps://doi.org/10.4230/dagsemproc.07401.5openalex-snapshot
Implementing RPO and POLO using SAT
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.84openalex-snapshot
Decidability in the Logic of Subsequences and Supersequences
inferred← citeshttps://doi.org/10.5555/3329995.3330076openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93980openalex-snapshot
Automated deduction with built-in theories: completeness results and constraint solving techniques
inferred← citeshttps://doi.org/10.70675/4a3d121bzbb9az47ebzb688z4c3e0339c01bopenalex-snapshot
On Effective Representations of Well Quasi-Orderings
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.