2152 search results - page 291 / 431 » On Automating the Calculus of Relations |
163
click to vote
TFM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Teaching formal methods is a challenging task for several reasons. First, both the state-of-the-art knowledge and the tools are rapidly evolving. Second, there are no com...
153
click to vote
WDAG
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
200
click to vote
ECSQARU
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...
134
click to vote
RR
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we discuss the draft OWL 2 RL profile from the perspective of applying the constituent rules over Web data. In particular, borrowing from previous work, we discuss ...
159
click to vote
TARK
2009
Springer
16 years 27 days ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...