On the public citation graph

Procedure implementation through demodulation and related tricks

https://doi.org/10.1007/bfb0000054
0 signed · 37 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_19openalex-snapshot
Data structures and control architecture for implementation of theorem-proving programs
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_26openalex-snapshot
An Interactive Theorem-Proving Program
inferredcites →https://doi.org/10.1007/bf00967188openalex-snapshot
Mathematics of computation
inferredcites →https://doi.org/10.1016/0141-9331(81)90593-7openalex-snapshot
National Computer Conference
inferredcites →https://doi.org/10.1016/0898-1221(75)90019-xopenalex-snapshot
An implementation of hyper-resolution
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1016/s0019-9958(74)80007-0openalex-snapshot
Machine Intelligence. Vol. 7.
inferredcites →https://doi.org/10.1080/00401706.1965.10490241openalex-snapshot
International Journal of Computer Mathematics
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0628714-5openalex-snapshot
Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I
inferredcites →https://doi.org/10.1109/tc.1976.1674696openalex-snapshot
Problems and Experiments for and with Automated Theorem-Proving Programs
inferredcites →https://doi.org/10.1142/9789812813411_0017openalex-snapshot
AUTOMATED GENERATION OF MODELS AND COUNTEREXAMPLES AND ITS APPLICATION TO OPEN QUESTIONS IN TERNARY BOOLEAN ALGEBRA
inferredcites →https://doi.org/10.1142/9789812813411_0025openalex-snapshot
Questions Concerning Possible Shortest Single Axioms for the Equivalential Calculus: An Application of Automated Theorem Proving to Infinite Domains
inferredcites →https://doi.org/10.1145/1464052.1464109openalex-snapshot
The unit preference strategy in theorem proving
inferredcites →https://doi.org/10.1145/1500412.1500517openalex-snapshot
An automated reasoning system
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.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferredcites →https://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
inferredcites →https://doi.org/10.1305/ndjfl/1093887534openalex-snapshot
Shortest single axioms for the classical equivalential calculus.
inferredcites →https://doi.org/10.1305/ndjfl/1093888213openalex-snapshot
An automatic theorem prover for substitution and detachment systems.
inferredcites →https://doi.org/10.1305/ndjfl/1093888216openalex-snapshot
A shortest single axiom for the classical equivalential calculus.
inferredcites →https://doi.org/10.2172/6898399openalex-snapshot
Canonicalization and demodulation
inferredcites →https://doi.org/10.2307/2184212openalex-snapshot
Polish Logic 1920-1939.
inferredcites →https://doi.org/10.2307/2272384openalex-snapshot
J. A. Robinson. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 (1965), pp. 227–234.
inferredcites →https://doi.org/10.5555/800129.804214openalex-snapshot
Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_2openalex-snapshot
A Portable Environment for Research in Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_3openalex-snapshot
An Introduction to Automated Deduction
inferred← citeshttps://doi.org/10.1007/bf00244359openalex-snapshot
Robbins algebra: Conditions that make a near-boolean algebra boolean
inferred← citeshttps://doi.org/10.1007/bf00246021openalex-snapshot
Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem
inferred← citeshttps://doi.org/10.1007/bf00263451openalex-snapshot
Automated deduction in von Neumann-Bernays-G�del set theory
inferred← citeshttps://doi.org/10.1007/bfb0022681openalex-snapshot
An introduction to automated deduction
inferred← citeshttps://doi.org/10.1016/0004-3702(84)90054-7openalex-snapshot
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot
Automated theorem proving and logic programming: a natural symbiosis
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.1142/9789812813411_0026openalex-snapshot
AUTOMATED REASONING: REAL USES AND POTENTIAL USES
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
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.