{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:00:52Z","timestamp":1648911652803},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2001,10,18]],"date-time":"2001-10-18T00:00:00Z","timestamp":1003363200000},"content-version":"unspecified","delay-in-days":47,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2001,9]]},"abstract":"<jats:p>In Ferrucci, Pacini and Sessa (1995) an extended form of resolution, called Reduced SLD \nresolution (RSLD), is introduced. In essence, an RSLD derivation is an SLD derivation \nsuch that redundancy elimination from resolvents is performed after each rewriting step. \nIt is intuitive that redundancy elimination may have positive effects on derivation process. \nHowever, undesiderable effects are also possible. In particular, as shown in this paper, program \ntermination as well as completeness of loop checking mechanisms via a given selection rule \nmay be lost. The study of such effects has led us to an analysis of selection rule basic \nconcepts, so that we have found convenient to move the attention from rules of atom \nselection to rules of atom scheduling. A priority mechanism for atom scheduling is built, \nwhere a priority is assigned to each atom in a resolvent, and primary importance is given \nto the event of arrival of new atoms from the body of the applied clause at rewriting time. \nThis new computational model proves able to address the study of redundancy elimination \neffects, giving at the same time interesting insights into general properties of selection rules. \nAs a matter of fact, a class of scheduling rules, namely the specialisation independent ones, \nis defined in the paper by using not trivial semantic arguments. As a quite surprising result, \nspecialisation independent scheduling rules turn out to coincide with a class of rules which \nhave an immediate structural characterisation (named stack-queue rules). Then we prove \nthat such scheduling rules are tolerant to redundancy elimination, in the sense that neither \nprogram termination nor completeness of equality loop check is lost passing from SLD to \nRSLD.<\/jats:p>","DOI":"10.1017\/s1471068401001235","type":"journal-article","created":{"date-parts":[[2008,8,14]],"date-time":"2008-08-14T06:46:23Z","timestamp":1218696383000},"page":"539-590","source":"Crossref","is-referenced-by-count":0,"title":["On redundancy elimination tolerant scheduling rules"],"prefix":"10.1017","volume":"1","author":[{"given":"FILOMENA","family":"FERRUCCI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARIA I.","family":"SESSA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIULIANO","family":"PACINI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2001,10,18]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068401001235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T14:50:26Z","timestamp":1554130226000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068401001235\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S1471068401001235"],"URL":"https:\/\/doi.org\/10.1017\/s1471068401001235","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}