Home Online Resources Table of Contents

Journal of Logic and Computation, Volume 7, Issue 6: December 1997.

Finite failure is and-compositional

R Gori and G Levi

Dipartimento di Informatica, Universita di Pisa, Corso Italia 40, 56125 Pisa, Italy. E-mail: {gori,levi}@di.unipi.it

We study some properties of SLD-trees related to finite failure. The main results are a theorem stating that the non-ground finite failure set is a correct and fully abstract semantics wrt finite failure and a second theorem stating that the complement of non-ground finite failure is and-compositional, i.e. that the finite failure behaviour of conjunctive goals can be derived from the finite failure behaviour of atomic goals. The proofs are based on two new lemmata which generalize to infinite derivations theorems which are valid for successful and finitely failed derivations.

Key words: Logic programming, finite failure

Pages 753-776


This page is run by Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK
as part of the OUP Journals World Wide Web service.
Comments and feedback: www-admin@oup.co.uk
URL: http://www.oup.co.uk/logcom/hdb/Volume_07/Issue_06/070753.sgm.abs.html
Last modification: 16 April 1998.
Copyright© Oxford University Press, 1998.