1078 search results - page 140 / 216 » The Modal Logic of Probability |
121
Voted
SI3D
2003
ACM
15 years 9 months ago
2003
ACM
Numerous real-time applications such computer games or flight simulators require non-repetitive high-resolution texturing on large landscapes. We propose an algorithm which proce...
114
click to vote
DOCENG
2009
ACM
15 years 10 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
130
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
141
click to vote
FROCOS
2007
Springer
15 years 7 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
118
click to vote
AAAI
1994
15 years 5 months ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...