A taxonomy of theorem-proving strategies

Authors:
Maria Paola Bonacina
Affiliations:
Department of Computer Science, The University of Iowa, Iowa City, IA
Venue:
Artificial intelligence today
Year:
1999

Citing 85
Cited 10

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Refutational theorem proving using term-rewriting systems

Artificial Intelligence
Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
Automated deduction by theory resolution

Journal of Automated Reasoning
Relating resolution and algebraic completion for Horn logic

Proc. of the 8th international conference on Automated deduction
On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Rewrite method for theorem proving in first order theory with equality

Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Critical pair criteria for completion

Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation
A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
Non-horn clause logic programming without contrapositives

Journal of Automated Reasoning
Formal methods in artificial intelligence

Formal methods in artificial intelligence
First-order logic and automated theorem proving

First-order logic and automated theorem proving
Automated proofs of the Moufang identities in alternatives rings

Journal of Automated Reasoning
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
Automated reasoning (2nd ed.): introduction and applications

Automated reasoning (2nd ed.): introduction and applications
A sequent-style model elimination strategy and a positive refinement

Journal of Automated Reasoning
Canonical sets of Horn clauses

Proceedings of the 18th international colloquium on Automata, languages and programming
Theorem-proving with resolution and superposition

Journal of Symbolic Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method

Journal of the ACM (JACM)
Computational logic: essays in honor of Alan Robinson

Computational logic: essays in honor of Alan Robinson
Memoing for logic programs

Communications of the ACM
A method for simultaneous search for refutations and models by equational constraint solving

Journal of Symbolic Computation
On rewrite programs: semantics and relationship with Prolog

Journal of Logic Programming
SETHEO: a high-performance theorem prover

Journal of Automated Reasoning
Experiments with discrimination-tree indexing and path indexing for term retrieval

Journal of Automated Reasoning
Consolution as a framework for comparing calculi

Journal of Symbolic Computation
A new method for the Boolean ring based theorem proving

Journal of Symbolic Computation
Handbook of logic in artificial intelligence and logic programming (vol. 1)

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Methods and calculi for deduction

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Deduction systems based on resolution

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Equational reasoning and term rewriting systems

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
Towards a foundation of completion procedures as semidecision procedures

Theoretical Computer Science
Basic paramodulation

Information and Computation
PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
Computing answers with model elimination

Artificial Intelligence
The resolution calculus

The resolution calculus
33 basic test problems: a practical evaluation of some paramodulation strategies

Automated reasoning and its applications
Automated deduction techniques for studying rough algebras

Fundamenta Informaticae
On semantic resolution with lemmaizing and contraction and a formal treatment of caching

New Generation Computing
On the modeling of search in theorem proving—towards a theory of strategy analysis

Information and Computation
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure

Journal of the ACM (JACM)
A Unifying View of Some Linear Herbrand Procedures

Journal of the ACM (JACM)
An Implementation of the Model Elimination Proof Procedure

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Automated Reasoning: Essays in Honor of Woody Bledsoe

Automated Reasoning: Essays in Honor of Woody Bledsoe
The Use of Lemmas in the Model Elimination Procedure

Journal of Automated Reasoning
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion

Journal of Automated Reasoning
The CADE-13 ATP System Competition

Journal of Automated Reasoning
Gandalf

Journal of Automated Reasoning
Solution of the Robbins Problem

Journal of Automated Reasoning
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Heuristical Criteria in Refutational Theorem Proving

DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
An Overview of Rewrite Rule Laboratory (RRL)

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Goal Oriented Equational Theorem Proving Using Team Work

KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
A Complete Semantic Back Chaining Proof System

Proceedings of the 10th International Conference on Automated Deduction
Caching and Lemmaizing in Model Elimination Theorem Provers

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
MGTP: A Parallel Theorem Prover Based on Lazy Model Generation

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
DELTA - A Bottom-up Preprocessor for Top-Down Theorem Provers - System Abstract

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
KoMeT

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
PROTEIN: A PROver with a Theory Extension INterface

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
The Tableau-based Theorem Prover 3TAP Version 4.0

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
System Description: Generating Models by SEM

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
An Application of Automated Equational Reasoning to Many-valued Logic

Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
SETHEO V3.2: Recent Developments - System Abstract

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Deductive Composition of Astronomical Software from Subroutine Libraries

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Optimizing Proof Search in Model Elimination

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
An equational approach to theorem proving in first-order predicate calculus

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Complete inference rules for the cancellation laws

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Ordered semantic hyper linking

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

A taxonomy of parallel strategies for deduction

Annals of Mathematics and Artificial Intelligence
Improving the Efficiency of Reasoning Through Structure-Based Reformulation

SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Abstract canonical inference

ACM Transactions on Computational Logic (TOCL)
${\mathcal{T}}$-Decision by Decomposition

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
Theory decision by decomposition

Journal of Symbolic Computation
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
An overview of AI research in Italy

Artificial intelligence
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
The strategy challenge in SMT solving

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forward-reasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and search components of theorem proving, which are equally important in practice. For this purpose, a formal notion of search plan is given and shown to apply to all classes of strategies. For each class, the form of derivation is specified, and it is shown how inference system and search plan cooperate to generate it.