Sciweavers

128 search results - page 10 / 26
» Game Characterizations of Process Equivalences
Sort
View
PODS
2004
ACM
98views Database» more  PODS 2004»
14 years 7 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
FOSSACS
2010
Springer
14 years 2 months ago
Retaining the Probabilities in Probabilistic Testing Theory
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
Sonja Georgievska, Suzana Andova
CONCUR
2011
Springer
12 years 7 months ago
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
Silvia Crafa, Francesco Ranzato
HCI
2009
13 years 5 months ago
Statistics-Based Cognitive Human-Robot Interfaces for Board Games - Let's Play!
Abstract. The archetype of many novel research activities is called cognition. Although separate definitions exist to define a technical cognitive system, it is typically character...
Frank Wallhoff, Alexander Bannat, Jürgen Gast...