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 (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    7 ( #149,786 of 1,089,047 )

    Recent downloads (6 months)

    1 ( #69,722 of 1,089,047 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.