A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
Information and Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The CADE-13 ATP System Competition
Journal of Automated Reasoning
Otter - The CADE-13 Competition Incarnations
Journal of Automated Reasoning
Improving Transformation Systems for General E-Unification
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Caching and Lemmaizing in Model Elimination Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SETHEO V3.2: Recent Developments - System Abstract
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)
The CADE-14 ATP System Competition
Journal of Automated Reasoning
SPTHEO - A Parallel Theorem Prover
Journal of Automated Reasoning
The CADE-16 ATP System Competition
Journal of Automated Reasoning
The CADE-17 ATP System Competition
Journal of Automated Reasoning
The IJCAR ATP System Competition
Journal of Automated Reasoning
IEEE Transactions on Knowledge and Data Engineering
Lemma Generalization and Non-unit Lemma Matching for Model Elimination
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
E-SETHEO: Design, Configuration and Use of a Parallel Automated Theorem Prover
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Adaptive Saturation-Based Reasoning
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
p-SETHEO: Strategy Parallelism in Automated Theorem Proving
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Strategy Parallel Use of Model Elimination with Lemmata (System Abstract)
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Integration of Equality Reasoning into the Disconnection Calculus
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Scheduling Methods for Parallel Automated Theorem Proving
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Three theses of representation in the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Handbook of automated reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
Limited resource strategy in resolution theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Sound methods and effective tools for model-based security engineering with UML
Proceedings of the 27th international conference on Software engineering
Connection Tableaux with Lazy Paramodulation
Journal of Automated Reasoning
Cooperation between top-down and bottom-up theorem provers
Journal of Artificial Intelligence Research
Lemma generation for model elimination by combining top-down and bottom-up inference
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
OWL rules: A proposal and prototype implementation
Web Semantics: Science, Services and Agents on the World Wide Web
Connection tableaux with lazy paramodulation
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Model-Based security engineering with UML
Foundations of Security Analysis and Design III
Certifiable program generation
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Hi-index | 0.00 |
The model elimination theorem prover SETHEO (version V3.3) and its equational extension E-SETHEO are presented. SETHEO employs sophisticated mechanisms of subgoal selection, elaborate iterative deepening techniques, and local failure caching methods. Its equational counterpart E-SETHEO transforms formulae containing equality (using a variant of Brand’s modification method) and processes the output with the standard SETHEO system. This article gives an overview of the theoretical background, the system architecture, and the performance of both systems.