T-Resolution: Refinements and Model Elimination

Authors:
Andrea Formisano;Alberto Policriti
Affiliations:
University of Rome “La Sapienza”, Department of Computer Science, Via Salaria 113, 00198 Roma (I). e-mail: formisan@dsi.uniroma1.it;University of Udine, Department of Mathematics and Computer Science, Via delle Scienze 206, 33100 Udine (I). e-mail: policrit@dimi.uniud.it
Venue:
Journal of Automated Reasoning
Year:
1999

Citing 14
Cited 4

Automated deduction by theory resolution

Journal of Automated Reasoning
Programming with sets; an introduction to SETL

Programming with sets; an introduction to SETL
Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Computable set theory

Computable set theory
T-theorem proving I

Journal of Symbolic Computation
On T logic programming

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
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
An Order Theory Resolution Calculus

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Towards a Connection Procedure with Built in Theories

JELIA '90 Proceedings of the European Workshop on Logics in AI
A Model Elimination Calculus with Built-in Theories

GWAI '92 Proceedings of the 16th German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Completeness of the Pool Calculus with an Open Built-in Theory

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Formative processes with applications to the decision problem in set theory I: powerset and singleton operators

Information and Computation
Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
Theory-specific automated reasoning

A 25-year perspective on logic programming
An environment for specifying properties of dyadic relations and reasoning about them II: relational presentation of non-classical logics

TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

T-resolution is a binary rule, proposed by Policriti and Schwartz in 1995 for theorem proving in first-order theories (T-theorem proving) that can be seen – at least at the ground level – as a variant of Stickel’s theory resolution. In this paper we consider refinements of this rule as well as the model elimination variant of it. After a general discussion concerning our viewpoint on theorem proving in first-order theories and a brief comparison with theory resolution, the power and generality of T-resolution are emphasized by introducing suitable linear and ordered refinements, uniformly and in strict analogy with the standard resolution approach. Then a model elimination variant of T-resolution is introduced and proved to be sound and complete; some experimental results are also reported. In the last part of the paper we present two applications of T-resolution: to constraint logic programming and to modal logic.