Results 11  20
of
37
Formulas as Programs
, 1998
"... We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts
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...
Tableau Reasoning and Programming with Dynamic First Order Logic
, 2001
"... Dynamic First Order Logic (DFOL) results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Dynamic First Order Logic (DFOL) results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DFOL with explicit (simultaneous) binding, prove its soundness and completeness, and point out its relevance for programming with DFOL, for automated program analysis including loop invariant detection, and for semantics of natural language. Next, we extend this to an infinitary calculus for DFOL with iteration and connect up with other work in dynamic logic.
A Denotational Semantics for FirstOrder Logic
, 2000
"... . In Apt and Bezem [AB99] we provided a computational interpretation of firstorder formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for firstorder logic. Additionally, by allowing an assignment of a nonground term to a variable we i ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. In Apt and Bezem [AB99] we provided a computational interpretation of firstorder formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for firstorder logic. Additionally, by allowing an assignment of a nonground term to a variable we introduce in this framework logical variables. The semantics combines a number of wellknown ideas from the areas of semantics of imperative programming languages and logic programming. In the resulting computational view conjunction corresponds to sequential composition, disjunction to "don't know" nondeterminism, existential quantification to declaration of a local variable, and negation to the "negation as finite failure" rule. The soundness result shows correctness of the semantics with respect to the notion of truth. The proof resembles in some aspects the proof of the soundness of the SLDNFresolution. 1 Introduction Background To explain properly the motivation for the work ...
Turtle: A Constraint Imperative Programming Language
 In Proceedings of the Twentythird SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. Research and Development in Intelligent Systems XX
, 2003
"... Ideally, in constraint programs, the solutions of problems are obtained by specifying their desired properties, whereas in imperative programs, the steps which lead to a solution must be defined explicitly, rather than being derived automatically. This paper deals with the design and implementat ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Ideally, in constraint programs, the solutions of problems are obtained by specifying their desired properties, whereas in imperative programs, the steps which lead to a solution must be defined explicitly, rather than being derived automatically. This paper deals with the design and implementation of the programming language Turtle, which integrates declarative constraints and imperative language elements in order to form a more powerful programming paradigm suitable for solving a wide range of problems.
The Alma project, or how firstorder logic can help us in imperative programming
 Correct System Design, Lecture Notes in Computer Science 1710
, 1999
"... Abstract. The aim of the Alma project is the design of a strongly typed constraint programming language that combines the advantages of logic and imperative programming. The first stage of the project was the design and implementation of Alma0, a small programming language that provides a support f ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. The aim of the Alma project is the design of a strongly typed constraint programming language that combines the advantages of logic and imperative programming. The first stage of the project was the design and implementation of Alma0, a small programming language that provides a support for declarative programming within the imperative programming framework. It is obtained by extending a subset of Modula2 by a small number of features inspired by the logic programming paradigm. In this paper we discuss the rationale for the design of Alma0, the benefits of the resulting hybrid programming framework, and the current work on adding constraint processing capabilities to the language. In particular, we discuss the role of the logical and customary variables, the interaction between the constraint store and the program, and the need for lists. 1
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
Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma0
, 1998
"... The syntax and semantics of the programming language Alma0 have been specified in the ASF+SDF formalism. This report contains the interesting parts of the specification, embedded in text explaining its structure, various technical details and the choices that have been made during the specification ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The syntax and semantics of the programming language Alma0 have been specified in the ASF+SDF formalism. This report contains the interesting parts of the specification, embedded in text explaining its structure, various technical details and the choices that have been made during the specification process. The report also contains a short introduction to the language Alma0, including some examples of meaningful Alma0programs.
Firstorder logic as a constraint programming language
 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2514 of LNCS
"... Abstract. We provide a denotational semantics for firstorder logic that captures the twolevel view of the computation process typical for constraint programming. At one level we have the usual program execution. At the other level an automatic maintenance of the constraint store takes place. We pr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We provide a denotational semantics for firstorder logic that captures the twolevel view of the computation process typical for constraint programming. At one level we have the usual program execution. At the other level an automatic maintenance of the constraint store takes place. We prove that the resulting semantics is sound with respect to the truth definition. By instantiating it by specific forms of constraint management policies we obtain several sound evaluation policies of firstorder formulas. This semantics can also be used a basis for sound implementation of constraint maintenance in presence of block declarations and conditionals. 1
Theorem proving and programming with dynamic first order logic
, 2000
"... Dynamic First Order Logic results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DF ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Dynamic First Order Logic results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DFOL with explicit (simultaneous) substitution, prove its soundness and completeness, and point out its relevance for programming with dynamic first order logic, and for automatic program analysis.