Sciweavers

71 search results - page 7 / 15
» Some Domain Theory and Denotational Semantics in Coq
Sort
View
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
SCAI
1993
13 years 8 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
JAIR
2006
110views more  JAIR 2006»
13 years 7 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
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
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Logic Column 15: Coalgebras and Their Logics
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
Alexander Kurz