Skip to main content Accessibility help
×
Home
Hostname: page-component-768ffcd9cc-5rkl9 Total loading time: 0.249 Render date: 2022-12-03T23:26:06.310Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Linear tabulated resolution based on Prolog control strategy

Published online by Cambridge University Press:  03 April 2001

YI-DONG SHEN
Affiliation:
Department of Computer Science, Chongqing University, Chongqing 400044, People's Republic of China (e-mail: ydshen@cs.ualberta.ca)
LI-YAN YUAN
Affiliation:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 (e-mail: yuan@cs.ualberta.ca, you@cs.ualberta.ca)
JIA-HUAI YOU
Affiliation:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 (e-mail: yuan@cs.ualberta.ca, you@cs.ualberta.ca)
NENG-FA ZHOU
Affiliation:
Department of Computer and Information Science, Brooklyn College, The City University of New York, New York, NY 11210-2889, USA (e-mail: zhou@sci.brooklyn.cuny.edu)

Abstract

Infinite loops and redundant computations are long recognized open problems in Prolog. Two methods have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG-resolution and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabulated resolution called TP-resolution. TP-resolution has two distinctive features: (1) it makes linear tabulated derivations in the same way as Prolog except that infinite loops are broken and redundant computations are reduced. It handles cuts as effectively as Prolog; and (2) it is sound and complete for positive logic programs with the bounded-term-size property. The underlying algorithm can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
8
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Linear tabulated resolution based on Prolog control strategy
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Linear tabulated resolution based on Prolog control strategy
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Linear tabulated resolution based on Prolog control strategy
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *