Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

Authors:
Andrei Voronkov
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 64
Cited 4

Fast many-to-one matching algorithms

Proc. of the first international conference on Rewriting techniques and applications
Schubert's steamroller problem: formulations and solutions

Journal of Automated Reasoning
Automated deduction by theory resolution

Journal of Automated Reasoning
LISS—the logic inference search system

CADE-10 Proceedings of the tenth international conference on Automated deduction
Satisfiability of systems of ordinal notations with the subterm property is decidable

Proceedings of the 18th international colloquium on Automata, languages and programming
Basic superposition is complete

ESOP'92 Symposium proceedings on 4th European symposium on programming
Simple LPO constraint solving methods

Information Processing Letters
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
Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
On the efficiency of subsumption algorithms

Journal of the ACM (JACM)
Avoiding slack variables in the solving of linear diophantine equations and inequations

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Automatic proofs and counterexamples for some ortholattice identities

Information Processing Letters
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Term Indexing

Term Indexing
Barcelona

Journal of Automated Reasoning
Gandalf

Journal of Automated Reasoning
WALDMEISTER - High-Performance Equational Deduction

Journal of Automated Reasoning
Solution of the Robbins Problem

Journal of Automated Reasoning
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Equality Elimination for the Tableau Method

DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Knuth-Bendix Constraint Solving Is NP-Complete

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Partially Adaptive Code Trees

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Associative-Commutative Discrimination Nets

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Solved Forms for Path Ordering Constraints

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
DISCOUNT: A SYstem for Distributed Equational Deduction

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Substitution Tree Indexing

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
RPO Constraint Solving Is in NP

Proceedings of the 12th International Workshop on Computer Science Logic
Replacement Rules with Definition Detection

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Logic Machine Architecture: Inference Mechanisms

Proceedings of the 6th Conference on Automated Deduction
Logic Machine Architecture: Kernel Funtions

Proceedings of the 6th Conference on Automated Deduction
Ordering Constraints on Trees

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
PARTHEO: A High-Performance Parallel Theorem Prover

Proceedings of the 10th International Conference on Automated Deduction
Basic Paramodulation and Superposition

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
SCOTT: Semantically Constrained Otter System Description

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Extended Path-Indexing

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
AC-Superposition with Constraints: No AC-Unifiers Needed

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Distributed Theorem Proving by Peers

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Towards Efficient Subsumption

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Extensional Higher-Order Resolution

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
System Abstract: E 0.3

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: Spass Version 1.0.0

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Vampire

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Invited Talk: Rewrite-based Deduction and Symbolic Constraints

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Stratified Resolution

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
System Description: MBASE, an Open Mathematical Knowledge Base

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
System Description: SystemOn TPTP

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
On the Evaluation of Indexing Techniques for Theorem Proving

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CCE: Testing Ground Joinability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Context Trees

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Vampire 1.1 (System Description)

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
ROO: A Parallel Theorem Prover

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
System Description: LEO - A Higher-Order Theorem Prover

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Term indexing

Handbook of automated reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Cooperation of heterogeneous provers

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A complete unification algorithm for associative-commutative functions

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Splitting without backtracking

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

The design and implementation of VAMPIRE

AI Communications - CASC
A phytography of WALDMEISTER

AI Communications - CASC
Alternating two-way AC-tree automata

Information and Computation
Resolution with Order and Selection for Hybrid Logics

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms and datastructures form the kernel of any efficient theorem prover. In this abstract we discuss research on algorithms and datastructures for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and datastructures, and to efficient theorem proving in general.