Computing with dynamic first order logic
| Abstract | We de ne an executable process interpretation for dynamic rst order logic and show that it is a faithful approximation of a dynamic interpre tation procedure for rst order formulas familiar from natural language semantics extended with constructs for bounded choice and bounded it eration This new interpretation of extended dynamic FOL is inspired by an executable interpretation for standard FOL proposed by Apt and Bezem The relation to the Apt Bezem style execution process and the advantages of taking dynamic FOL rather than standard FOL as one s point of reference are discussed at some length Our results relate computational interpretation of FOL to a research tra dition from natural language semantics We discuss some example pro grams in Dynamo a simple language for dynamic logic programming based on the executable process interpretation for dynamic FOL.. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
|
| Through your library | Only published papers are available at libraries |
Alexander Bochman & Dov M. Gabbay (2012). Sequential Dynamic Logic. Journal of Logic, Language and Information 21 (3):279-298.
Marco Hollenberg (1997). An Equational Axiomatization of Dynamic Negation and Relational Composition. Journal of Logic, Language and Information 6 (4):381-401.
Jan van Eijck (2001). Incremental Dynamics. Journal of Logic, Language and Information 10 (3):319-351.
Jan Eijck & Fer-Jan Vries (1992). Dynamic Interpretation and HOARE Deduction. Journal of Logic, Language and Information 1 (1).
Martin Stokhof (1991). Dynamic Predicate Logic. Linguistics and Philosophy 14 (1):39 - 100.
Monthly downloads |
Added to index2009-01-28Total downloads7 ( #133,587 of 549,550 )Recent downloads (6 months)1 ( #63,397 of 549,550 )How can I increase my downloads? |

