Theory links: Applications to automated theorem proving

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, State University of New York at Albany, 1400 Washington Ave., LI 67.4, Albany, New York 1222, U.S.A.;Department of Computer Science, Wellesley College, Science Center, Wellesley, Massachusets 02JSJ, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 13
Cited 2

Special relations in automated deduction

Journal of the ACM (JACM) - The MIT Press scientific computation series
Automated deduction by theory resolution

Journal of Automated Reasoning
Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

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

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Path Resolution and Semantic Graphs

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Deciding Combinations of Theories

Proceedings of the 6th Conference on Automated Deduction
The Linked Inference Principle, II: The User's Viewpoint

Proceedings of the 7th International Conference on Automated Deduction
Automated deduction by theory resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
An essential hybrid reasoning system: knowledge and symbol level accounts of KRYPTON

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
The interaction between assertional and terminological knowledge in krypton

PKWBS-W'84 Proceedings of the 1984 IEEE conference on Principles of knowledge-based systems

Dissolution: making paths vanish

Journal of the ACM (JACM)
A Confluent Theory Connection Calculus

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop the notion of theory link, which is a generalization of ordinary link to a set of literals that are simultaneously unsatisfiable relative to a given set of clauses. We show that theory links may be 'activated' in much the same manner as ordinary links when inferencing with respect to the given set of clauses. Several link deletion results are shown to hold for 6heory links, and some examples are presented using first-order theory links.