On the public citation graph
Equational formulas in order-sorted algebras
0 signed · 60 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.1993.1016openalex-snapshot
Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems
inferredcites →https://doi.org/10.1007/3-540-19488-6_123openalex-snapshot
Operational semantics of OBJ-3
inferredcites →https://doi.org/10.1007/3-540-50667-5_58openalex-snapshot
Logic programming with polymorphically order-sorted types
inferredcites →https://doi.org/10.1007/3-540-51081-8_101openalex-snapshot
Inductive proofs by specification transformations
inferredcites →https://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferredcites →https://doi.org/10.1016/s0019-9958(85)80005-xopenalex-snapshot
Semantic confluence tests and completion methods
inferredcites →https://doi.org/10.1016/s0049-237x(08)70560-3openalex-snapshot
Chapter 23 Axiomatizable Classes of Locally Free Algebras of Various Types
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1109/lics.1989.39185openalex-snapshot
Unified algebras and institutions
inferredcites →https://doi.org/10.1112/blms/4.2.238openalex-snapshot
THE METAMATHEMATICS OF ALGEBRAIC SYSTEMS
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.1994.1056openalex-snapshot
Equational Formulas with Membership Constraints
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.1996.0077openalex-snapshot
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
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.1006/jsco.1998.0203openalex-snapshot
Negation Elimination in Empty or Permutative Theories
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_122openalex-snapshot
Logic programming with recurrence domains
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_156openalex-snapshot
Complete axiomatizations of some quotient term algebras
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_165openalex-snapshot
Unification in order-sorted algebras with overloading
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_91openalex-snapshot
Completion of rewrite systems with membership constraints
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_38openalex-snapshot
Label algebras: A systematic use of terms
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_29openalex-snapshot
Confluence of terminating membership conditional TRS
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_31openalex-snapshot
Completion for constrained term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_25openalex-snapshot
Encompassment properties and automata with constraints
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_88openalex-snapshot
Pumping, cleaning and symbolic constraints solving
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_71openalex-snapshot
Regular substitution sets: A means of controlling E-unification
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-030-85315-0_10openalex-snapshot
A Complete Semantics of $$\mathbb {K}$$ and Its Translation to Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_3openalex-snapshot
Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_9openalex-snapshot
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_2openalex-snapshot
Symbolic Reasoning Methods in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_1openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework
inferred← citeshttps://doi.org/10.1007/bf02127750openalex-snapshot
Unification in sort theories and its applications
inferred← citeshttps://doi.org/10.1007/bfb0015462openalex-snapshot
A fine-grain sort discipline and its application to formal program construction
inferred← citeshttps://doi.org/10.1007/bfb0020795openalex-snapshot
Decision problems for term rewriting systems and recognizable tree languages
inferred← citeshttps://doi.org/10.1007/s00165-017-0415-5openalex-snapshot
Equational formulas and pattern operations in initial order-sorted algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90322-7openalex-snapshot
Semantics of order-sorted specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90108-6openalex-snapshot
Complete axiomatizations of some quotient term algebras
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.12.006openalex-snapshot
Metalevel algorithms for variant satisfiability
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100483openalex-snapshot
Generalized rewrite theories, coherence completion, and symbolic methods
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00014-2openalex-snapshot
Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms
inferred← citeshttps://doi.org/10.1016/s0747-7171(10)80014-8openalex-snapshot
A method for simultaneous search for refutations and models by equational constraint solving
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00040-4openalex-snapshot
Rewriting Logic as a Logical and Semantic Framework1 1This paper is a short version of [36], where the reader can find more examples and details not discussed here.
inferred← citeshttps://doi.org/10.1109/icse.1990.63620openalex-snapshot
Mixing abstract and concrete modules: specification, development and prototyping
inferred← citeshttps://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.3233/fi-1997-30105openalex-snapshot
Tree Automata and Automated Model Building
inferred← citeshttps://doi.org/10.4204/eptcs.265.3openalex-snapshot
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0953openalex-snapshot
Implementing Anti-Unification Modulo Equational Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1603.02928openalex-snapshot
Weight Computation of Regular Tree Languages
inferred← citeshttps://doi.org/10.5555/100296.100320openalex-snapshot
Mixing abstract and concrete modules: specification, development and prototyping
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.