2273 search results - page 283 / 455 » On the Expressiveness and Complexity of ATL |
176
click to vote
DBPL
1995
Springer
15 years 10 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
178
click to vote
CASES
2008
ACM
15 years 8 months ago
2008
ACM
fficient Programming Abstractions for Heterogeneous Multicore Systems on Chip Alastair D. Reid Krisztian Flautner Edmund Grimley-Evans ARM Ltd Yuan Lin University of Michigan The ...
216
click to vote
ISARCS
2010
15 years 8 months ago
2010
Voting is a critical component of any democratic process; and electronic voting systems should be developed following best practices for critical system development. E-voting has i...
166
click to vote
ICAI
2004
15 years 7 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
175
click to vote
DLOG
2001
15 years 7 months ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...