Sciweavers

1059 search results - page 47 / 212
» Unification-Based Semantic Interpretation
Sort
View
AMAST
1998
Springer
15 years 4 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
LPKR
1997
Springer
15 years 4 months ago
Disjunctive Logic Programming and Autoepistemic Logic
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
Li-Yan Yuan, Jia-Huai You, Randy Goebel
CONNECTION
2004
93views more  CONNECTION 2004»
14 years 11 months ago
A real-time robotic model of human reference resolution using visual constraints
Evidence from recent psycholinguistic experiments suggests that humans resolve reference incrementally in the presence of constraining visual context. In this paper, we present an...
Matthias Scheutz, Kathleen M. Eberhard, Virgil And...
CORR
2006
Springer
121views Education» more  CORR 2006»
14 years 12 months ago
Elgot Algebras
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of El...
Jirí Adámek, Stefan Milius, Jiri Vel...
FOSSACS
2009
Springer
15 years 6 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...