| Logic Programming with Requests (1999) | |||||||||||||||
Abstract | |||||||||||||||
| 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. 1 Introduction The purpose of this paper is to present an extension of logic programming where it is possible to express a form of partial result. This is done by considering instead of the traditional successful derivations, where all subgoals are resolved, so-called adequate derivations, where possibly some subgoals remain. The intuition is that an adequate derivation is similar to a derivation in a lazy functional language, like for instance Haskell, where an e... | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||