Sciweavers

3446 search results - page 514 / 690
» A Reasoning Algorithm for pD*
Sort
View
LICS
2009
IEEE
15 years 11 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...
LICS
2009
IEEE
15 years 11 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
LICS
2009
IEEE
15 years 11 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
AI
2009
Springer
15 years 11 months ago
An Ontology-Based Spatial Clustering Selection System
Spatial clustering, which groups similar spatial objects into classes, is an important research topic in spatial data mining. Many spatial clustering methods have been developed re...
Wei Gu, Xin Wang, Danielle Ziébelin
WEBDB
2009
Springer
100views Database» more  WEBDB 2009»
15 years 11 months ago
Towards Well-Behaved Schema Evolution
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although sch...
Rada Chirkova, George H. L. Fletcher