On the public citation graph
Using hints to increase the effectiveness of an automated reasoning program: Case studies
0 signed · 72 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-0-387-34768-4_15openalex-snapshot
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering that x 3 = x Implies Ring Commutativity
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_15openalex-snapshot
Automated Reasoning and Bledsoe’s Dream for the Field
inferredcites →https://doi.org/10.1007/bf00244283openalex-snapshot
The linked inference principle, I: The formal treatment
inferredcites →https://doi.org/10.1007/bf00244359openalex-snapshot
Robbins algebra: Conditions that make a near-boolean algebra boolean
inferredcites →https://doi.org/10.1007/bf00245821openalex-snapshot
Meeting the challenge of fifty years of logic
inferredcites →https://doi.org/10.1007/bf00247439openalex-snapshot
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1016/0098-3004(76)90046-7openalex-snapshot
Computers and Mathematics with Applications
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
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/c2013-0-10412-6openalex-snapshot
A Computational Logic Handbook
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.764aopenalex-snapshot
ELEMENTS OF MATHEMATICAL LOGIC
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1999.0349openalex-snapshot
Proofs as Schemas and Their Heuristic Use
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_21openalex-snapshot
ENIGMAWatch: ProofWatch Meets ENIGMA
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_29openalex-snapshot
ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_10openalex-snapshot
Towards Finding Longer Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_16openalex-snapshot
Learning Theorem Proving Components
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_10openalex-snapshot
Fast and Slow Enigmas and Parental Guidance
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_35openalex-snapshot
Guiding an Automated Theorem Prover with Neural Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_4openalex-snapshot
Learning Guided Automated Reasoning: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_4openalex-snapshot
Twitch: Learning Abstractions for Equational Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_38openalex-snapshot
OTTER Proofs in Tarskian Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_21openalex-snapshot
Lemmatization for Stronger Reasoning in Large Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_24openalex-snapshot
Internal Guidance for Satallax
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_16openalex-snapshot
ProofWatch: Watchlist Guidance for Large Theories in E
inferred← citeshttps://doi.org/10.1007/978-3-319-96812-4_11openalex-snapshot
Enhancing ENIGMA Given Clause Guidance
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_37openalex-snapshot
MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_20openalex-snapshot
SRASS - A Semantic Relevance Axiom Selection System
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_15openalex-snapshot
Heaps and Data Structures: A Challenge for Automated Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_12openalex-snapshot
Toward a Procedure for Data Mining Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_8openalex-snapshot
Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_34openalex-snapshot
Lemma Mining over HOL Light
inferred← citeshttps://doi.org/10.1007/s10817-006-9029-yopenalex-snapshot
Axiomatizing the Skew Boolean Propositional Calculus
inferred← citeshttps://doi.org/10.1007/s10817-016-9392-2openalex-snapshot
Finding Proofs in Tarskian Geometry
inferred← citeshttps://doi.org/10.1007/s10817-020-09576-7openalex-snapshot
Machine Learning Guidance for Connection Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-022-09617-3openalex-snapshot
A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/s11225-005-8469-4openalex-snapshot
Double-Negation Elimination in Some Propositional Logics
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.032openalex-snapshot
Learning-assisted theorem proving with millions of lemmas
inferred← citeshttps://doi.org/10.1016/s0096-3003(99)00249-0openalex-snapshot
The application of automated reasoning to formal models of combinatorial optimization
inferred← citeshttps://doi.org/10.1023/a:1005847113370openalex-snapshot
Automating the Search for Elegant Proofs
inferred← citeshttps://doi.org/10.1023/a:1010639725972openalex-snapshot
Solving Open Questions and Other Challenge Problems Using Proof Sketches
inferred← citeshttps://doi.org/10.1023/a:1010650624155openalex-snapshot
A Milestone Reached and a Secret Revealed
inferred← citeshttps://doi.org/10.1023/a:1010687609134openalex-snapshot
Distributivity in Łℵ0 and Other Sentential Logics
inferred← citeshttps://doi.org/10.1023/a:1010691726881openalex-snapshot
Conquering the Meredith Single Axiom
inferred← citeshttps://doi.org/10.1023/a:1020537107897openalex-snapshot
Hilbert's Twenty-Fourth Problem
inferred← citeshttps://doi.org/10.1023/a:1020542009983openalex-snapshot
Short Single Axioms for Boolean Algebra
inferred← citeshttps://doi.org/10.1023/a:1021693818601openalex-snapshot
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus
inferred← citeshttps://doi.org/10.1023/a:1027322305654openalex-snapshot
A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke
inferred← citeshttps://doi.org/10.1093/oxfordhb/9780195182057.003.0014openalex-snapshot
Philosophical Issues Arising from Genomics
inferred← citeshttps://doi.org/10.1142/s0218213006002540openalex-snapshot
MILESTONES FOR AUTOMATED REASONING WITH OTTER
inferred← citeshttps://doi.org/10.1142/s0218213006003119openalex-snapshot
SEMANTIC DERIVATION VERIFICATION: TECHNIQUES AND IMPLEMENTATION
inferred← citeshttps://doi.org/10.1145/276609.276624openalex-snapshot
Programs that offer fast, flawless, logical reasoning
inferred← citeshttps://doi.org/10.1305/ndjfl/1074290715openalex-snapshot
Shortest Axiomatizations of Implicational S4 and S5
inferred← citeshttps://doi.org/10.2172/822575openalex-snapshot
Short equational bases for ortholattices : proofs and countermodels.
inferred← citeshttps://doi.org/10.29007/pqh1openalex-snapshot
Experiments with State-of-the-art Automated Provers on Problems in Tarskian Geometry
inferred← citeshttps://doi.org/10.29007/z7qxopenalex-snapshot
ProofWatch Meets ENIGMA: First Experiments
inferred← citeshttps://doi.org/10.3233/aic-150668openalex-snapshot
The 7th IJCAR automated theorem proving system competition – CASC-J7
inferred← citeshttps://doi.org/10.3233/aic-160709openalex-snapshot
The 8th IJCAR automated theorem proving system competition – CASC-J8
inferred← citeshttps://doi.org/10.48456/tr-872openalex-snapshot
The integration of higher order interactive proof with first order automatic theorem proving
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03107openalex-snapshot
Machine Learning Guidance and Proof Certification for Connection Tableaux
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05547openalex-snapshot
Learning Equational Theorem Proving
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0205078openalex-snapshot
A Spectrum of Applications of Automated Reasoning
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.