Sciweavers

979 search results - page 98 / 196
» Footprints in Local Reasoning
Sort
View
CSL
2008
Springer
13 years 12 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
ECAI
2008
Springer
13 years 12 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
SEBD
2007
121views Database» more  SEBD 2007»
13 years 11 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
AIPS
2006
13 years 11 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
NIPS
2004
13 years 11 months ago
Rate- and Phase-coded Autoassociative Memory
Areas of the brain involved in various forms of memory exhibit patterns of neural activity quite unlike those in canonical computational models. We show how to use well-founded Ba...
Máté Lengyel, Peter Dayan