Sciweavers

60 search results - page 5 / 12
» Controlled Natural Language Can Replace First-Order Logic
Sort
View
ICTL
1994
13 years 12 months ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
13 years 12 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
Lindsey L. Spratt, Allen L. Ambler
JOLLI
2002
120views more  JOLLI 2002»
13 years 7 months ago
The Donkey and the Monoid. Dynamic Semantics with Control Elements
Dynamic Predicate Logic (DPL) is a variant of Predicate Logic introduced by Groenendijk en Stokhof. One rationale behind the indroduction of DPL is that it is closer to Natural La...
Albert Visser
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 7 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
POPL
2002
ACM
14 years 8 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...