343 search results - page 18 / 69 » Complete Axiomatizations for Reasoning About Knowledge and T... |
TARK
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
CVPR
2005
IEEE
14 years 2 months ago
2005
IEEE
This work presents a real-time system for multiple objects tracking in dynamic scenes. A unique characteristic of the system is its ability to cope with longduration and complete ...
IJCAI
1993
13 years 10 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...