Skip Navigation

Journal of Logic and Computation 1998 8(2):159-167; doi:10.1093/logcom/8.2.159
© 1998 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 BUCHHOLZ, W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

A note on SLDNF-resolution

WILFRIED BUCHHOLZ

Mathematisches Institut, Universität München Theresienstr. 39, D-80333 München, Germany E-mail: buchholz{at}rz.mathematik.uni-muenchen.de

We introduce a new notion of SLDNF-tree and prove a completeness result for SLDNF-resolution that extends a theorem by Stä rk: not only the existence of some successful (finitely failed, resp.) SLDNF-tree is established, but it is shown that every fair SLDNF-tree is successful (finitely failed, resp.).

Keywords: Logic programming; negation as failure; SLDNF-resolution


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.