Automated deduction by theory resolution

Authors:
Mark E. Stickel
Affiliations:
Artificial Intelligence Center, SRI International and Center for the Study of Language and Information, Stanford University
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 8
Cited 4

A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness

Journal of the ACM (JACM)
Z-Resolution: Theorem-Proving with Compiled Axioms

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Linked Inference Principle, II: The User's Viewpoint

Proceedings of the 7th International Conference on Automated Deduction
An Evaluation of an Implementation of Qualified Hyperresolution

IEEE Transactions on Computers
Krypton: A Functional Approach to Knowledge Representation

Computer

Theory links: Applications to automated theorem proving

Journal of Symbolic Computation
Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies

ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
A Simple Sequent System for First-Order Logic with Free Constructors

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deriving Focused Calculi for Transitive Relations

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. ...