On the public citation graph

A decidability result about sufficient-completeness of axiomatically specified abstract data types

https://doi.org/10.1007/bfb0036486
0 signed · 38 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.1007/3-540-10828-9_57openalex-snapshot
Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG
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/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1994.1005openalex-snapshot
Linearizing Term Rewriting Systems Using Test Sets
inferred← citeshttps://doi.org/10.1007/11805618_20openalex-snapshot
RAPT: A Program Transformation System Based on Term Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_84openalex-snapshot
How to prove equivalence of term rewriting systems without induction
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_26openalex-snapshot
Complexity of sufficient-completeness
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_62openalex-snapshot
An effective method for handling initial algebras
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_72openalex-snapshot
A new quasi-reducibility testing algorithm and its application to proofs by induction
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_100openalex-snapshot
Computing ground reducibility and inductively complete positions
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_97openalex-snapshot
On sufficient completeness of conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_21openalex-snapshot
Computing linearizations using test sets
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_138openalex-snapshot
Ground reducibility and automata with disequality constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_19openalex-snapshot
Inductive Theorems for Higher-Order Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_13openalex-snapshot
A Sufficient Completeness Reasoning Tool for Partial Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_3openalex-snapshot
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_42openalex-snapshot
Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories
inferred← citeshttps://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferred← citeshttps://doi.org/10.1007/bf01212959openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bf01893885openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bfb0052368openalex-snapshot
Decidable approximations of sets of descendants and sets of normal forms
inferred← citeshttps://doi.org/10.1007/s10817-004-6246-0openalex-snapshot
Reachability Analysis over Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/s10817-018-9465-5openalex-snapshot
Introduction to Milestones in Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90004-lopenalex-snapshot
An analysis of loop checking mechanisms for logic programs
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90015-vopenalex-snapshot
Well rewrite orderings and well quasi-orderings
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90033-eopenalex-snapshot
Tools for proving inductive equalities, relative completeness, and ω-completeness
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50008-0openalex-snapshot
Completion and Its Applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.028openalex-snapshot
Proving weak properties of rewriting
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80133-2openalex-snapshot
Automating inductionless induction using test sets
inferred← citeshttps://doi.org/10.1145/1140335.1140351openalex-snapshot
Computing constructor forms with non terminating rewrite programs
inferred← citeshttps://doi.org/10.1145/186258.186496openalex-snapshot
An automated tool for analyzing completeness of equational specifications
inferred← citeshttps://doi.org/10.1145/3354166.3354178openalex-snapshot
Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation
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.