Results 1 
7 of
7
Dynamo  A Language for Dynamic Logic Programming
, 1998
"... We describe a Haskell [4, 6] prototype implementation of dynamo, a simple language for dynamic logic programming. 1 Dynamic Logic Programming Dynamic logic programming was introduced in Van Eijck [2]. This paper describes a first implementation of dynamo, a language for pure dynamic logic programmi ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We describe a Haskell [4, 6] prototype implementation of dynamo, a simple language for dynamic logic programming. 1 Dynamic Logic Programming Dynamic logic programming was introduced in Van Eijck [2]. This paper describes a first implementation of dynamo, a language for pure dynamic logic programming. The dynamo language implements the executable process interpretation of Dynamic Predicate Logic or DPL [3], augmented with constructs for bounded iteration and bounded choice, as described in [2]. The two main sources of inspiration for dynamo are DPL and Alma0, a hybrid language for imperative programming mixed with logic programming developed by Apt c.s. [1]. The dynamo language demonstrates that dynamic interpretation of FOL can be used as guideline for dynamic logic programming. dynamo programs have a purely declarative dynamic semantics. There are no side effects, and no control features: dynamo is pure dynamic logic. Because of this logical purity, weakest precondition reasoning f...
Powering Decision Machines With Dynamo
, 1999
"... Contents 1 Dynamic Logic Programming 2 2 Modelling Variable Assignment in Dynamo 3 3 Translating Dynamo into Standard FOL 3 4 Recursion in Dynamo 4 5 Decision Machines for Propositional Logic 5 6 Decision Machines for Modal Logic 8 7 Conclusion 9 1 1 Dynamic Logic Programming Dynamic logic progra ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Contents 1 Dynamic Logic Programming 2 2 Modelling Variable Assignment in Dynamo 3 3 Translating Dynamo into Standard FOL 3 4 Recursion in Dynamo 4 5 Decision Machines for Propositional Logic 5 6 Decision Machines for Modal Logic 8 7 Conclusion 9 1 1 Dynamic Logic Programming Dynamic logic programming is the result of making dynamic versions of rst order predicate logic executable. The main sources of inspiration for this are the dynamic variable binding strategies that have become fashionable in natural language analysis (DRT [8], Anaphora Logic [2], DPL [7]), the idea of implementing identity assertions as assignment commands familiar from constraint programming, and more in particular from Alma0 [1], and the general injunction to explore logical dynamics emanating from the works of Johan van Benthem,, e.g. from [3]. The standard dynamic interpretation of FOL, where 9x is interpreted as the action of random assignment of a
Dynamo with Constraint Handling
, 1999
"... The paper gives a sketch of the executable process interpretation of first order logic that lies at the basis of the Dynamo programming language, and then takes on the task of improving its execution mechanism by means of constraint storage. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The paper gives a sketch of the executable process interpretation of first order logic that lies at the basis of the Dynamo programming language, and then takes on the task of improving its execution mechanism by means of constraint storage.
Computing with Dynamic First Order Logic
"... 6> fi agree on the values of all variables, except possibly on that of x. This relational perspective on meaning is then extended to conjunction and negation. Conjunction gets replaced by relational composition: Thanks to Krzysztof Apt, Johan van Benthem and Albert Visser for remarks that have s ..."
Abstract
 Add to MetaCart
6> fi agree on the values of all variables, except possibly on that of x. This relational perspective on meaning is then extended to conjunction and negation. Conjunction gets replaced by relational composition: Thanks to Krzysztof Apt, Johan van Benthem and Albert Visser for remarks that have substantially influenced the shape of this paper. Submitted for Proceedings of LLC8 D. BarkerPlummer, D. Beaver, J. van Benthem, P. Scotto di Luzio (eds.) Copyright c fl1999, CSLI Publications 1 2 / Jan van Eijck ff and fi are in the interpretation of A; B iff there is a variable assignment fl with (ff; fl) in the interpretation of A and (fl; fi) in the interpretation of B. Negation gets an interpretation as testforcontinuation: (ff;
Border Crossings
"... It is well established by now that computer science has a number of concerns in common with natural language understanding. Common themes show up in particular with algorithmic aspects of text processing. This chapter gives an overview of border crossings from NLP to CS and back. Starting out fro ..."
Abstract
 Add to MetaCart
(Show Context)
It is well established by now that computer science has a number of concerns in common with natural language understanding. Common themes show up in particular with algorithmic aspects of text processing. This chapter gives an overview of border crossings from NLP to CS and back. Starting out from syntactic analysis, we trace our route via a philosophical puzzle about meaning, Hoare correctness rules for dynamic semantics, error state analysis of presupposition, equational reasoning about state change, programming with frameworks originally devised for natural language semantics, and the logic of incremental processing.
Contents
"... This essay is an elaborated version of my last email to Johan van Benthem about using dynamic logic programming, more specifically, programs written in Dynamo, for building decision tools and reasoning about these tools. First we sketch the main features of dynamic logic programming, next we look at ..."
Abstract
 Add to MetaCart
(Show Context)
This essay is an elaborated version of my last email to Johan van Benthem about using dynamic logic programming, more specifically, programs written in Dynamo, for building decision tools and reasoning about these tools. First we sketch the main features of dynamic logic programming, next we look at the use of this new programming paradigm in the analysis of decidable logics, taking propositional logic and the modal