Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Qualitative Spatial Representation and Reasoning Techniques
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Using Orientation Information for Qualitative Spatial Reasoning
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
A spatial odyssey of the interval algebra: 1. directed intervals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Qualitative Spatial Reasoning with Conceptual Neighborhoods for Agent Control
Journal of Intelligent and Robotic Systems
| Hi-index | 0.00 |
Reasoning about complex dependencies between events is a crucial task. However, qualitative reasoning has so far concentrated on spatial and temporal issues. In contrast, we present a new dependency calculus (DC) that is created for specific questions of reasoning about causal relations and consequences. Applications in the field of spatial representation and reasoning are, for instance, modeling traffic networks, ecological systems, medical diagnostics, and Bayesian Networks. Several extensions of the fundamental linear point algebra have been investigated, for instance on trees or on nonlinear structures. DC is an improved generalization that meets all requirements to describe dependencies on networks. We investigate this structure with respect to satisfiability problems, construction problems, tractable subclassses, and embeddings into other relation algebras. Finally, we analyze the associated interval algebra on network structures.