On the public citation graph

On sufficient-completeness and related properties of term rewriting systems

https://doi.org/10.1007/bf00292110
0 signed · 124 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_85openalex-snapshot
Sufficient completeness, term rewriting systems and ”anti-unification”
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.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(82)90006-xopenalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1016/0022-0000(85)90051-0openalex-snapshot
Complexity of certain decision problems about congruential languages
inferredcites →https://doi.org/10.1016/0304-3975(84)90090-2openalex-snapshot
Some undecidability results for non-monadic Church-Rosser Thue systems
inferredcites →https://doi.org/10.1016/0304-3975(85)90023-4openalex-snapshot
A finite thue system with decidable word problem and without equivalent finite canonical system
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/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
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

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.1054openalex-snapshot
Decidability of Regularity and Related Properties of Ground Normal Form Languages
inferred← citeshttps://doi.org/10.1006/inco.2000.2875openalex-snapshot
Induction=I-Axiomatization+First-Order Consistency
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.1005openalex-snapshot
Linearizing Term Rewriting Systems Using Test Sets
inferred← citeshttps://doi.org/10.1006/jsco.1996.0076openalex-snapshot
Automated Theorem Proving by Test Set Induction
inferred← citeshttps://doi.org/10.1007/11805618_20openalex-snapshot
RAPT: A Program Transformation System Based on Term Rewriting
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/3-540-16780-3_83openalex-snapshot
Proof by induction using test sets
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-45719-4_9openalex-snapshot
Removing Redundant Arguments of Functions*
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-50667-5_62openalex-snapshot
An effective method for handling initial algebras
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_70openalex-snapshot
Proving inductive theorems based on term rewriting systems
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-51081-8_101openalex-snapshot
Inductive proofs by specification transformations
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_138openalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_51openalex-snapshot
Testing for inductiue (co)-reducibility
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_105openalex-snapshot
On relationship between term rewriting systems and regular tree languages
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_120openalex-snapshot
Open problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_95openalex-snapshot
Proofs in parameterized specifications
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_99openalex-snapshot
Program transformation and rewriting
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_102openalex-snapshot
Design strategies for rewrite rules
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_97openalex-snapshot
On sufficient completeness of conditional specifications
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_44openalex-snapshot
Elimination of negation in term algebras
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_20openalex-snapshot
Decidability of regularity and related properties of ground normal form languages
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-56610-4_55openalex-snapshot
Proving ground confluence and inductive validity in constructor based equational specifications
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-56868-9_39openalex-snapshot
More problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_11openalex-snapshot
A taste of rewrite systems
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-57867-6_2openalex-snapshot
Rewriting techniques for software engineering
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_10openalex-snapshot
On the connection between narrowing and proof by consistency
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_49openalex-snapshot
Towards an efficient construction of test sets for deciding ground reducibility
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_82openalex-snapshot
Problems in rewriting III
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-62034-6_56openalex-snapshot
Higher-order proof by consistency
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_22openalex-snapshot
A Proof Method for Local Sufficient Completeness of Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_14openalex-snapshot
Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_20openalex-snapshot
Correctness of Context-Moving Transformations for Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_8openalex-snapshot
Complexity Analysis for Term Rewriting by Integer Transition Systems
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/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_7openalex-snapshot
Rewrite Proofs and Computations
inferred← citeshttps://doi.org/10.1007/bf01189020openalex-snapshot
Narrowing based procedures for equational disunification
inferred← citeshttps://doi.org/10.1007/bf01212959openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bf01530799openalex-snapshot
Proving Ramsey's theorem by the cover set induction: A case and comparison study
inferred← citeshttps://doi.org/10.1007/bf01893885openalex-snapshot
Sufficient-completeness, ground-reducibility and their complexity
inferred← citeshttps://doi.org/10.1007/bfb0012831openalex-snapshot
A mechanizable induction principle for equational specifications
inferred← citeshttps://doi.org/10.1007/bfb0013831openalex-snapshot
Uniform narrowing strategies
inferred← citeshttps://doi.org/10.1007/bfb0013833openalex-snapshot
A fast algorithm for ground normal form analysis
inferred← citeshttps://doi.org/10.1007/bfb0029631openalex-snapshot
Pumping lemmrs for tree languages generated by rewrite systems
inferred← citeshttps://doi.org/10.1007/bfb0032066openalex-snapshot
Equational formulas in order-sorted algebras
inferred← citeshttps://doi.org/10.1007/bfb0052366openalex-snapshot
About proofs by consistency
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/bfb0052380openalex-snapshot
An on-line problem database
inferred← citeshttps://doi.org/10.1007/s10817-004-6246-0openalex-snapshot
Reachability Analysis over Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/s10817-010-9215-9openalex-snapshot
Proving Termination by Dependency Pairs and Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00109-xopenalex-snapshot
Extending Bachmair's method for proof by consistency to the final algebra
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00188-5openalex-snapshot
Undecidability of ground reducibility for word rewriting systems with variables
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90279-oopenalex-snapshot
Testing for the ground (co-)reducibility property in term-rewriting systems
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90062-xopenalex-snapshot
Automatic proofs by induction in theories without constructors
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90023-bopenalex-snapshot
On ground-confluence of term rewriting systems
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/0898-1221(94)00218-aopenalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50008-0openalex-snapshot
Completion and Its Applications
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50013-4openalex-snapshot
Inductive Completion by Ground Proof Transformation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50006-xopenalex-snapshot
Equational Logic and Rewriting
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50016-3openalex-snapshot
Inductionless Induction
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
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.2021.100680openalex-snapshot
Applications and extensions of context-sensitive rewriting
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.jsc.2010.01.008openalex-snapshot
Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.028openalex-snapshot
Proving weak properties of rewriting
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(96)00005-9openalex-snapshot
Using induction and rewriting to verify and complete parameterized specifications
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80133-2openalex-snapshot
Automating inductionless induction using test sets
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80069-0openalex-snapshot
A strong restriction of the inductive completion procedure
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00134-2openalex-snapshot
Ground reducibility is EXPTIME-complete
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1017/s1471068406002869openalex-snapshot
Removing redundant arguments automatically
inferred← citeshttps://doi.org/10.1109/32.277574openalex-snapshot
Using term rewriting to verify software
inferred← citeshttps://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferred← citeshttps://doi.org/10.1109/lics.1997.614922openalex-snapshot
Ground reducibility is EXPTIME-complete
inferred← citeshttps://doi.org/10.1145/1140335.1140351openalex-snapshot
Computing constructor forms with non terminating rewrite programs
inferred← citeshttps://doi.org/10.1145/174652.174655openalex-snapshot
Equational inference, canonical proofs, and proof orderings
inferred← citeshttps://doi.org/10.1145/186258.186496openalex-snapshot
An automated tool for analyzing completeness of equational specifications
inferred← citeshttps://doi.org/10.1145/326619.326745openalex-snapshot
On ground reducibility problem for word rewriting systems with variables
inferred← citeshttps://doi.org/10.1145/3354166.3354178openalex-snapshot
Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation
inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot
A Nominal Approach to Equational Problems in Languages with Binders
inferred← citeshttps://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.46298/dmtcs.331openalex-snapshot
Towards automated proofs of observational properties
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.