20126 search results - page 91 / 4026 » Timed Transition Systems |
117
click to vote
DLOG
2009
15 years 1 months ago
2009
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
JEA
2006
15 years 3 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
114
click to vote
BCS
2008
15 years 4 months ago
2008
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
117
click to vote
EV
2006
15 years 4 months ago
2006
This paper draws attention to the need of a systematic approach to introducing electronic voting systems and presents empirical results from a pilot project by the Provincia Autono...
130
click to vote
KR
2000
Springer
15 years 6 months ago
2000
Springer
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...