On the public citation graph

Sufficient-completeness, ground-reducibility and their complexity

https://doi.org/10.1007/bf01893885
0 signed · 79 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-10009-1_27openalex-snapshot
How to prove algebraic inductive hypotheses without induction
inferredcites →https://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferredcites →https://doi.org/10.1007/3-540-16780-3_83openalex-snapshot
Proof by induction using test sets
inferredcites →https://doi.org/10.1007/3-540-16780-3_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
inferredcites →https://doi.org/10.1007/3-540-17179-7_26openalex-snapshot
Complexity of sufficient-completeness
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/bf00243794openalex-snapshot
Explicit representation of terms defined by counter examples
inferredcites →https://doi.org/10.1007/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferredcites →https://doi.org/10.1007/bf00292110openalex-snapshot
On sufficient-completeness and related properties of term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0036486openalex-snapshot
A decidability result about sufficient-completeness of axiomatically specified abstract data types
inferredcites →https://doi.org/10.1016/0004-3702(87)90017-8openalex-snapshot
Proof by consistency
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1016/0022-0000(82)90006-xopenalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1016/0022-0000(84)90010-2openalex-snapshot
Complete problems in the first-order predicate calculus
inferredcites →https://doi.org/10.1016/0022-0000(84)90021-7openalex-snapshot
The complexity of monadic recursion schemes: exponential time bounds
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-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0019-9958(85)80003-6openalex-snapshot
Computing with 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.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322290.322301openalex-snapshot
Confluent and Other Types of Thue Systems
inferredcites →https://doi.org/10.1145/567446.567461openalex-snapshot
On proving inductive properties of abstract data types
inferredcites →https://doi.org/10.1145/800017.800518openalex-snapshot
Stop losing sleep over incomplete data type specifications
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines

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.2000.2875openalex-snapshot
Induction=I-Axiomatization+First-Order Consistency
inferred← citeshttps://doi.org/10.1006/inco.2000.2915openalex-snapshot
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
inferred← citeshttps://doi.org/10.1006/inco.2002.3156openalex-snapshot
Test Sets for the Universal and Existential Closure of Regular Tree Languages
inferred← citeshttps://doi.org/10.1006/jsco.1994.1049openalex-snapshot
Tree Automata Help One To Solve Equational Formulae In AC-Theories
inferred← citeshttps://doi.org/10.1006/jsco.1998.0203openalex-snapshot
Negation Elimination in Empty or Permutative Theories
inferred← citeshttps://doi.org/10.1007/10721975_13openalex-snapshot
The Explicit Representability of Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11532231_30openalex-snapshot
Model Representation via Contexts and Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11814771_14openalex-snapshot
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
inferred← citeshttps://doi.org/10.1007/11853886_15openalex-snapshot
Model Representation over Finite and Infinite Signatures
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_44openalex-snapshot
The Theory of Total Unary RPO Is Decidable
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_25openalex-snapshot
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_16openalex-snapshot
Test Sets for the Universal and Existential Closure of Regular Tree Languages
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/3-540-58715-2_144openalex-snapshot
Using linear arithmetic procedure for generating induction schemes
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_16openalex-snapshot
The complexity of testing ground reducibility for linear word rewriting systems with variables
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_71openalex-snapshot
Automated verification by induction with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_8openalex-snapshot
On First-Order Model-Based Reasoning
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-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_12openalex-snapshot
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_38openalex-snapshot
Modular Access Control Via Strategic Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_6openalex-snapshot
Data-Oblivious Stream Productivity
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/978-3-642-37651-1_10openalex-snapshot
Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_15openalex-snapshot
Behavioral Rewrite Systems and Behavioral Productivity
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_5openalex-snapshot
Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications
inferred← citeshttps://doi.org/10.1007/978-3-7091-6280-4_13openalex-snapshot
Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_2openalex-snapshot
New Uses of Linear Arithmetic in Automated Theorem Proving by Induction
inferred← citeshttps://doi.org/10.1007/978-981-10-0281-6_3openalex-snapshot
Proving Sufficient Completeness of Constructor-Based Algebraic Specifications
inferred← citeshttps://doi.org/10.1007/bf00244459openalex-snapshot
New uses of linear arithmetic in automated theorem proving by induction
inferred← citeshttps://doi.org/10.1007/bf01189020openalex-snapshot
Narrowing based procedures for equational disunification
inferred← citeshttps://doi.org/10.1007/bfb0013831openalex-snapshot
Uniform narrowing strategies
inferred← citeshttps://doi.org/10.1007/bfb0052366openalex-snapshot
About proofs by consistency
inferred← citeshttps://doi.org/10.1007/bfb0055071openalex-snapshot
A good class of tree automata. Application to inductive theorem proving
inferred← citeshttps://doi.org/10.1007/s10472-004-9434-zopenalex-snapshot
On Deciding Subsumption Problems
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00218-aopenalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50016-3openalex-snapshot
Inductionless Induction
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/j.jlamp.2026.101129openalex-snapshot
A verified algorithm for deciding pattern completeness with optimal asymptotic complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.024openalex-snapshot
Lazy productivity via termination
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.024openalex-snapshot
Stability of termination and sufficient-completeness under pushouts via amalgamation
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00583-2openalex-snapshot
Explicit versus implicit representations of subsets of the Herbrand universe
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00134-2openalex-snapshot
Ground reducibility is EXPTIME-complete
inferred← citeshttps://doi.org/10.1017/s1471068406002869openalex-snapshot
Removing redundant arguments automatically
inferred← citeshttps://doi.org/10.1093/logcom/exm008openalex-snapshot
Model Representation over Finite and Infinite Signatures
inferred← citeshttps://doi.org/10.1109/lics.1997.614922openalex-snapshot
Ground reducibility is EXPTIME-complete
inferred← citeshttps://doi.org/10.1145/1507244.1507250openalex-snapshot
Simultaneous checking of completeness and ground confluence for algebraic specifications
inferred← citeshttps://doi.org/10.1145/186258.186496openalex-snapshot
An automated tool for analyzing completeness of equational specifications
inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot
A Nominal Approach to Equational Problems in Languages with Binders
inferred← citeshttps://doi.org/10.29007/b923openalex-snapshot
A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories
inferred← citeshttps://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.48550/arxiv.0811.4720openalex-snapshot
Automated Induction for Complex Data Structures
inferred← citeshttps://doi.org/10.70675/33551aa7z7e96z4b24zbaa1zbe39a011a93dopenalex-snapshot
Rewriting and modularity for security policies
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.