The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 02, 1993
Filed:
Jun. 27, 1991
Henry A Kautz, Summit, NJ (US);
Bart Selman, Summit, NJ (US);
AT&T Bell Laboratories, Murray Hill, NJ (US);
Abstract
A technique for increasing the efficiency of a system such as an artificial intelligence system or a data base system in which a query is applied to a set of formulas. The technique creates an approximation of the set of formulas which is computationally more tractable than the original set. The original set is used to answer the query only if the approximation fails to provide the answer. The approximation is made by a compilation process which provides a series of ever-closer approximations. A given query is answered using the currently-closest approximation. The approximation may consist of a first set of formulas which is an upper bound (i.e. implied by) of the original set, and a second set which is a lower bound (i.e. implies) of the original set. In this case, the compilation process produces a series of increasing lower bounds and decreasing upper bounds until a greatest lower bound and a least upper bound are reached. Example applications of the technique are given for propositional languages, first order languages, languages based on definite clauses, and frame languages.