Transforming floundering into success
Lee Naish (Univ. of Melbourne)
Abstract
We show how logic programs with “delays” can be transformed to programs without delays in a way which preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal independent approach to be used for analysis and debugging of properties related to floundering. We rely on some previously introduced restrictions on delay primitives and a key observation which allows properties such as groundness to be analysed by approximating the (ground) success set.
Bibtex (Use it for references)
@article{KEYWORD,
journal = {Theory and Practice of Logic Programming},
publisher = {Cambridge University Press},
author = {Lee Naish},
title = {Transforming floundering into success},
volume = {14},
issue = {2},
number = {3},
pages = {215-238},
year = {2014}
}