On the public citation graph

First-order theorem proving using conditional rewrite rules

https://doi.org/10.1007/bfb0012820
0 signed · 67 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-15976-2_15openalex-snapshot
Two results in term rewriting theorem proving
inferredcites →https://doi.org/10.1007/3-540-15976-2_2openalex-snapshot
Contextual rewriting
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_86openalex-snapshot
A new method for establishing refutational completeness in theorem proving
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_13openalex-snapshot
Semantic Trees in Automatic Theorem-Proving
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/978-3-662-09691-8_11openalex-snapshot
Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1007/bfb0060637openalex-snapshot
Paramodulation and set of support
inferredcites →https://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferredcites →https://doi.org/10.1016/0304-3975(85)90011-8openalex-snapshot
A superposition oriented theorem prover
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/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(87)80024-xopenalex-snapshot
Rewrite method for theorem proving in first order theory with equality
inferredcites →https://doi.org/10.1137/0212006openalex-snapshot
A Technique for Establishing Completeness Results in Theorem Proving with Equality
inferredcites →https://doi.org/10.1145/1012497.1012521openalex-snapshot
An equational approach to theorem proving in first-order predicate calculus
inferredcites →https://doi.org/10.1145/321662.321678openalex-snapshot
Two Results on Ordering for Resolution with Merging and Linear Format
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories

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.2002.0536openalex-snapshot
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
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-51081-8_97openalex-snapshot
Proof normalization for resolution and paramodulation
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_105openalex-snapshot
On restrictions of ordered paramodulation with simplification
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_132openalex-snapshot
Dissolver: A dissolution-based theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_77openalex-snapshot
Conditional rewriting in focus
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_78openalex-snapshot
A maximal-literal unit strategy for horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_92openalex-snapshot
Completion procedures as semidecision procedures
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-56393-8_18openalex-snapshot
Reduction techniques for first-order reasoning
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_39openalex-snapshot
Associative-commutative deduction with constraints
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_8openalex-snapshot
Handling equality in logic programming via basic folding
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/978-1-4612-3658-0_11openalex-snapshot
Automated Theorem Proving for Analysis and Synthesis of Computations
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_7openalex-snapshot
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
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-3-642-75100-4_11openalex-snapshot
Eqtheopogles A Completion Theorem Prover for PL1EQ
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_12openalex-snapshot
A Resolution Calculus Extended by Equivalence
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf01202035openalex-snapshot
Conditional narrowing modulo a set of equations
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/bfb0012889openalex-snapshot
RRL: A rewrite rule laboratory
inferred← citeshttps://doi.org/10.1007/bfb0013054openalex-snapshot
An ordered theory resolution calculus
inferred← citeshttps://doi.org/10.1007/bfb0054258openalex-snapshot
Strict basic superposition
inferred← citeshttps://doi.org/10.1007/s10817-020-09561-0openalex-snapshot
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
inferred← citeshttps://doi.org/10.1007/s11424-019-8377-8openalex-snapshot
Conditional Congruence Closure over Uninterpreted and Interpreted Symbols
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00187-nopenalex-snapshot
Towards a foundation of completion procedures as semidecision procedures
inferred← citeshttps://doi.org/10.1016/0743-1066(90)90034-3openalex-snapshot
Inference rules and proof procedures for inequations
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/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/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80002-7openalex-snapshot
Deductive and inductive synthesis of equational programs
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80130-7openalex-snapshot
Using forcing to prove completeness of resolution and paramodulation
inferred← citeshttps://doi.org/10.1023/a:1015707001763openalex-snapshot
A General Setting for Flexibly Combining and Augmenting Decision Procedures
inferred← citeshttps://doi.org/10.1109/hicss.1994.323323openalex-snapshot
A methodology for equational reasoning
inferred← citeshttps://doi.org/10.1109/lics.1994.316051openalex-snapshot
Rewrite techniques for transitive relations
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1991.tb00332.xopenalex-snapshot
Denkprothesen: on programs that reason
inferred← citeshttps://doi.org/10.1145/174130.174135openalex-snapshot
Dissolution
inferred← citeshttps://doi.org/10.1145/96877.96894openalex-snapshot
Reexamining intractability of tableau methods
inferred← citeshttps://doi.org/10.1145/99569.99828openalex-snapshot
Formal methods in transformational derivation of programs
inferred← citeshttps://doi.org/10.22028/d291-25891openalex-snapshot
A mechanization of sorted higher-order logic based on the resolution principle
inferred← citeshttps://doi.org/10.29007/pn71openalex-snapshot
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover
inferred← citeshttps://doi.org/10.3233/fi-1995-24125openalex-snapshot
CONTEXTUAL REWRITING IN AUTOMATED REASONING
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.