Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T05:48:31.175Z Has data issue: false hasContentIssue false

On redundancy elimination tolerant scheduling rules

Published online by Cambridge University Press:  18 October 2001

FILOMENA FERRUCCI
Affiliation:
DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: [email protected], [email protected])
MARIA I. SESSA
Affiliation:
DMI Universita' di Salerno - via S. Allende, 84081 Baronissi (SA), Italy (e-mail: [email protected], [email protected])
GIULIANO PACINI
Affiliation:
Accademia Navale, Viale Italia 72, 57100 Livorno, Italy (e-mail: [email protected])

Abstract

In Ferrucci, Pacini and Sessa (1995) an extended form of resolution, called Reduced SLD resolution (RSLD), is introduced. In essence, an RSLD derivation is an SLD derivation such that redundancy elimination from resolvents is performed after each rewriting step. It is intuitive that redundancy elimination may have positive effects on derivation process. However, undesiderable effects are also possible. In particular, as shown in this paper, program termination as well as completeness of loop checking mechanisms via a given selection rule may be lost. The study of such effects has led us to an analysis of selection rule basic concepts, so that we have found convenient to move the attention from rules of atom selection to rules of atom scheduling. A priority mechanism for atom scheduling is built, where a priority is assigned to each atom in a resolvent, and primary importance is given to the event of arrival of new atoms from the body of the applied clause at rewriting time. This new computational model proves able to address the study of redundancy elimination effects, giving at the same time interesting insights into general properties of selection rules. As a matter of fact, a class of scheduling rules, namely the specialisation independent ones, is defined in the paper by using not trivial semantic arguments. As a quite surprising result, specialisation independent scheduling rules turn out to coincide with a class of rules which have an immediate structural characterisation (named stack-queue rules). Then we prove that such scheduling rules are tolerant to redundancy elimination, in the sense that neither program termination nor completeness of equality loop check is lost passing from SLD to RSLD.

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.)

Footnotes

This work has been partially supported by the Italian National Research Council (CNR) research project “Tecniche di taglio dei cicli e loro implementazione in ambiente di Programmazione Logica”, Grant No. 97.02432.CT12.