Sciweavers

764 search results - page 105 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
POPL
1997
ACM
15 years 4 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
DALT
2005
Springer
15 years 5 months ago
Beliefs in Agent Implementation
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
Laurens Winkelhagen, Mehdi Dastani, Jan Broersen
WAC
2004
Springer
150views Communications» more  WAC 2004»
15 years 5 months ago
A Systems Architecture for Sensor Networks Based On Hardware/Software Co-design
We describe the motivation and design of a novel embedded systems architecture for large networks of small devices, tha canonical example being wireless sensor networks. The archit...
Andy Nisbet, Simon Dobson
SEMWEB
2005
Springer
15 years 5 months ago
Preferential Reasoning on a Web of Trust
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir