Dynamo With Shift and Reduce
|
Abstract:
The paper gives a sketch of the executable process interpretation of first order logic that lies at the basis of the Dynamo programming language, indicates the connections with non-monotonic reasoning, and makes a proposal for an improvement of the execution process. 1 Dynamic Interpretation of FOL In Van Eijck [5, 3] an executable process interpretation for first order logic was proposed and shown to be a faithful approximation of the dynamic interpretation procedure for first order formulas familiar from natural language semantics (see Barwise [2], Groenendijk and Stokhof [6]), extended with constructs for bounded choice and bounded iteration. This gives rise to a paradigm of dynamic logic programming, combining imperative strenght with a declarative relational semantics that remains very close to first order logic. The [5] version of dynamic logic programming employs states consisting of triples (a; g a
Citations
| 282 | Dynamic Predicate Logic – Groenendijk, Stokhof - 1991 |
| 49 | Alma-0: An imperative language that supports declarative programming – Apt, Brunekreef, et al. - 1998 |
| 46 | Noun phrases, generalized quantifiers and anaphora – Barwise - 1987 |
| 7 | Programming with dynamic predicate logic – Eijck - 1998 |
| 5 | Dynamo --- a language for dynamic logic programming – Eijck - 1998 |
