2273 search results - page 328 / 455 » On the Expressiveness and Complexity of ATL |
TIME
1994
IEEE
15 years 2 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
ICLP
1993
Springer
15 years 2 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
ISN
1994
Springer
15 years 2 months ago
1994
Springer
There is a common unjustified belief that OSI management technology, despite being very powerful, is difficult to implement because of the complexity of the underlying service/prot...
STACS
1994
Springer
15 years 2 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
VLDB
1994
ACM
15 years 2 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...