PROVER: A first-order logic system in Ada
Conference
·
OSTI ID:6120000
PROVER is a complete first-order-predicate logic system written in Ada. The system takes advantage of Ada strong typing to improve the run time performance of the unification algorithm. In addition, two new techniques of unification indexes and goal directed deductions are introduced and implemented. PROVER is based on the logic tableau method of Manna and Waldinger. A generalized resolution method combined with a polarity strategy is used to compute the goal-directed first-order logic deductions. The heart of the system is a most general unifier with support for variable renaming, string substitution, and complex list structures. Universal and existential skolemization is based on the force of quantifier method. Rules for true-false simplification, negation, splitting, and rewrites are supported. This paper describes the algorithms used in PROVER as well as implementation details of the Ada code.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 6120000
- Report Number(s):
- UCRL-96632; CONF-8710163-1; ON: DE88000220
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel processing approach for implementing high-performance first-order logic deduction systems
LMA-based theorem prover
Foundations of deductive databases and logic programming
Technical Report
·
Fri Mar 31 23:00:00 EST 1989
·
OSTI ID:6215473
LMA-based theorem prover
Technical Report
·
Tue Nov 30 23:00:00 EST 1982
·
OSTI ID:6518800
Foundations of deductive databases and logic programming
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5090928