On the public citation graph

SETHEO: A high-performance theorem prover

https://doi.org/10.1007/bf00244282
0 signed · 224 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-52885-7_78openalex-snapshot
Partheo: A high-performance parallel theorem prover
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bf00244489openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method
inferredcites →https://doi.org/10.1007/bf00246025openalex-snapshot
Schubert's Steamroller problem: Formulations and solutions
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/bf03037324openalex-snapshot
The occur-check problem in Prolog
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1016/s0747-7171(85)80034-1openalex-snapshot
Automated Inferencing
inferredcites →https://doi.org/10.1017/s0269888900004641openalex-snapshot
Automated theorem proving (second revised edition) by Wolfgang Bibel, Vieweg1987.
inferredcites →https://doi.org/10.1109/mex.1987.4307074openalex-snapshot
The Art of Prolog
inferredcites →https://doi.org/10.1109/tc.1976.1674697openalex-snapshot
Resolution, Refinements, and Search Strategies: A Comparative Study
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321796.321807openalex-snapshot
An Implementation of the Model Elimination Proof Procedure
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.
inferredcites →https://doi.org/10.5555/96346.96352openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nadc.19970450517openalex-snapshot
Über die Computerchemie
inferred← citeshttps://doi.org/10.1006/inco.1998.2739openalex-snapshot
On the Modelling of Search in Theorem Proving— Towards a Theory of Strategy Analysis
inferred← citeshttps://doi.org/10.1006/inco.2000.2913openalex-snapshot
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
inferred← citeshttps://doi.org/10.1006/jsco.1999.0363openalex-snapshot
Controlled Use of Clausal Lemmas in Connection Tableau Calculi
inferred← citeshttps://doi.org/10.1007/10721959_32openalex-snapshot
System Description: PTTP+GLiDeS Semantically Guided PTTP
inferred← citeshttps://doi.org/10.1007/10722086_31openalex-snapshot
A Tableau-Like Representation Framework for Efficient Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/11554554_17openalex-snapshot
The Space Efficiency of OSHL
inferred← citeshttps://doi.org/10.1007/11554554_19openalex-snapshot
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
inferred← citeshttps://doi.org/10.1007/11814771_10openalex-snapshot
Connection Tableaux with Lazy Paramodulation
inferred← citeshttps://doi.org/10.1007/11829263_2openalex-snapshot
Research Perspectives for Logic and Deduction
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_10openalex-snapshot
Directed Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_10openalex-snapshot
Exploiting Conditional Equivalences in Connection Calculi
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_25openalex-snapshot
Synthesizing Certified Code
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_24openalex-snapshot
DCTP 1.2 — System Abstract
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_30openalex-snapshot
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_55openalex-snapshot
lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical 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-48317-9_3openalex-snapshot
A Taxonomy of Theorem-Proving Strategies
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_30openalex-snapshot
A Confluent Connection Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_45openalex-snapshot
PIL/SETHEO: A Tool for the Automatic Analysis of Authentication Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48747-6_9openalex-snapshot
Avoiding Non-Ground Variables
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_1openalex-snapshot
A Multi-level Approach to Program Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-54594-8_72openalex-snapshot
The LILOG inference engine
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_10openalex-snapshot
Performance of competitive OR-parallelism
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_4openalex-snapshot
Connectionist inference systems
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_9openalex-snapshot
Random competition: A simple, but efficient method for parallelizing inference systems
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
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-55616-8_54openalex-snapshot
Knowledge selection in large knowledge bases
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_41openalex-snapshot
Search space pruning by checking dynamic term growth
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_55openalex-snapshot
Refinements and extensions of model elimination
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_64openalex-snapshot
A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems
inferred← citeshttps://doi.org/10.1007/3-540-57307-0_25openalex-snapshot
Optimal Multiprogramming Control for Parallel Computations
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_163openalex-snapshot
Optimal parallelization of Las Vegas algorithms
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_8openalex-snapshot
Theory reasoning in first order calculi
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_16openalex-snapshot
Detecting non-provable goals
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_18openalex-snapshot
The TPTP problem library
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_51openalex-snapshot
Semantic tableaux with ordering restrictions
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_58openalex-snapshot
DELTA — A bottom-up preprocessor for top-down theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_59openalex-snapshot
SETHEO V3.2: Recent developments
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_60openalex-snapshot
KoMeT
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot
Model elimination without contrapositives
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_165openalex-snapshot
Analysing the load balancing scheme of a parallel system on multiprocessors — A modeling approach —
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_37openalex-snapshot
Towards efficient calculi for resource-oriented deductive planning
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_24openalex-snapshot
Issues in theorem proving based on the connection method
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_28openalex-snapshot
Using connection method in modal logics: Some advantages
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_31openalex-snapshot
On transforming intuitionistic matrix proofs into standard-sequent proofs
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_32openalex-snapshot
A connection based proof method for intuitionistic logic
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_35openalex-snapshot
Link deletion in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_37openalex-snapshot
Constraint model elimination and a PTTP-implementation
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_46openalex-snapshot
Using the theorem prover SETHEO for verifying the development of a communication protocol in FOCUS -A Case Study-
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_41openalex-snapshot
CAVEAT: technique and tool for computer aided verification and transformation
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_10openalex-snapshot
Guiding program development systems by a connection based proof strategy
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_13openalex-snapshot
Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_16openalex-snapshot
T-string unification: Unifying prefixes in non-classical proof methods
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_31openalex-snapshot
Deduction by combining semantic tableaux and integer programming
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_34openalex-snapshot
Representing unification in a logical framework
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_104openalex-snapshot
Converting non-classical matrix proofs into sequent-style systems
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_87openalex-snapshot
SiCoTHEO: Simple competitive parallel theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_1openalex-snapshot
Problem-oriented applications of automated theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_70openalex-snapshot
A uniform proof procedure for classical and non-classical logics
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_12openalex-snapshot
Automatic verification of cryptographic protocols with SETHEO
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_8openalex-snapshot
ILF-SETHEO
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_9openalex-snapshot
SETHEO goes software engineering: Application of ATP to software reuse
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_45openalex-snapshot
Restart tableaux with selection function
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_27openalex-snapshot
Deleting Redundancy in Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/3540617795_15openalex-snapshot
SPTHEO — A PVM-based parallel theorem prover
inferred← citeshttps://doi.org/10.1007/978-0-85729-299-5_3openalex-snapshot
First-order Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_3openalex-snapshot
Reachability Analysis for the Extension Procedure — A Topological Result —
inferred← citeshttps://doi.org/10.1007/978-3-030-20652-9_9openalex-snapshot
Automated Backend Selection for ProB Using Deep Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_13openalex-snapshot
From Schütte’s Formal Systems to Modern Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_4openalex-snapshot
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_38openalex-snapshot
Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_1openalex-snapshot
Range-Restricted and Horn Interpolation through Clausal Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_9openalex-snapshot
Lemmas: Generation, Selection, Application
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_11openalex-snapshot
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_5openalex-snapshot
Finding Connections via Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_9openalex-snapshot
Advances in Connection-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot
Parallel Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_7openalex-snapshot
A Decision Procedure for Equality Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_11openalex-snapshot
Universal Variables in Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_23openalex-snapshot
leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
inferred← citeshttps://doi.org/10.1007/978-3-540-74565-5_2openalex-snapshot
Early History and Perspectives of Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-17172-7_3openalex-snapshot
Specifying and Verifying Organizational Security Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-34481-7_82openalex-snapshot
Machine Learning Approach to Enhance the Design of Automated Theorem Provers
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-75182-0_51openalex-snapshot
P A R T H E O: A Parallel Inference Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-78565-8_52openalex-snapshot
HEUROPA Heuristic Optimization of Parallel Computations
inferred← citeshttps://doi.org/10.1007/978-3-658-32075-1_3openalex-snapshot
Prädikatenlogik erster Stufe
inferred← citeshttps://doi.org/10.1007/978-3-658-44955-1_3openalex-snapshot
Prädikatenlogik erster Stufe
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_3openalex-snapshot
Answers for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/978-3-663-01522-2_4openalex-snapshot
Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-6604-8_4openalex-snapshot
On Robotics Scenarios and Modeling with Fibered Structures
inferred← citeshttps://doi.org/10.1007/978-3-8348-2157-7_3openalex-snapshot
Prädikatenlogik erster Stufe
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_9openalex-snapshot
Natural Language Presentation and Combination of Automatically Generated Proofs
inferred← citeshttps://doi.org/10.1007/978-94-010-0550-0_7openalex-snapshot
Model-Guided Proof Planning
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_15openalex-snapshot
Properties and Relations of Tableau and Connection Calculi
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_18openalex-snapshot
Automated Theorem Proving in High-Quality Software Design
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_4openalex-snapshot
A Connection Calculus for Handling Incomplete Information
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_10openalex-snapshot
Parallel Theorem Provers Based on Setheo
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_4openalex-snapshot
Integrating Automated and Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_1openalex-snapshot
Lattice-Ordered Groups in Deduction
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_11openalex-snapshot
Deduction-Based Software Component Retrieval
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_8openalex-snapshot
Using Automated Theorem Provers in Verification of Protocols
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_3openalex-snapshot
First-Order Tableau Methods
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferred← citeshttps://doi.org/10.1007/bf00881832openalex-snapshot
A new methodology for query answering in default logics via structure-oriented theorem proving
inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot
METEOR: Exploring model elimination theorem proving
inferred← citeshttps://doi.org/10.1007/bf00881947openalex-snapshot
Controlled integration of the cut rule into connection tableau calculi
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bf00881952openalex-snapshot
Tableau-based theorem provers: Systems and implementations
inferred← citeshttps://doi.org/10.1007/bf01530821openalex-snapshot
Near-Horn Prolog and the ancestry family of procedures
inferred← citeshttps://doi.org/10.1007/bf03037298openalex-snapshot
Globally linear connection method
inferred← citeshttps://doi.org/10.1007/bf03037315openalex-snapshot
On semantic resolution with lemmaizing and contraction and a formal treatment of caching
inferred← citeshttps://doi.org/10.1007/bfb0013064openalex-snapshot
OR-parallel theorem proving with random competition
inferred← citeshttps://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
inferred← citeshttps://doi.org/10.1007/bfb0021970openalex-snapshot
A complete connection calculus with rigid E-unification
inferred← citeshttps://doi.org/10.1007/bfb0022562openalex-snapshot
On loop detection in connection calculi
inferred← citeshttps://doi.org/10.1007/bfb0023438openalex-snapshot
Computing answers for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0027407openalex-snapshot
Free variable tableaux for propositional modal logics
inferred← citeshttps://doi.org/10.1007/bfb0027413openalex-snapshot
Ordered tableaux: Extensions and applications
inferred← citeshttps://doi.org/10.1007/bfb0027415openalex-snapshot
Subgoal alternation in model elimination
inferred← citeshttps://doi.org/10.1007/bfb0027424openalex-snapshot
A framework for using knowledge in tableau proofs
inferred← citeshttps://doi.org/10.1007/bfb0052112openalex-snapshot
The composition heuristic
inferred← citeshttps://doi.org/10.1007/bfb0054243openalex-snapshot
System description: similarity-based lemma generation for model elimination
inferred← citeshttps://doi.org/10.1007/bfb0054273openalex-snapshot
Using matings for pruning connection tableaux
inferred← citeshttps://doi.org/10.1007/bfb0055144openalex-snapshot
Exploiting parallelism in interactive theorem provers
inferred← citeshttps://doi.org/10.1007/bfb0057448openalex-snapshot
Acquisition of useful lemma-knowledge in automated reasoning
inferred← citeshttps://doi.org/10.1007/s10817-004-3243-2openalex-snapshot
Octopus: Combining Learning and Parallel Search
inferred← citeshttps://doi.org/10.1007/s10817-007-9089-7openalex-snapshot
Connection Tableaux with Lazy Paramodulation
inferred← citeshttps://doi.org/10.1007/s10817-015-9342-4openalex-snapshot
Mark Stickel: His Earliest Work
inferred← citeshttps://doi.org/10.1007/s10817-020-09576-7openalex-snapshot
Machine Learning Guidance for Connection Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-021-09590-3openalex-snapshot
Craig Interpolation with Clausal First-Order Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot
Set of Support, Demodulation, Paramodulation: A Historical Perspective
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90110-wopenalex-snapshot
Letter to the editor
inferred← citeshttps://doi.org/10.1016/0303-2647(94)01453-eopenalex-snapshot
A precondition prover for analogy
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot
A Prolog technology theorem prover: a new exposition and implementation in Prolog
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/b978-0-444-81704-4.50015-6openalex-snapshot
Parallel Automated Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50020-8openalex-snapshot
Scalability of an OR-parallel Theorem Prover — A Modelling Approach —
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50028-xopenalex-snapshot
Term Indexing
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50030-8openalex-snapshot
Model Elimination and Connection Tableau Procedures
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.006openalex-snapshot
Theorema: Towards computer-aided mathematical theory exploration
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.11.001openalex-snapshot
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00113-8openalex-snapshot
Evaluating general purpose automated theorem proving systems
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00046-xopenalex-snapshot
Clause trees: a tool for understanding and implementing resolution in automated reasoning
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00007-6openalex-snapshot
Non-Horn clause logic programming
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00544-4openalex-snapshot
An automatic proof of Gödel's incompleteness theorem
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00064-2openalex-snapshot
Let's plan it deductively!
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot
Prolog technology for default reasoning: proof theory and compilation techniques
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00225-2openalex-snapshot
Towards the qualitative, plan-based simulation of international crises
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00037-3openalex-snapshot
leanCoP: lean connection-based theorem proving
inferred← citeshttps://doi.org/10.1016/s0923-0459(97)80012-2openalex-snapshot
SiCoTHEO—Simple competitive parallel theorem provers based on SETHEO
inferred← citeshttps://doi.org/10.1023/a:1005711712356openalex-snapshot
Fast Subsumption Checks Using Anti-Links
inferred← citeshttps://doi.org/10.1023/a:1005770705587openalex-snapshot
The Use of Lemmas in the Model Elimination Procedure
inferred← citeshttps://doi.org/10.1023/a:1005806324129openalex-snapshot
The TPTP Problem Library
inferred← citeshttps://doi.org/10.1023/a:1005808119103openalex-snapshot
SETHEO and E-SETHEO - The CADE-13 Systems
inferred← citeshttps://doi.org/10.1023/a:1005812703468openalex-snapshot
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion
inferred← citeshttps://doi.org/10.1023/a:1005885725562openalex-snapshot
Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference
inferred← citeshttps://doi.org/10.1023/a:1006006930186openalex-snapshot
The CADE-14 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1006127022180openalex-snapshot
SPS-Parallelism + SETHEO = SPTHEO
inferred← citeshttps://doi.org/10.1023/a:1013886427723openalex-snapshot
Free-Variable Tableaux for Propositional Modal Logics
inferred← citeshttps://doi.org/10.1023/a:1018932114059openalex-snapshot
A taxonomy of parallel strategies for deduction
inferred← citeshttps://doi.org/10.1023/a:1018976510663openalex-snapshot
Heuristics used by HERBY for semantic tree theorem proving
inferred← citeshttps://doi.org/10.1080/00207169608804524openalex-snapshot
The practicality of generating semantic trees for proofs of unsatisfiability
inferred← citeshttps://doi.org/10.1093/logcom/6.6.819openalex-snapshot
A-ordered tableaux
inferred← citeshttps://doi.org/10.1109/72.712151openalex-snapshot
A general framework for adaptive processing of data structures
inferred← citeshttps://doi.org/10.1109/ase.1997.632845openalex-snapshot
NORA/HAMMR: making deduction-based software component retrieval practical
inferred← citeshttps://doi.org/10.1109/csmr.1998.665799openalex-snapshot
DBFW: a simple database framework for the evaluation and maintenance of automated theorem prover data
inferred← citeshttps://doi.org/10.1109/ecows.2006.15openalex-snapshot
Enhanced Specifications for Web Service Composition
inferred← citeshttps://doi.org/10.1109/kbse.1991.638029openalex-snapshot
A Knowledge And Deduction Based Software Retrieval Tool
inferred← citeshttps://doi.org/10.1109/kst.2015.7051467openalex-snapshot
Incorporating logic in Artificial Bee Colony (ABC) algorithm to solve first order logic problems: The logical ABC
inferred← citeshttps://doi.org/10.1109/tai.1999.809835openalex-snapshot
Neurules: improving the performance of symbolic rules
inferred← citeshttps://doi.org/10.1142/s0218001499000136openalex-snapshot
STRATEGY PARALLELISM IN AUTOMATED THEOREM PROVING
inferred← citeshttps://doi.org/10.1142/s0218213000000094openalex-snapshot
NEURULES: IMPROVING THE PERFORMANCE OF SYMBOLIC RULES
inferred← citeshttps://doi.org/10.1142/s0218213001000477openalex-snapshot
AN AUTOMATED THEOREM PROVER BASED ON CONNECTION TABLEAU CALCULI WITH DISJUNCTIVE CONSTRAINTS
inferred← citeshttps://doi.org/10.1145/133057.133158openalex-snapshot
Performance analysis of a parallel theorem prover
inferred← citeshttps://doi.org/10.1145/2815782.2815823openalex-snapshot
Evaluating Resolution-Based Reasoning Heuristics for Connection Tableau
inferred← citeshttps://doi.org/10.1147/rd.366.0965openalex-snapshot
Knowledge in operation
inferred← citeshttps://doi.org/10.1177/30504554261463374openalex-snapshot
The CADE-30 Automated Theorem Proving System Competition—CASC-30
inferred← citeshttps://doi.org/10.1515/9783111386690-009openalex-snapshot
1857 Automatische Inferenz
inferred← citeshttps://doi.org/10.1515/9783111386690-029openalex-snapshot
76924 Geschichte der KI
inferred← citeshttps://doi.org/10.1561/9781680838992openalex-snapshot
Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT
inferred← citeshttps://doi.org/10.1613/jair.573openalex-snapshot
Cooperation between Top-Down and Bottom-Up Theorem Provers
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.2514/6.2026-0564openalex-snapshot
Autonomous Spacecraft Health Management: Results From IM-2 Lunar Mission
inferred← citeshttps://doi.org/10.25560/5591openalex-snapshot
A global workspace framework for combined reasoning
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0088openalex-snapshot
Connection-Based Theorem Proving in Classical and Non-Classical Logics
inferred← citeshttps://doi.org/10.3233/aic-2010-0464openalex-snapshot
Restricting backtracking in connection calculi
inferred← citeshttps://doi.org/10.4204/eptcs.325.40openalex-snapshot
A Low-Level Index for Distributed Logic Programming
showing the first 200 of 206 · page through all 206
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.