|Title:||A Resolution-based Proof Procedure Using Deletion-directed Search
|Abstract:||The operation of a deletion-directed search strategy for resolutionbased proof procedures is discussed. The strategy attempts to determine the satisfiability of a set of input clauses while at the same time minimizing the cardinality of the set of retained clauses. Distribution, a new ~lause deletion rule which is fundamental to the operation of the search strategy, is also described.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1974/CS/CS0042), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1974
To the main CS technical reports page
Computer science department, Technion