171 search results - page 4 / 35 » What's Decidable about Sequences |
ECSQARU
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
KR
1998
Springer
13 years 11 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
VL
2006
IEEE
14 years 1 months ago
2006
IEEE
We have been working to uncover gender differences in the ways males and females problem solve in end-user programming situations, and have discovered differences in males’ vers...
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...