343 search results - page 42 / 69 » Complete Axiomatizations for Reasoning About Knowledge and T... |
118
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
SPDP
1993
IEEE
15 years 1 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
SIVP
2008
14 years 9 months ago
2008
Abstract The effective management and exploitation of multimedia documents requires the extraction of the underlying semantics. Multimedia analysis algorithms can produce fairly ri...
TIME
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...