| |
| | AI Magazine: Automated Deduction Looking Ahead. @ HighBeam Research |
 | | We are beginning to see theorem provers that integrate inductive proof techniques, general rewrite procedures, model checking, propositional provers (such as the BDD method considered earlier), linear arithmetic, other decision procedures, tactic facilities, execution capabilities, enhanced static checking, lemma generation, and computer algebra systems. |
 | | A theorem prover is used to glue together appropriate routines from a subroutine library by matching specifications of each routine with specifications of the current demands. |
 | | The resultant theorem prover works in the first-order logic setting, using resolution, but replaces resolution proofs handling inequalities with a system as capable in most respects as a human in simplifying systems of inequalities. |
| www.highbeam.com /library/doc0.asp?DOCID=1G1:54367775&refid=ip_encyclopedia_hf (15080 words) |
|