Probabilistic spatio-temporal knowledge bases: Capacity constraints, count queries, and consistency checking

We then consider a relevant kind of queries to reason on PST knowledge bases, namely count queries, which ask for how many objects are in a region at a certain time. We investigate semantics for answering count queries and study their computational complexity, when the knowledge base has capacity constraints and when there are no capacity constraints. We also show cases for which consistency checking can be exploited for query answering.