On the public citation graph
Seventy-five problems for testing automatic theorem provers
0 signed · 173 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-81952-0_4openalex-snapshot
Empirical Explorations with the Logic Theory Machine: A Case Study in Heuristics
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/bf00246025openalex-snapshot
Schubert's Steamroller problem: Formulations and solutions
inferredcites →https://doi.org/10.1016/0004-3702(72)90041-0openalex-snapshot
Computer proofs of limit theorems
inferredcites →https://doi.org/10.1016/0004-3702(73)90006-4openalex-snapshot
Breadth-first search: Some surprising results
inferredcites →https://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
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.1137/0206031openalex-snapshot
On Resolution with Clauses of Bounded Size
inferredcites →https://doi.org/10.1145/1455567.1455605openalex-snapshot
Empirical explorations of the logic theory machine
inferredcites →https://doi.org/10.2307/2183653openalex-snapshot
Logic: Techniques of Formal Reasoning.
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.7939/r32805d0popenalex-snapshot
Six Problems in Translational Equivalence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.4430780910openalex-snapshot
A procedure for satiosfiability problems based on the partial instantiation technique
inferred← citeshttps://doi.org/10.1002/ecjc.4430790411openalex-snapshot
Theorem proving based on the partial instantiation technique
inferred← citeshttps://doi.org/10.1002/int.4550100504openalex-snapshot
A multicontext architecture for formalizing complex reasoning
inferred← citeshttps://doi.org/10.1007/11541868_5openalex-snapshot
A Structured Set of Higher-Order Problems
inferred← citeshttps://doi.org/10.1007/3-540-36187-1_8openalex-snapshot
Semantic Selection for Resolution in Clause Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_3openalex-snapshot
Proof Terms for Simply Typed Higher Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-46148-5_25openalex-snapshot
Towards Semantic Goal-Directed Forward Reasoning in Resolution
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_27openalex-snapshot
A Time Efficient KE Based Theorem Prover
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_93openalex-snapshot
A resolution rule for well-formed formulae
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_154openalex-snapshot
Design and development of ENprover, an automated theorem proving system based on EN-strategy
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_155openalex-snapshot
Towards a logic language: An object-oriented implementation of the connection method
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_108openalex-snapshot
Automatic acquisition of search guiding heuristics
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_114openalex-snapshot
Minimizing the number of clauses by renaming
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_135openalex-snapshot
Expert thinker: An adaptation of F-Prolog to microcomputers
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_137openalex-snapshot
A general clause theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_118openalex-snapshot
Emmy: A refutational theorem prover for first-order logic with equations
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_35openalex-snapshot
Automating most parts of hardware proofs in HOL
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_185openalex-snapshot
Basic paramodulation and superposition
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_200openalex-snapshot
A natural deduction automated theorem proving system
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_215openalex-snapshot
KPROP — An AND-parallel theorem prover for propositional logic implemented in KL1 system abstract
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_219openalex-snapshot
The tableau-based theorem prover 3 T A P for multiple-valued logics
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_1openalex-snapshot
SLWV — A theorem prover for logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_4openalex-snapshot
Compiling proof search in semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-57292-9_36openalex-snapshot
Proving formulas through reduction to decidable classes
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_14openalex-snapshot
Semantically guided first-order theorem proving using hyper-linking
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_36openalex-snapshot
Proving with BDDs and control of information
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_62openalex-snapshot
LeanT A P: Lean tableau-based theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_12openalex-snapshot
An implementation technique for a class of bottom-up procedures
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_37openalex-snapshot
First-order automation for higher-order-logic theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_45openalex-snapshot
MacKE: Yet another proof assistant & automated pedagogic tool
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_7openalex-snapshot
Incremental theory reasoning methods for semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_75openalex-snapshot
SPASS & FLOTTER version 0.42
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_15openalex-snapshot
Deciding intuitionistic propositional logic via translation into classical logic
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_26openalex-snapshot
A New Method for Testing Decision Procedures in Modal and Terminological Logics.
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_6openalex-snapshot
Isabelle’s Metalogic: Formalization and Proof Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-86855-0_6openalex-snapshot
Methods for Finding Consequences with Specified Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-97004-8_2openalex-snapshot
Analysis of Relationships Between Problems of Finding “Interesting” Consequences and Constraints Satisfaction for SEMS Knowledge Bases in the Framework of N-tuple Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-22938-1_1openalex-snapshot
Semantic Modeling of Predicate Calculus Based on N-Tuple Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_3openalex-snapshot
Stepping Stones in the TPTP World
inferred← citeshttps://doi.org/10.1007/978-3-031-71379-8_2openalex-snapshot
Introducing GitHub Classroom into a Formal Methods Module
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_1openalex-snapshot
History and Prospects for First-Order Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-92970-5_2openalex-snapshot
From Software Specifications to Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_26openalex-snapshot
α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-46752-3_13openalex-snapshot
A Generalized Factorization Rule Based on the Introduction of Skolem Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_25openalex-snapshot
Tool Support for Logics of Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-73005-4_24openalex-snapshot
A Hyperresolution-based Proof Procedure and Its Implementation in Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-73005-4_26openalex-snapshot
Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_12openalex-snapshot
A Resolution Calculus Extended by Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-7091-6531-7_14openalex-snapshot
Automated deduction by connection method in an object-oriented environment
inferred← citeshttps://doi.org/10.1007/978-3-7091-9394-5_7openalex-snapshot
Methods of Functional Extension
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_10openalex-snapshot
Implementing Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/bf00244357openalex-snapshot
Interest driven suppositional reasoning
inferred← citeshttps://doi.org/10.1007/bf00247825openalex-snapshot
Eliminating duplication with the hyper-linking strategy
inferred← citeshttps://doi.org/10.1007/bf00247827openalex-snapshot
How to avoid the derivation of redundant clauses in reasoning systems
inferred← citeshttps://doi.org/10.1007/bf00880011openalex-snapshot
Formal reasoning in intelligent database systems
inferred← citeshttps://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferred← citeshttps://doi.org/10.1007/bf00881919openalex-snapshot
A note on assumptions about Skolem functions
inferred← citeshttps://doi.org/10.1007/bf00885766openalex-snapshot
Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
inferred← citeshttps://doi.org/10.1007/bf01383880openalex-snapshot
Structuring and automating hardware proofs in a higher-order theorem-proving environment
inferred← citeshttps://doi.org/10.1007/bf01384237openalex-snapshot
Accelerating tableaux proofs using compact representations
inferred← citeshttps://doi.org/10.1007/bf01530763openalex-snapshot
Avoiding duplicate proofs with the foothold refinement
inferred← citeshttps://doi.org/10.1007/bf01530803openalex-snapshot
Embedding complex decision procedures inside an interactive theorem prover
inferred← citeshttps://doi.org/10.1007/bf01531026openalex-snapshot
The relative complexity of resolution and cut-free Gentzen systems
inferred← citeshttps://doi.org/10.1007/bf02127748openalex-snapshot
Using tactics to reformulate formulae for resolution theorem proving
inferred← citeshttps://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferred← citeshttps://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferred← citeshttps://doi.org/10.1007/bfb0012864openalex-snapshot
An implementation of a dissolution-based system employing theory links
inferred← citeshttps://doi.org/10.1007/bfb0013087openalex-snapshot
SPIKE, an automatic theorem prover
inferred← citeshttps://doi.org/10.1007/bfb0013183openalex-snapshot
Distributed deduction by Clause-Diffusion: the aquarius prover
inferred← citeshttps://doi.org/10.1007/bfb0020872openalex-snapshot
Intelligent CAI course in the first-order logic
inferred← citeshttps://doi.org/10.1007/bfb0021973openalex-snapshot
TAS-D++: Syntactic trees transformations for Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/bfb0054246openalex-snapshot
System description: CardTAP: The first theorem prover on a smart card
inferred← citeshttps://doi.org/10.1007/bfb0054274openalex-snapshot
On generating small clause normal forms
inferred← citeshttps://doi.org/10.1007/bfb0095056openalex-snapshot
cardT A P: Automated deduction on a smart card
inferred← citeshttps://doi.org/10.1007/s10817-009-9143-8openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferred← citeshttps://doi.org/10.1007/s10817-017-9407-7openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferred← citeshttps://doi.org/10.1007/s10817-019-09513-3openalex-snapshot
A Prover Dealing with Nominals, Binders, Transitivity and Relation Hierarchies
inferred← citeshttps://doi.org/10.1007/s10817-022-09648-wopenalex-snapshot
A Formalization and Proof Checker for Isabelle’s Metalogic
inferred← citeshttps://doi.org/10.1007/s13218-019-00599-wopenalex-snapshot
Why Machines Don’t (yet) Reason Like People
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90192-5openalex-snapshot
A resolution rule for well-formed formulae
inferred← citeshttps://doi.org/10.1016/0743-1066(96)00054-4openalex-snapshot
Logic programming as a basis for lean automated deduction
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90009-sopenalex-snapshot
An optimality result for clause form translation
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50009-7openalex-snapshot
Efficient Representation and Computation of Tableaux Proofs
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.032openalex-snapshot
Incremental variable splitting
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00032-0openalex-snapshot
The value of the four values
inferred← citeshttps://doi.org/10.1016/s0167-9236(98)00044-xopenalex-snapshot
A reduction method for theorem proving based on the partial-instantiation technique
inferred← citeshttps://doi.org/10.1016/s0306-4379(02)00010-8openalex-snapshot
Satisfiability of object-oriented database constraints with set and bag attributes
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00037-3openalex-snapshot
leanCoP: lean connection-based theorem proving
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.1016/s1567-8326(03)00039-0openalex-snapshot
Binary decision diagrams for first-order predicate logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1017/cbo9780511816772.010openalex-snapshot
Computational Modeling of Various Cognitive Functionalities and Domains
inferred← citeshttps://doi.org/10.1017/cbo9780511816772.016openalex-snapshot
Mental Logic, Mental Models, and Simulations of Human Deductive Reasoning
inferred← citeshttps://doi.org/10.1023/a:1005035316026openalex-snapshot
Automated Natural Deduction in Thinker
inferred← citeshttps://doi.org/10.1023/a:1005749401809openalex-snapshot
Unification Algorithms for Eliminating and Introducing Quantifiers in Natural Deduction Automated Theorem Proving
inferred← citeshttps://doi.org/10.1023/a:1005764705033openalex-snapshot
An Erratum for Some Errata to ATP Problems
inferred← citeshttps://doi.org/10.1023/a:1006249507577openalex-snapshot
A Benchmark Method for the Propositional Modal Logics K, KT, S4
inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot
Parallelization of a Hyper-Linking–Based Theorem Prover
inferred← citeshttps://doi.org/10.1080/02698599308573459openalex-snapshot
Pollock on token physicalism, agent materialism and strong artificial intelligence
inferred← citeshttps://doi.org/10.1080/03057920412331272207openalex-snapshot
Exploiting parallelism: highly competitive semantic tree theorem prover
inferred← citeshttps://doi.org/10.1080/09528138908953702openalex-snapshot
OSCAR: a general theory of rationality
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510841openalex-snapshot
Increasing the efficiency of automated theorem proving
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.293openalex-snapshot
An analysis of empirical testing for modal decision procedures
inferred← citeshttps://doi.org/10.1093/oso/9780198537618.003.0004openalex-snapshot
Designing a Theorem Prover
inferred← citeshttps://doi.org/10.1109/aihas.1992.636897openalex-snapshot
Inclusive Resolution for Horn Sets
inferred← citeshttps://doi.org/10.1109/dexa.2002.1045903openalex-snapshot
English as a formal specification language
inferred← citeshttps://doi.org/10.1109/hicss.1994.323323openalex-snapshot
A methodology for equational reasoning
inferred← citeshttps://doi.org/10.1109/hol.1991.596284openalex-snapshot
Integrating A First-order Automatic prover In The HOL Environment
inferred← citeshttps://doi.org/10.1109/icci.1993.315359openalex-snapshot
Improving efficiency of a theorem prover by eliminating redundant unifications using network structures
inferred← citeshttps://doi.org/10.1109/icpads.1996.517599openalex-snapshot
On parallelism of hyper-linking theorem proving: a preliminary report
inferred← citeshttps://doi.org/10.1109/iisa62523.2024.10786718openalex-snapshot
Model Checking with Large Language Models - Initial Experiments and Future Directions
inferred← citeshttps://doi.org/10.1109/iscas.2004.1329500openalex-snapshot
A new generation of ISCAS benchmarks from formal verification of high-level microprocessors
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508369openalex-snapshot
DT-an automated theorem prover for multiple-valued first-order predicate logics
inferred← citeshttps://doi.org/10.1145/143559.150707openalex-snapshot
Proving functionally difficult problems through model generation
inferred← citeshttps://doi.org/10.1145/3756681.3757028openalex-snapshot
Re-evaluation of Logical Specification in Behavioural Verification
inferred← citeshttps://doi.org/10.11606/t.45.2007.tde-04052007-175943openalex-snapshot
"Um provador de teoremas multi-estratégia"
inferred← citeshttps://doi.org/10.1184/r1/6490895openalex-snapshot
An Experimental Comparison of Alternative Proof Construction Environments
inferred← citeshttps://doi.org/10.1184/r1/6492647openalex-snapshot
Searching for proofs (in sentential logic)
inferred← citeshttps://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferred← citeshttps://doi.org/10.18287/2223-9537-2023-13-2-160-174openalex-snapshot
Methods to compute interesting consequences
inferred← citeshttps://doi.org/10.22028/d291-40264openalex-snapshot
Proof Transformation with Built-in Equality Predicate
inferred← citeshttps://doi.org/10.2307/2214201openalex-snapshot
Philosophy and Artificial Intelligence
inferred← citeshttps://doi.org/10.2307/421015openalex-snapshot
1996 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.25560/24586openalex-snapshot
An artificial intelligence framework for investigative reasoning
inferred← citeshttps://doi.org/10.29007/dzfzopenalex-snapshot
New Techniques in Clausal Form Generation
inferred← citeshttps://doi.org/10.29007/jcqnopenalex-snapshot
Using the TPTP Language for Representing Derivations in Tableau and Connection Calculi
inferred← citeshttps://doi.org/10.29007/mkdwopenalex-snapshot
Problem Libraries for Non-Classical Logics
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0073openalex-snapshot
A Generic Tableau Prover and its Integration with Isabelle
inferred← citeshttps://doi.org/10.3233/aic-180764openalex-snapshot
Programming and verifying a declarative first-order prover in Isabelle/HOL
inferred← citeshttps://doi.org/10.3233/fi-1994-2134openalex-snapshot
MODEL FINDING IN SEMANTICALLY GUIDED INSTANCE-BASED THEOREM PROVING
inferred← citeshttps://doi.org/10.3390/electronics14020401openalex-snapshot
Model Checking Using Large Language Models—Evaluation and Future Directions
inferred← citeshttps://doi.org/10.37614/2949-1215.2023.14.7.003openalex-snapshot
Logical analysis of data and knowledge without using an axiomatic approach
inferred← citeshttps://doi.org/10.48456/tr-133openalex-snapshot
A preliminary users manual for Isabelle
inferred← citeshttps://doi.org/10.48456/tr-271openalex-snapshot
Set theory as a computational logic: I. from foundations to functions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9711106openalex-snapshot
Generic Automatic Proof Tools
inferred← citeshttps://doi.org/10.82444/warw.33641650openalex-snapshot
Analytic proof systems for classical and modal logics of restricted quantification
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.