Download:
|
by Annalisa Bossi, Sandro Etalle, Sabina Rossi
http://www.cs.unimaas.nl/~etalle/papers/ber00wellmoded.ps.gz
Add To MetaCart
Abstract:
Recent logic programming languages employ dynamic scheduling of calls to improve eciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically \delayed " until their arguments are suciently instantiated. To this end, logic languages are extended with constructs such as delay declarations. However, many declarative properties that hold for logic and pure Prolog programs do not apply any longer in this extended setting. In particular, the equivalence between the model-theoretic and operational semantics does not hold. In this paper, we study the class of input-consuming programs. Firstly, we argue that input-consuming logic programs are suitable for modeling programs employing delay declarations. Secondly, we show that { under some syntactic restrictions { the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one. Thus, input-consuming programs are shown to be the right answer for conjugate eciency and declarativeness.
Citations
|
556
|
The Art of Prolog
– Sterling, Shapiro
- 1986
|
|
387
|
Logic programming
– Apt
- 1990
|
|
258
|
The Godel Programming Language
– Hill, Lloyd
- 1994
|
|
157
|
From Logic Programming to Prolog
– Apt
- 1997
|
|
114
|
The s-semantics approach: Theory and applications
– Bossi, Gabrielli, et al.
- 1994
|
|
112
|
Declarative modeling of the operational behavior of logic languages
– Falaschi, Levi, et al.
- 1989
|
|
103
|
Algorithm = logic + control
– Kowalski
- 1979
|
|
80
|
On the occur-check free Prolog programs
– Apt, Pellegrini
- 1994
|
|
46
|
AND-parallelism with intelligent backtracking for annotated logic programs
– Dembinski, Maluszynski
- 1985
|
|
40
|
Parallelizing NU-Prolog
– Naish
- 1988
|
|
33
|
Verification of logic programs with delay declarations
– Apt, Luitjes
- 1995
|
|
24
|
Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard
– Ueda
- 1988
|
|
21
|
Coroutining and the construction of terminating logic programs
– Naish
- 1992
|
|
17
|
Proving termination of input-consuming logic programs
– Smaus
- 1999
|
|
14
|
Two problems -- two solutions: One system -- ECLiPSe
– Wallace, Veron
- 1993
|
|
13
|
Modes and Types in Logic Programming
– Smaus
- 1999
|
|
13
|
Termination of logic programs with block declarations running in several modes
– Smaus, Hill, et al.
- 1998
|
|
9
|
Properties of input-consuming derivations
– Bossi, Etalle, et al.
- 1999
|
|
4
|
Correctness of uni without occur check in Prolog
– Chadha, Plaisted
- 1991
|
|
4
|
Moded GHC and its message-oriented implementation technique
– Ueda, Morita
- 1994
|
