On the public citation graph

A mechanizable induction principle for equational specifications

0 signed · 111 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-11607-9_10openalex-snapshot

Rewrite rule theory and abstract data type analysis

inferredcites →https://doi.org/10.1007/3-540-16780-3_133openalex-snapshot

Overview of a theorem-prover for a computational logic

inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot

RRL: A rewrite rule laboratory

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_97openalex-snapshot

Formulation of induction formulas in verification of prolog programs

inferredcites →https://doi.org/10.1007/978-0-387-34768-4_17openalex-snapshot

A General Inductive Completion Algorithm and Application to Abstract Data Types

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/bf00292110openalex-snapshot

On sufficient-completeness and related properties of term rewriting systems

inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot

Rewrite methods for clausal and non-clausal theorem proving

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/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/s0049-237x(08)72018-4openalex-snapshot

A Basis for a Mathematical Theory of Computation )

inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot

Termination of rewriting

inferredcites →https://doi.org/10.1093/comjnl/12.1.41openalex-snapshot

Proving Properties of Programs by Structural Induction

inferredcites →https://doi.org/10.1109/sfcs.1980.37openalex-snapshot

Proofs by induction in equational theories with constructors

inferredcites →https://doi.org/10.1145/321941.321957openalex-snapshot

Proving Properties of Complex Data Structures

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

inferredcites →https://doi.org/10.2307/2218270openalex-snapshot

Computer Programming and Formal 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.2001.3036openalex-snapshot

Automata-Driven Automated Induction

inferred← citeshttps://doi.org/10.1006/jsco.1994.1004openalex-snapshot

A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications

inferred← citeshttps://doi.org/10.1006/jsco.1996.0076openalex-snapshot

Automated Theorem Proving by Test Set Induction

inferred← citeshttps://doi.org/10.1006/jsco.1999.0361openalex-snapshot

Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria

inferred← citeshttps://doi.org/10.1006/jsco.2000.0469openalex-snapshot

A General Framework to Build Contextual Cover Set Induction Provers

inferred← citeshttps://doi.org/10.1007/10720327_17openalex-snapshot

Context-Moving Transformations for Function Verification

inferred← citeshttps://doi.org/10.1007/10721959_26openalex-snapshot

Extending Decision Procedures with Induction Schemes

inferred← citeshttps://doi.org/10.1007/10930755_9openalex-snapshot

Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions

inferred← citeshttps://doi.org/10.1007/11554554_20openalex-snapshot

Automatic ‘Descente Infinie’ Induction Reasoning

inferred← citeshttps://doi.org/10.1007/11916277_4openalex-snapshot

Inductive Decidability Using Implicit Induction

inferred← citeshttps://doi.org/10.1007/3-540-44525-0_28openalex-snapshot

Closure Induction in a Z-Like Language

inferred← citeshttps://doi.org/10.1007/3-540-44525-0_6openalex-snapshot

Reasoning Inductively about Z Specifications via Unification

inferred← citeshttps://doi.org/10.1007/3-540-44881-0_25openalex-snapshot

“Term Partition” for Mathematical Induction

inferred← citeshttps://doi.org/10.1007/3-540-45744-5_41openalex-snapshot

Decidable Classes of Inductive Theorems

inferred← citeshttps://doi.org/10.1007/3-540-45988-x_8openalex-snapshot

A Rewrite Rule Based Framework for Combining Decision Procedures *

inferred← citeshttps://doi.org/10.1007/3-540-49366-2_3openalex-snapshot

Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover

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_138openalex-snapshot

An overview of Rewrite Rule Laboratory (RRL)

inferred← citeshttps://doi.org/10.1007/3-540-52885-7_86openalex-snapshot

Term rewriting induction

inferred← citeshttps://doi.org/10.1007/3-540-53487-3_33openalex-snapshot

Complexity of algebraic specifications

inferred← citeshttps://doi.org/10.1007/3-540-53904-2_119openalex-snapshot

The tecton proof system

inferred← citeshttps://doi.org/10.1007/3-540-55602-8_182openalex-snapshot

Proving the Chinese remainder theorem by the cover set induction

inferred← citeshttps://doi.org/10.1007/3-540-55602-8_205openalex-snapshot

FRI: Failure-resistant induction in RRL

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_12openalex-snapshot

On notions of inductive validity for first-order equational clauses

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_71openalex-snapshot

SPIKE: A system for sufficient completeness and parameterized inductive proofs

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_8openalex-snapshot

Induction using term orderings

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_9openalex-snapshot

Mechanizable inductive proofs for a class of ∀ ∃ formulas

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-58715-2_144openalex-snapshot

Using linear arithmetic procedure for generating induction schemes

inferred← citeshttps://doi.org/10.1007/3-540-60043-4_68openalex-snapshot

Automated reasoning about parallel algorithms using powerlists

inferred← citeshttps://doi.org/10.1007/3-540-61286-6_146openalex-snapshot

Automating proofs of integrity constraints in situation calculus

inferred← citeshttps://doi.org/10.1007/3-540-61286-6_179openalex-snapshot

Automated inductive reasoning as a support of deductive reasoning in a user-independent automation of inductive theorem proving

inferred← citeshttps://doi.org/10.1007/3-540-61511-3_112openalex-snapshot

Lemma discovery in automating induction

inferred← citeshttps://doi.org/10.1007/3-540-61511-3_73openalex-snapshot

Termination of algorithms over non-freely generated data types

inferred← citeshttps://doi.org/10.1007/3-540-61532-6_1openalex-snapshot

A general framework for mechanizing induction using test set

inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_15openalex-snapshot

Predicting Failures of and Repairing Inductive Proof Attempts

inferred← citeshttps://doi.org/10.1007/978-1-4471-3213-4_4openalex-snapshot

The Tecton Proof System

inferred← citeshttps://doi.org/10.1007/978-1-4471-3810-5_16openalex-snapshot

An Experiment using Term Rewriting Techniques for Concurrency

inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_11openalex-snapshot

Automated Theorem Proving for Analysis and Synthesis of Computations

inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_1openalex-snapshot

Theorem Proving in Hierarchical Clausal Specifications

inferred← citeshttps://doi.org/10.1007/978-1-4615-1391-9_8openalex-snapshot

On the Construction of a Domain Language for a Class of Reactive Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_10openalex-snapshot

Superposition with Structural Induction

inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_12openalex-snapshot

History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!

inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_9openalex-snapshot

Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures – Preliminary Report –

inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_3openalex-snapshot

Deciding Inductive Validity of Equations

inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_7openalex-snapshot

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_12openalex-snapshot

The Maude Formal Tool Environment

inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_25openalex-snapshot

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_20openalex-snapshot

Coverset Induction with Partiality and Subsorts: A Powerlist Case Study

inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_20openalex-snapshot

Rewriting Induction + Linear Arithmetic = Decision Procedure

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/bf00244458openalex-snapshot

Induction using term orders

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/bf00881856openalex-snapshot

Implicit induction in conditional theories

inferred← citeshttps://doi.org/10.1007/bf01209624openalex-snapshot

Proving termination of (conditional) rewrite systems

inferred← citeshttps://doi.org/10.1007/bf01530798openalex-snapshot

A recursion planning analysis of inductive completion

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/bf01534452openalex-snapshot

Reasoning with conditional axioms

inferred← citeshttps://doi.org/10.1007/bfb0012889openalex-snapshot

RRL: A rewrite rule laboratory

inferred← citeshttps://doi.org/10.1007/bfb0013182openalex-snapshot

Dynamic term rewriting calculus and its application to inductive equational reasoning

inferred← citeshttps://doi.org/10.1007/bfb0014311openalex-snapshot

Automating induction over mutually recursive functions

inferred← citeshttps://doi.org/10.1007/bfb0028393openalex-snapshot

Rewriting, decision procedures and lemma speculation for automated hardware verification

inferred← citeshttps://doi.org/10.1007/bfb0054264openalex-snapshot

Termination analysis by inductive evaluation

inferred← citeshttps://doi.org/10.1007/bfb0058026openalex-snapshot

Mechanizing verification of arithmetic circuits: SRT division

inferred← citeshttps://doi.org/10.1007/pl00010808openalex-snapshot

Using an induction prover for verifying arithmetic circuits

inferred← citeshttps://doi.org/10.1007/s004500050042openalex-snapshot

Theorembeweisen in hierarchischen bedingten Spezifikationen

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.1007/s11390-005-0496-0openalex-snapshot

Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90192-9openalex-snapshot

An overview of the Tecton proof system

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/0898-1221(94)00218-aopenalex-snapshot

An overview of Rewrite Rule Laboratory (RRL)

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.entcs.2009.03.036openalex-snapshot

Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures

inferred← citeshttps://doi.org/10.1016/j.ins.2003.06.012openalex-snapshot

Appropriate lemmae discovery

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.022openalex-snapshot

Sound generalizations in mathematical induction

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.1023/a:1005903504159openalex-snapshot

Automated Synthesis of Recursive Programs from a ∀∃ Logical Specification

inferred← citeshttps://doi.org/10.1023/a:1006408829523openalex-snapshot

Induction Proofs with Partial Functions

inferred← citeshttps://doi.org/10.1023/a:1008610818519openalex-snapshot

Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory

inferred← citeshttps://doi.org/10.1093/logcom/exad068openalex-snapshot

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions

inferred← citeshttps://doi.org/10.1109/icsmc.2002.1176375openalex-snapshot

Lemmae discovery in inductive proof

inferred← citeshttps://doi.org/10.1109/lics.1997.614920openalex-snapshot

Automata-driven automated induction

inferred← citeshttps://doi.org/10.22028/d291-25997openalex-snapshot

Saturation-based decision procedures for fixed domain and minimal model validity

inferred← citeshttps://doi.org/10.29007/nsx4openalex-snapshot

A Unified View of Induction Reasoning for First-Order Logic

inferred← citeshttps://doi.org/10.48550/arxiv.0811.4720openalex-snapshot

Automated Induction for Complex Data Structures

inferred← citeshttps://doi.org/10.48550/arxiv.1309.6226openalex-snapshot

Automation of Mathematical Induction as part of the History of Logic

inferred← citeshttps://doi.org/10.48556/sif.1024.19.157openalex-snapshot

Récurrence noethérienne pour le raisonnement de premier ordre

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.