Mark E. Stickel

Learn More
An extenston of the Knuth-Bendix algorithm for finding complete sets of reductions is described. The extension is intended to handle equational theories which can be split into two parts, R and T, such that each equation m R can be construed as a reduction and T represents an equational theory for which a finite, complete umficat~on algorithm ~s known. The(More)
FASTUS is a system for extracting information from natural language text for entry into a database and for other applications. It works essentially as a cascaded, nondeterministic nite-state automaton. There are ve stages in the operation of FASTUS. In Stage 1, names and other xed form expressions are recognized. In Stage 2, basic noun groups, verb groups,(More)
Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can reduce the length of proofs and the size of the search space. Theory resolution effects a beneficial division of labor, improving the(More)
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the model-elimination reduction rule that is added to Prolog inferences to make the inference system complete, and depth-first(More)
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction(More)
Automated deduction techniques are being used in a system called Amphion to derive, from graphical speci cations, programs composed from a subroutine library. The system has been applied to construct software for the planning and analysis of interplanetary missions. The library for that application is a collection of subroutines written in FORTRAN-77 at JPL(More)