92 search results - page 8 / 19 » Decidable Reasoning over Timestamped Conceptual Models |
QEST
2010
IEEE
13 years 4 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
FLAIRS
2003
13 years 8 months ago
2003
In this paper, we discuss a formalism for modeling regions that are exposed to movement or deformation. The basis of our formalism is the RCC theory, which uses topological relati...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
JELIA
2004
Springer
14 years 10 days ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...