Automated Theorem Proving in a Combination of Theories with Disjoint Signatures

Authors:
Pavel Vanousek
Affiliations:
-
Venue:
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
1998

Citing 14
Cited 0

Principles of artificial intelligence

Principles of artificial intelligence
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
A Prolog technology theorem prover: a new exposition and implementation in Prolog

Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
First-Order Automation for Higher-Order-Logic Theorem Proving

Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Combining Decision Procedures in the HOL System

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Deciding Combinations of Theories

Proceedings of the 6th Conference on Automated Deduction
Structured Theories in LCF

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Model Elimination Without Contrapositives

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Integration of Automated and Interactive Theorem Proving in ILP

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A Practical Integration of First-Order Reasoning and Decision Procedures

CADE-14 Proceedings of the 14th International Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for automated theorem proving in a combination of theories with disjoint signatures. The Nelson-Oppen combination technique for decision procedures is used to combine separate theorem provers in different theories. The provers being combined are based on the Prolog Technology Theorem Proving method and they use the SLD resolution (alternatively Model Elimination) as an inference system. Our approach enables to tune up the provers for different theories separately and increases the efficiency of automated theorem proving in a combination of theories.