1435 search results - page 270 / 287 » Description Logics |
SIAMCOMP
2008
13 years 9 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
INTERNET
2002
13 years 9 months ago
2002
of abstractions a middleware system makes available to applications, they figure prominently in determining the breadth and variety of application integration that the middleware s...
SPIN
2007
Springer
14 years 4 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
AI
2011
Springer
13 years 4 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...