On the public citation graph
Equality control methods in machine theorem proving
0 signed · 46 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.
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.
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_17openalex-snapshot
Hyperparamodulation: A refinement of paramodulation
inferredcites →https://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_11openalex-snapshot
Termination of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_20openalex-snapshot
A New Interpretation of the Resolution Principle
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_17openalex-snapshot
E-Resolution: Extension of Resolution to Include the Equality Relation
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-642-99976-5_1openalex-snapshot
An Overview of Mechanical Theorem Proving
inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot
Rewrite methods for clausal and non-clausal theorem proving
inferredcites →https://doi.org/10.1007/bfb0036921openalex-snapshot
Incremental construction of unification algorithms in equational theories
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/0022-0000(81)90002-7openalex-snapshot
A complete proof of correctness of the Knuth-Bendix completion algorithm
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0743-1066(84)90003-7openalex-snapshot
Oriented equational clauses as a programming language
inferredcites →https://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
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.1090/conm/029/07openalex-snapshot
Proof-Checking, Theorem-Proving, and Program Verification
inferredcites →https://doi.org/10.1090/conm/029/749237openalex-snapshot
Automated theorem-proving: a quarter-century review
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/tpami.1981.4767050openalex-snapshot
Deduction Plans: A Basis for Intelligent Backtracking
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
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/1476936.1477034openalex-snapshot
Completeness results for e-resolution
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
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/322077.322078openalex-snapshot
Another Generalization of Resolution
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.1145/800177.810076openalex-snapshot
Automatic deduction and equality
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.2307/2274627openalex-snapshot
S. Yu. Maslov. Theory of deductive systems and its applications. English translation by Michael Gelfond and Vladimir Lifschitz of Téoriá déduktivnyh sistém i éé priménéniá. Foundations of computing. The MIT Press, Cambridge, Mass., and London, 1987, x + 151 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_20openalex-snapshot
Proof-search in intuitionistic logic based on constraint satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_4openalex-snapshot
Equality elimination for the tableau method
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_35openalex-snapshot
Evidence Algorithm and System for Automated Deduction: A Retrospective View
inferred← citeshttps://doi.org/10.1007/bf01130096openalex-snapshot
M-calculus ? a sequent method for automatic theorem proving
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90243-mopenalex-snapshot
Equality and abductive residua for Horn clauses
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.5555/1894483.1894521openalex-snapshot
Evidence algorithm and system for automated deduction: a retrospective view
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.