On the public citation graph

The problem of automated theorem finding

https://doi.org/10.1007/bf00881868
0 signed · 33 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/bf00247824openalex-snapshot
Automated discovery of new axiomatizations of the left group and right group calculi
inferredcites →https://doi.org/10.1007/bf00881862openalex-snapshot
Single axioms for groups and Abelian groups with various operations
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 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/978-0-387-34979-4_56openalex-snapshot
EnCal: An Automated Forward Deduction System for General-Purpose Entailment Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-15702-3_57openalex-snapshot
Explicitly Epistemic Contraction by Predicate Abstraction in Automated Theorem Finding: A Case Study in NBG Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-23862-3_50openalex-snapshot
A Set of Metrics for Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in NBG Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-54430-4_12openalex-snapshot
Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in Peano’s Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-54430-4_13openalex-snapshot
A Predicate Suggestion Algorithm for Automated Theorem Finding with Forward Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-74827-4_106openalex-snapshot
A Cooperative Grid Computing Approach to Automated Theorem Finding and Automated Problem Proposing
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_62openalex-snapshot
Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-55038-6_16openalex-snapshot
Research on Automated Theorem Finding: Current State and Future Directions
inferred← citeshttps://doi.org/10.1007/978-3-662-47487-7_4openalex-snapshot
Automated Theorem Finding by Forward Reasoning Based on Strong Relevant Logic: A Case Study in Graph Theory
inferred← citeshttps://doi.org/10.1007/978-981-10-1536-6_8openalex-snapshot
Automated Theorem Finding by Forward Reasoning Based on Strong Relevant Logic: A Case Study in Tarski’s Geometry
inferred← citeshttps://doi.org/10.1007/bfb0024232openalex-snapshot
Improving the performance of automated forward deduction system EnCal
inferred← citeshttps://doi.org/10.1007/s10472-025-09983-9openalex-snapshot
Automated analysis of the difficulty of secondary school geometry theorems
inferred← citeshttps://doi.org/10.1007/s10472-025-09988-4openalex-snapshot
Heuristic strategies for geometry theorem extension based on complex number identity*
inferred← citeshttps://doi.org/10.1007/s10472-026-10020-6openalex-snapshot
Towards a structural analysis of interesting geometric theorems: analysis of a survey
inferred← citeshttps://doi.org/10.1007/s11390-026-6040-0openalex-snapshot
Automated Conjecturing and Theorem Finding: A Survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.028openalex-snapshot
A systematic methodology for automated theorem finding
inferred← citeshttps://doi.org/10.1109/ares.2006.91openalex-snapshot
Persistent computing systems as continuously available, reliable, and secure systems
inferred← citeshttps://doi.org/10.1109/icci-cc.2015.7259365openalex-snapshot
An epistemic programming approach for automated theorem finding
inferred← citeshttps://doi.org/10.1109/icci-cc.2015.7259383openalex-snapshot
Automated Knowledge Appreciation: A relevant reasoning approach to expand our knowledge and increase its value automatically
inferred← citeshttps://doi.org/10.1109/icei.2019.00069openalex-snapshot
Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning Based on Strong Relevant Logic
inferred← citeshttps://doi.org/10.1109/icmlc.2008.4620421openalex-snapshot
Notice of Retraction: Representing, managing, and reasoning about mathematical knowledge based on strong relevant logic
inferred← citeshttps://doi.org/10.1109/icmlc.2012.6359659openalex-snapshot
Automated theorem finding by forward deduction based on strong relevant logic: A case study in NBG set theory
inferred← citeshttps://doi.org/10.1109/icpads.2005.110openalex-snapshot
Comparing Persistent Computing with Autonomic Computing
inferred← citeshttps://doi.org/10.1109/skg.2006.104openalex-snapshot
The Theory Grid and Grid Theorists
inferred← citeshttps://doi.org/10.1109/skg.2007.178openalex-snapshot
A Semilattice Model for the Theory Grid
inferred← citeshttps://doi.org/10.1109/skg.2013.36openalex-snapshot
Automated Theorem Finding by Forward Deduction Based on the Semi-lattice Model of Formal Theory: A Case Study in NBG Set Theory
inferred← citeshttps://doi.org/10.1109/smartworld.2018.00064openalex-snapshot
Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in Tarski's Geometry
inferred← citeshttps://doi.org/10.4204/eptcs.352.15openalex-snapshot
New and Interesting Theorems
inferred← citeshttps://doi.org/10.4204/eptcs.398.12openalex-snapshot
Considerations on Approaches and Metrics in Automated Theorem Generation/Finding in Geometry
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.