Please use this identifier to cite or link to this item:
https://doi.org/10.1007/BF03037511
DC Field | Value | |
---|---|---|
dc.title | The Prolog not-predicate and negation as failure rule | |
dc.contributor.author | Ling, T.W. | |
dc.date.accessioned | 2014-10-27T06:04:10Z | |
dc.date.available | 2014-10-27T06:04:10Z | |
dc.date.issued | 1990-03 | |
dc.identifier.citation | Ling, T.W. (1990-03). The Prolog not-predicate and negation as failure rule. New Generation Computing 8 (1) : 5-31. ScholarBank@NUS Repository. https://doi.org/10.1007/BF03037511 | |
dc.identifier.issn | 02883635 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/99439 | |
dc.description.abstract | Clark's query evaluation procedure for computing negative information in deductive databases using a "negation as failure" inference rule requires a safe computation rule which may only select negative literals if they are ground. This is a very restrictive condition, which weakens the usefulness of negation as failure in a query evaluation procedure. This paper studies the definition and properties of the "not" predicate defined in most Prolog systems which do not enforce the above mentioned condition of a safe computation rule. We show that the negation in clauses and the "not" Predicate of Prolog are not the same. In fact a Prolog program may not be in clause form. An extended query evaluation procedure with an extended safe computation rule is proposed to evaluate queries which involve the "not" predicate. The soundness and completeness of this extended query evaluation procedure with respect to a class of logic programs are proved. The implementation of such an extended query evaluation procedure in a Prolog system can be implemented by a preprocessor for executing range restricted programs and requires no modification to the interpreter/compiler of an existing Prolog system. We compare this proposed extended query evaluation procedure with the extended program proposed by Lloyd and Topor, and the negation constructs in NU-Prolog. The use of the "not" predicate for integrity constraint checking in deductive databases is also presented. © 1990 Ohmsha, Ltd. and Springer. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/BF03037511 | |
dc.source | Scopus | |
dc.subject | Clark's Query Evaluation Procedure | |
dc.subject | Extended Query Evaluation Procedure | |
dc.subject | Negation as Failure | |
dc.subject | Negative Formula | |
dc.subject | Prolog Not-Predicate | |
dc.type | Article | |
dc.contributor.department | INFORMATION SYSTEMS & COMPUTER SCIENCE | |
dc.description.doi | 10.1007/BF03037511 | |
dc.description.sourcetitle | New Generation Computing | |
dc.description.volume | 8 | |
dc.description.issue | 1 | |
dc.description.page | 5-31 | |
dc.description.coden | NGCOE | |
dc.identifier.isiut | A1990GF14500002 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.