| |
| | Automated Reasoning |
 | | Reasoning is the ability to make inferences, and automated reasoning is concerned with the building of computing systems that automate this process. |
 | | The reason is, of course, that the statement of the completeness of LK only has to assert, for each entailment relation, the existence of a proof tree but a reasoning program has the more difficult task of actually having to construct one. |
 | | Standard logic, including Horn logic, is monotonic which means that enlarging an axiom set by adding new axioms simply enlarges the set of theorems derivable from it; negation-by-failure, however, is non-monotonic and the addition of new program clauses to an existing Prolog program may cause some goals to cease from being theorems. |
| plato.stanford.edu /entries/reasoning-automated (12208 words) |
|