LINUS - A Link Instantion Prover with Unit Support

Authors:
Reinhold Letz
Affiliations:
Institut für Informatik, Technische Universität München, München, Germany. e-mail: letz@informatik.tu-muenchen.de
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 4
Cited 1

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
The Results - of the CADE-13 ATP System Competition

Journal of Automated Reasoning
The TPTP Problem Library

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

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

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

LINUS is a theorem prover for clause logic based on hyperlinking. The main new feature of the system is the emphasis on the preference for unit clauses, which are generated as a by-product of the hyperlinking method. The mechanism of unit support also motivates a slightly different interpretation of hyperlinking, namely, as mate saturation. Mate saturation can be viewed as a generalization of unit-resulting resolution that is compatible with any set-of-support strategy. We give a survey on the theoretical background and the architecture of the system, and decribe its performance.