Space-contained conflict revision, for geographic information

TL;DR

This paper proposes a logic-based approach for efficient geographic information conflict revision by introducing the containment conjecture, enabling tractable global revisions through local conflict resolution.

Contribution

It introduces the containment conjecture to determine when complete revision is feasible, enabling tractable conflict resolution in geographic information systems.

Findings

The containment conjecture limits conflict size, ensuring computational tractability.

The approach allows global revision through multiple local revisions.

Application example demonstrates practical effectiveness.

Abstract

Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but appears to be computational complex, and not tractable at all, most of the time. However, knowledge fusion or revision, is a common operation performed when users merge several different data sets in a unique decision making process, without much support. Introducing logics would be a great improvement, and we propose in this paper, means for deciding -a priori- if one application can benefit from a complete revision, under only the assumption of a conjecture that we name the "containment conjecture", which limits the size of the minimal conflicts to revise. We demonstrate that this conjecture brings us the interesting computational property of performing a not-provable but global, revision, made of many local revisions, at a tractable size. We illustrate this approach on an application.