Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Maintaining knowledge about temporal intervals
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
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
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
Dependency calculus reasoning in a general point relation algebra
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Reasoning in complex systems of dependencies is important in our highly connected world, e. g. for logistics planning, and for the analysis of communication schemes and social networks. Directed graphs are often used to describe scenarios with links or dependencies. However, they do not reflect uncertainties. Further, hardly any formal method for reasoning about such systems is in use. As it is hard to quantify dependencies, calculi for qualitative reasoning (QR) are a natural choice to fill this gap. However, QR is so far concentrated on spatial and temporal issues. A first approach is the dependency calculus DC for causal relations [15], but it cannot describe situations in which cycles might occur within a graph. In this paper, refinements of DC meeting all requirements to describe dependencies on networks are investigated with respect to satisfiability problems, construction problems, and tractable subclassses.