Skip Navigation

Journal of Logic and Computation 1991 1(6):835-859; doi:10.1093/logcom/1.6.835
© 1991 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by WAGNER, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Logic Programming with Strong Negation and Inexact Predicates

GERD WAGNER

Gruppe Logik, Wissenstheorie und Information, Institut für Philosophic, Freie Universität Berlin Habelschwerdter Allee 30, 1000 Berlin 33, Germany

We show how a negation operation which allows for the possibility to represent explicit negative information can be added to Prolog without essentially altering its computational structure. This negation is called strong since it expresses a notion of directly established falsity as opposed to the rather weak notion of indirectly established falsity expressed by negation-as-failure. By means of strong negation the useful distinction between exact and inexact predicates can be expressed in logic programs providing for the capability of reasoning with empirical domains.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.