On the public citation graph
Ground term confluence in parametric conditional equational specifications
0 signed · 55 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-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-11490-4_21openalex-snapshot
Parameter passing in algebraic specification languages
inferredcites →https://doi.org/10.1007/3-540-12920-0_8openalex-snapshot
Towards executable specifications using conditional axioms
inferredcites →https://doi.org/10.1007/3-540-15976-2_7openalex-snapshot
NARROWER: a new algorithm for unification and its application to Logic Programming
inferredcites →https://doi.org/10.1007/3-540-16761-7_60openalex-snapshot
A Strong restriction of the inductive completion procedure
inferredcites →https://doi.org/10.1007/978-3-662-09691-8_11openalex-snapshot
Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence
inferredcites →https://doi.org/10.1007/bfb0036909openalex-snapshot
Algebraic specifications with generating constraints
inferredcites →https://doi.org/10.1016/0022-0000(81)90002-7openalex-snapshot
A complete proof of correctness of the Knuth-Bendix completion algorithm
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1145/567067.567078openalex-snapshot
Computer experiments with the REVE term rewriting system generator
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_129openalex-snapshot
Trspec: A term rewriting based system for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-18341-8_21openalex-snapshot
Integration of program construction and verification: the PROSPECTRA methodology
inferred← citeshttps://doi.org/10.1007/3-540-18928-9_4openalex-snapshot
Current trends in rewriting techniques and related problems
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_27openalex-snapshot
CEC: A system for the completion of conditional equational specifications
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_11openalex-snapshot
Positive/negative conditional rewriting
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_12openalex-snapshot
On word problems in Horn theories
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_18openalex-snapshot
TRSPEC: A term rewriting based system for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_19openalex-snapshot
CEC: A system for the completion of conditional equational specifications
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_2openalex-snapshot
Hierarchical contextual rewriting with several levels
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_21openalex-snapshot
REVEUR4: A laboratory for conditional rewriting
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_6openalex-snapshot
A completion procedure for conditional equations
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_94openalex-snapshot
Algebraic and operational semantics of positive/negative conditional algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_61openalex-snapshot
A completion procedure for hierarchical conditional rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_26openalex-snapshot
Algebraic specification and functionals for transformational program and meta program development
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_114openalex-snapshot
Priority rewriting: Semantics, confluence, and conditionals
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_95openalex-snapshot
Proofs in parameterized specifications
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_80openalex-snapshot
A proof system for conditional algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_89openalex-snapshot
Completion of first-order clauses with equality by strict superposition
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_91openalex-snapshot
Proof by consistency in conditional equational theories
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_5openalex-snapshot
Sufficient completeness and parameterized proofs by induction
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_14openalex-snapshot
Affine geometry of collinearity and conditional term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_66openalex-snapshot
On theorem-proving in Horn theories with built-in algebras
inferred← citeshttps://doi.org/10.1007/978-3-031-12441-9_10openalex-snapshot
On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
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.1007/978-3-642-37651-1_7openalex-snapshot
From Search to Computation: Redundancy Criteria and Simplification at Work
inferred← citeshttps://doi.org/10.1007/978-94-009-1063-8_25openalex-snapshot
Algebraic Specification with Functionals in Program Development by Transformation
inferred← citeshttps://doi.org/10.1007/bf01178578openalex-snapshot
Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
inferred← citeshttps://doi.org/10.1007/bf01202035openalex-snapshot
Conditional narrowing modulo a set of equations
inferred← citeshttps://doi.org/10.1007/bfb0017161openalex-snapshot
Positive/Negative conditional rewriting
inferred← citeshttps://doi.org/10.1007/bfb0018267openalex-snapshot
Transformational meta program development
inferred← citeshttps://doi.org/10.1007/bfb0035845openalex-snapshot
Hierarchical contextual rewriting with several levels
inferred← citeshttps://doi.org/10.1007/bfb0039631openalex-snapshot
REVEUR4 : A laboratory for conditional rewriting
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50011-0openalex-snapshot
Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.
inferred← citeshttps://doi.org/10.1016/j.jal.2011.09.001openalex-snapshot
Sufficient completeness verification for conditional and constrained TRS
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00005-9openalex-snapshot
Using induction and rewriting to verify and complete parameterized specifications
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80132-0openalex-snapshot
A completion procedure for conditional equationst
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80134-4openalex-snapshot
On word problems in horn theories
inferred← citeshttps://doi.org/10.1109/ase.2000.873659openalex-snapshot
Simultaneous checking of completeness and ground confluence
inferred← citeshttps://doi.org/10.1109/icse.1990.63618openalex-snapshot
System support for modular order-sorted Horn clause specifications
inferred← citeshttps://doi.org/10.1145/1507244.1507250openalex-snapshot
Simultaneous checking of completeness and ground confluence for algebraic specifications
inferred← citeshttps://doi.org/10.5555/100296.100318openalex-snapshot
System support for modular order-sorted horn clause specifications
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.