Results 1 
3 of
3
A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler
 Journal of Automated Reasoning
, 1987
"... A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full firstorder predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the modelelimination reduction rule that is added to Prolog inferences to make the ..."
Abstract

Cited by 103 (2 self)
 Add to MetaCart
(Show Context)
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full firstorder predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the modelelimination reduction rule that is added to Prolog inferences to make the inference system complete, and depthfirst iterativedeepening search instead of unbounded depthfirst search to make the search strategy complete. A Prolog technology theorem prover has been implemented by an extended PrologtoLISP compiler that supports these additional features. It is capable of proving theorems in the full firstorder predicate calculus at a rate of thousands of inferences per second. 1 This is a revised and expanded version of a paper presented at the 8th International Conference on Automated Deduction, Oxford, England, July 1986, and is to appear in Journal of Automated Reasoning. This research was supported by the Defense Advanced Research Projects Agency under Co...
Java and Web Extensions of the Yices Little Engine of Proof
"... Automated Deduction, also known as Theorem Proving, is the study of programs that prove theorems. The domain evolved into two main trends: uniform proof search procedures which are guided by heuristics and based on the John Alan Robinson’s resolution method, and combination of domain specific decis ..."
Abstract
 Add to MetaCart
(Show Context)
Automated Deduction, also known as Theorem Proving, is the study of programs that prove theorems. The domain evolved into two main trends: uniform proof search procedures which are guided by heuristics and based on the John Alan Robinson’s resolution method, and combination of domain specific decision procedures called little engines of proof introduced by Hao Wang. Yices is a Satisfiability Modulo Theories little engine developed at Stanford Research Institute (SRI) capable of handling theories including uninterpreted functions, integer and real arithmetics, lambda expressions, arrays, bitvectors, tuples, records and recursive datatypes (e.g. lists). Yices is the 2006 winner of the Satisfiability Modulo Theories Competition (SMTCOMP), a competition that benchmarks the stateoftheart little engines. Based on the needs expressed by the developers of Yices at SRI, for this Software Development and Engineering Master Thesis, we developed documentation and material to make Yices more accessible and encourage its use and
Abduction as Satisfiability
"... Abstract. Abduction is reasoning in propositional or firstorder logic that provides explanations for observations. We show how contextfree parsing and automated planning can be formulated using abductive rules and present a fast prover based on propositional satisfiability. Furthermore we show ho ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Abduction is reasoning in propositional or firstorder logic that provides explanations for observations. We show how contextfree parsing and automated planning can be formulated using abductive rules and present a fast prover based on propositional satisfiability. Furthermore we show how weighted abduction can be efficiently implemented in the prover.