Logic for Problem Solving Revisited by Robert Kowalski

Author:Robert Kowalski
Language: eng
Format: epub
Publisher: Books on Demand GmbH
Published: 2014-11-15T00:00:00+00:00

Deletion of links whose resolvents are tautologies

A clause is a tautology if it contains the same atom both as a condition and as a conclusion. The use of tautologies in top-down problem-solving leads to loops in which a goal reoccurs as its own subgoal. For that reason, because they do not positively contribute to the solution of problems, tautologies can be deleted from a set of clauses without affecting inconsistency [Robinson 1965a]. In the connection graph proof procedure, the effect of deleting tautologies can be obtained by deleting links whose resolvents are tautologies.

The set of clauses describing the concept of even number is an example.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.