Sciweavers

2386 search results - page 183 / 478
» Representing and Reasoning with Preferences
Sort
View
TARK
2009
Springer
16 years 1 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
LICS
2008
IEEE
16 years 28 days ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
CSL
2005
Springer
16 years 2 days ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
DALT
2005
Springer
16 years 2 days 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
ROBOCUP
2004
Springer
117views Robotics» more  ROBOCUP 2004»
15 years 12 months ago
Map-Based Multiple Model Tracking of a Moving Object
In this paper we propose an approach for tracking a moving target using Rao-Blackwellised particle filters. Such filters represent posteriors over the target location by a mixtur...
Cody C. T. Kwok, Dieter Fox