On the public citation graph
Solving open questions with an automated theorem-proving program
0 signed · 36 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_26openalex-snapshot
An Interactive Theorem-Proving Program
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/t-c.1974.223997openalex-snapshot
An Algebraic Model for the Analysis of Logical Circuits
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/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.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/3-540-16780-3_101openalex-snapshot
Parallel theorem proving with connection graphs
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_138openalex-snapshot
Liss — The logic inference search system
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_4openalex-snapshot
EKL—A Mathematically Oriented Proof Checker
inferred← citeshttps://doi.org/10.1007/978-1-4471-0119-2_20openalex-snapshot
Logical Approach in Knowledge-Based Control
inferred← citeshttps://doi.org/10.1007/978-3-662-72526-9_3openalex-snapshot
Risiken durch generative KI
inferred← citeshttps://doi.org/10.1007/bf00244288openalex-snapshot
An overview of automated reasoning and related fields
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/bf02283736openalex-snapshot
A view of automated proof checking and proving
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/s0747-7171(10)80014-8openalex-snapshot
A method for simultaneous search for refutations and models by equational constraint solving
inferred← citeshttps://doi.org/10.1086/661623openalex-snapshot
AfterMath: The Work of Proof in the Age of Human–Machine Collaboration
inferred← citeshttps://doi.org/10.1109/85.397057openalex-snapshot
The automation of proof: a historical and sociological exploration
inferred← citeshttps://doi.org/10.1109/secon.1992.202419openalex-snapshot
Multi level combinational circuits and hazard detection
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.