438 search results - page 38 / 88 » On theorem proving in annotated logics |
SIAMCOMP
2008
14 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...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
EUC
2005
Springer
15 years 3 months ago
2005
Springer
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
89
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
80
Voted
TIME
2008
IEEE
15 years 4 months ago
2008
IEEE
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...