Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Reachability and Dependency Calculi: Reasoning in Network Algebras
verfasst von : Alexander Scivos
Erschienen in: Spatial Cognition V Reasoning, Action, Interaction
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
$\mathfrak{DC}$
for causal relations [15], but it cannot describe situations in which cycles might occur within a graph. In this paper, refinements of
$\mathfrak{DC}$
meeting all requirements to describe dependencies on networks are investigated with respect to satisfiability problems, construction problems, and tractable subclassses.