Maintaining spatial relations in an incremental diagrammatic reasoner

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes an architecture for dynamically handling spatial relations in an incremental, nonmonotonic diagrammatic reasoning system. The architecture represents jointly exhaustive and pairwise disjoint (JEPD) spatial relation sets as nodes in a dependency network. These spatial relation sets include interval relations, relative orientation relations, and connectivity relations, but in theory could include any JEPD spatial relation sets. This network then caches dependencies between low-level spatial relations, allowing those relations to be easily assumed or retracted as visual elements are added or removed from a diagram. For example, in the architecture's Undo mechanism, the dependency network can quickly reactivate cached spatial relations when a previously-deleted element is restored. As part of this work, we describe how the system supports higher-level reasoning, including support for creating default assumptions. We also describe how this system was integrated with an existing drawing program and discuss its possible use in diagrammatic and geographic reasoning. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Ferguson, R. W., Bokor, J. L., Mappus IV, R. L., & Feldman, A. (2003). Maintaining spatial relations in an incremental diagrammatic reasoner. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2825, 136–150. https://doi.org/10.1007/978-3-540-39923-0_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free