We propose an extension of logic programming where the user can specify, together with the initial query, the information he is interested in by means of a request. This allows one to extract a result from an incomplete computation, such as the prefix of an infinite derivation. The classical property of independence of the selection rule doesn't hold anymore. It is shown that under mild conditions a class of selection rules can be identified for which independence holds. A model-theoretic semantics for the language is given.
|Number of pages||15|
|Publication status||Published - Nov 1999|
|Event||16th International Conference on Logic Programming, ICLP 1999 - Las Cruces, United States|
Duration: 29 Nov 1999 → 4 Dec 1999
Conference number: 16
|Conference||16th International Conference on Logic Programming, ICLP 1999|
|Period||29/11/99 → 4/12/99|