On the public citation graph

Rewrite methods for clausal and non-clausal theorem proving

https://doi.org/10.1007/bfb0036919
0 signed · 95 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/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/bfb0000058openalex-snapshot
Comparison of natural deduction and locking resolution implementations
inferredcites →https://doi.org/10.1016/c2013-0-02156-1openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.1080/00029890.1980.11995092openalex-snapshot
Computer-Implemented Set Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501865-8openalex-snapshot
The theory of representations for Boolean algebras
inferredcites →https://doi.org/10.1109/sfcs.1980.37openalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1145/355611.362538openalex-snapshot
Experiment with an automatic theorem-prover having partial ordering inference rules
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.21236/ada087641openalex-snapshot
A Catalogue of Canonical Term Rewriting Systems.
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra

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.1999.0262openalex-snapshot
A Categorical Critical-pair Completion Algorithm
inferred← citeshttps://doi.org/10.1007/11780274_31openalex-snapshot
Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method
inferred← citeshttps://doi.org/10.1007/11901433_7openalex-snapshot
Induction-Guided Falsification
inferred← citeshttps://doi.org/10.1007/11916277_33openalex-snapshot
Boolean Rings for Intersection-Based Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_16openalex-snapshot
Confluent and coherent equational term rewriting systems application to proofs in abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_15openalex-snapshot
Oriented equational clauses as a programming language
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_15openalex-snapshot
Two results in term rewriting theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_18openalex-snapshot
Combining unification algorithms for confined regular equational theories
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_292openalex-snapshot
On solving the equality problem in theories defined by Horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_7openalex-snapshot
PROLOG-based inductive theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_80openalex-snapshot
Relating resolution and algebraic completion for Horn logic
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_81openalex-snapshot
A simple non-termination test for the Knuth-Bendix method
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_57openalex-snapshot
Reasoning in systems of equations and inequations
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_95openalex-snapshot
Semi-unification
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_105openalex-snapshot
An overview of LP, the Larch Prover
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_154openalex-snapshot
Design and development of ENprover, an automated theorem proving system based on EN-strategy
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-56868-9_3openalex-snapshot
Bi-rewriting, a term rewriting technique for monotonic order relations
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_31openalex-snapshot
A complete transformational toolkit for compilers
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_20openalex-snapshot
A New Interpretation of the Resolution Principle
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_3openalex-snapshot
A Natural Proof System Based on Rewriting Techniques
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-4612-3658-0_2openalex-snapshot
Formal Verification of the Sobel Image Processing Chip
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_13openalex-snapshot
Formal Analysis of the Bakery Protocol with Consideration of Nonatomic Reads and Writes
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-71145-9_13openalex-snapshot
Ein Beweisverfahren für Datenbankprädikate
inferred← citeshttps://doi.org/10.1007/978-3-642-73005-4_26openalex-snapshot
Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-88719-2_8openalex-snapshot
Prolog-Arbeiten in Karlsruhe
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00297246openalex-snapshot
Unification in Boolean rings
inferred← citeshttps://doi.org/10.1007/bf00297251openalex-snapshot
Opening the AC-unification race
inferred← citeshttps://doi.org/10.1007/bf01069968openalex-snapshot
Equality control methods in machine theorem proving
inferred← citeshttps://doi.org/10.1007/bf01806313openalex-snapshot
Integrating logic and functional programming
inferred← citeshttps://doi.org/10.1007/bfb0012831openalex-snapshot
A mechanizable induction principle for equational specifications
inferred← citeshttps://doi.org/10.1007/bfb0014985openalex-snapshot
Retractions: A functional paradigm for logic programming
inferred← citeshttps://doi.org/10.1007/bfb0026103openalex-snapshot
Equational completion in order-sorted algebras extended abstract
inferred← citeshttps://doi.org/10.1016/0004-3702(87)90017-8openalex-snapshot
Proof by consistency
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90114-3openalex-snapshot
On solving the equality problem in theories defined by Horn clauses
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90007-8openalex-snapshot
Schematization of infinite sets of rewrite rules generated by divergent completion processes
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90034-fopenalex-snapshot
Equational completion in order-sorted algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90189-9openalex-snapshot
Semi-unification
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(84)90003-7openalex-snapshot
Oriented equational clauses as a programming language
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
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-12-046371-8.50008-0openalex-snapshot
Completion and Its Applications
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/50011-4openalex-snapshot
Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.018openalex-snapshot
Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method
inferred← citeshttps://doi.org/10.1016/j.scico.2006.10.011openalex-snapshot
Modeling and verification of real-time systems based on equations
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80003-6openalex-snapshot
Computing with rewrite systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80005-xopenalex-snapshot
Semantic confluence tests and completion methods
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)80043-0openalex-snapshot
Multi-valued logic and Gröner bases with applications to modal logic
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80089-2openalex-snapshot
Discriminator varieties and symbolic computation
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80026-2openalex-snapshot
Equational methods in first order predicate calculus
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80024-xopenalex-snapshot
Rewrite method for theorem proving in first order theory with equality
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80025-1openalex-snapshot
Unification in combinations of collapse-free regular theories
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80054-9openalex-snapshot
Unification in Boolean Rings and Abelian Groups
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.12.2804openalex-snapshot
Proof Score Approach to Verification of Liveness Properties
inferred← citeshttps://doi.org/10.1093/logcom/2.3.247openalex-snapshot
Modal Theorem Proving: An Equational Viewpoint
inferred← citeshttps://doi.org/10.1108/17427370580000119openalex-snapshot
Mechanically supporting case analysis for verification of distributed systems
inferred← citeshttps://doi.org/10.1109/dac.1988.14760openalex-snapshot
Formal verification of the Sobel image processing chip
inferred← citeshttps://doi.org/10.1109/icdcs.2005.32openalex-snapshot
Equational Approach to Formal Analysis of TLS
inferred← citeshttps://doi.org/10.1109/lics.1988.5110openalex-snapshot
Unification in free extensions of Boolean rings and Abelian groups
inferred← citeshttps://doi.org/10.1109/lra.2023.3263368openalex-snapshot
Learning Linear Temporal Properties for Autonomous Robotic Systems
inferred← citeshttps://doi.org/10.1109/qsic.2004.1357944openalex-snapshot
Equational approach to formal verification of SET
inferred← citeshttps://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferred← citeshttps://doi.org/10.1137/0220049openalex-snapshot
Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
inferred← citeshttps://doi.org/10.1142/s0218194010004712openalex-snapshot
PROOF SCORE APPROACH TO ANALYSIS OF ELECTRONIC COMMERCE PROTOCOLS
inferred← citeshttps://doi.org/10.1145/1012497.1012521openalex-snapshot
An equational approach to theorem proving in first-order predicate calculus
inferred← citeshttps://doi.org/10.1145/174130.174137openalex-snapshot
Z-module reasoning
inferred← citeshttps://doi.org/10.1145/174652.174655openalex-snapshot
Equational inference, canonical proofs, and proof orderings
inferred← citeshttps://doi.org/10.1145/265943.265944openalex-snapshot
Toward a complete transformational toolkit for compilers
inferred← citeshttps://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
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.