Finite Failure is And-compositional

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 wit finite failure and a second theorem stating that the complement of non-ground finite failure is and-composition...

Full description

Saved in:
Bibliographic Details
Published in:Journal of logic and computation 1997-12, Vol.7 (6), p.753-776
Main Authors: GORI, ROBERTA, LEVI, GIORGIO
Format: Article
Language:English
Subjects:
finite failure
Logic Programming
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 wit 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.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/7.6.753