Sciweavers

2273 search results - page 116 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
DLOG
2007
15 years 9 days ago
Inverse Roles Make Conjunctive Queries Hard
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
Carsten Lutz
PDPTA
2000
14 years 11 months ago
Managing Distributed Systems with Smart Subscriptions
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
Robert E. Filman, Diana D. Lee
AIPS
2009
14 years 11 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 10 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
NECO
2002
117views more  NECO 2002»
14 years 9 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille