On the public citation graph
Paramodulation and set of support
0 signed · 57 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/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321296.321302openalex-snapshot
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
inferredcites →https://doi.org/10.1145/321420.321428openalex-snapshot
Automatic Theorem Proving With Renamable and Semantic Resolution
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-10009-1_7openalex-snapshot
Variable elimination and chaining in a resolution-based prover for inequalities
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_86openalex-snapshot
A new method for establishing refutational completeness in theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_87openalex-snapshot
A resolution principle for clauses with constraints
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_93openalex-snapshot
Goal directed strategies for paramodulation
inferred← citeshttps://doi.org/10.1007/3-540-55930-2_22openalex-snapshot
Automatic theorem proving within the portable AI Lab
inferred← citeshttps://doi.org/10.1007/978-3-031-23161-2_300700openalex-snapshot
Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-17773-6_22openalex-snapshot
Robbing the Bank with a Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_26openalex-snapshot
An Interactive Theorem-Proving Program
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_33openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf00243001openalex-snapshot
Solving open problems in right alternative rings with Z-module reasoning
inferred← citeshttps://doi.org/10.1007/bf00243209openalex-snapshot
Some experiments in nonassociative ring theory with an automated theorem prover
inferred← citeshttps://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferred← citeshttps://doi.org/10.1007/bf00244288openalex-snapshot
An overview of automated reasoning and related fields
inferred← citeshttps://doi.org/10.1007/bf00244395openalex-snapshot
The problem of explaining the disparate performance of hyperresolution and paramodulation
inferred← citeshttps://doi.org/10.1007/bf00244514openalex-snapshot
The problem of finding a strategy to control binary paramodulation
inferred← citeshttps://doi.org/10.1007/bf00245463openalex-snapshot
Complexity of unification problems with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/bf00247439openalex-snapshot
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
inferred← citeshttps://doi.org/10.1007/bf00302643openalex-snapshot
Automated proofs of the moufang identities in alternative rings
inferred← citeshttps://doi.org/10.1007/bf00881847openalex-snapshot
The problem of strategy and hyperresolution
inferred← citeshttps://doi.org/10.1007/bf00881890openalex-snapshot
The problem of hyperparamodulation
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bf02090774openalex-snapshot
Unnecessary inferences in associative-commutative completion procedures
inferred← citeshttps://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferred← citeshttps://doi.org/10.1007/bfb0012871openalex-snapshot
Challenge problems from nonassociative rings for theorem provers
inferred← citeshttps://doi.org/10.1007/bfb0022681openalex-snapshot
An introduction to automated deduction
inferred← citeshttps://doi.org/10.1016/0066-4138(73)90001-3openalex-snapshot
Automatic theorem proving based on resolution
inferred← citeshttps://doi.org/10.1016/0167-9287(93)90451-6openalex-snapshot
Portable AI lab for teaching artificial intelligence
inferred← citeshttps://doi.org/10.1016/0898-1221(76)90028-6openalex-snapshot
Complete demodulation for automatic theorem proving
inferred← citeshttps://doi.org/10.1016/b978-0-08-091728-3.50013-8openalex-snapshot
The Equality Relation
inferred← citeshttps://doi.org/10.1016/b978-0-934613-03-3.50019-2openalex-snapshot
APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This…
inferred← citeshttps://doi.org/10.1016/b978-1-55860-932-7.x5083-3openalex-snapshot
Knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1016/c2009-0-27773-7openalex-snapshot
Artificial Intelligence: A New Synthesis
inferred← citeshttps://doi.org/10.1016/j.ins.2006.07.027openalex-snapshot
Filter-based resolution principle for lattice-valued propositional logic LP(X)
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71923-2openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
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.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1109/21.135677openalex-snapshot
Distributed automated reasoning: issues in coordination, cooperation, and performance
inferred← citeshttps://doi.org/10.1109/issre.1991.145367openalex-snapshot
A mechanical verifier for supporting the design of reliable reactive systems
inferred← citeshttps://doi.org/10.1145/186258.186523openalex-snapshot
Applications of feasible path analysis to program testing
inferred← citeshttps://doi.org/10.1145/186258.187150openalex-snapshot
Test data generation and feasible path analysis
inferred← citeshttps://doi.org/10.1145/321623.321636openalex-snapshot
Completeness of Linear Refutation for Theories with Equality
inferred← citeshttps://doi.org/10.1145/321707.321719openalex-snapshot
An Approach for Finding C -Linear Complete Inference Systems
inferred← citeshttps://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferred← citeshttps://doi.org/10.29007/tlw4openalex-snapshot
An Inference Rule for the Acyclicity Property of Term Algebras
inferred← citeshttps://doi.org/10.5555/800129.804214openalex-snapshot
Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
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.