Spatial Information Revision: A Comparison between 3 Approaches

The present paper deals with spatial information revision in geographical information system (GIS). These systems use incomplete and uncertain information and inconsistency can result, therefore the definition of revision operations is required. Most of the proposed belief revision operations are characterized by a high complexity and since GIS use large amount of data, adjustments of existing strategies are necessary. Taking advantage of the specificity of spatial information allows to define heuristics which speed up the general algorithms. We illustrate some suitable adjustments on 3 approaches of revision: binary decision diagrams, preferred models and Reiter's algorithm for diagnostic. We formally compare them and we experiment them on a real application. In order to deal with huge amount of data we propose a divide and revise strategy in the case where inconsistencies are local.

[1]  Eric Würbel,et al.  Révision de connaissances géographiques , 2000 .

[2]  Michael J. Maher,et al.  Over-Constrained Systems , 1995, Lecture Notes in Computer Science.

[3]  Russell Greiner,et al.  A Correction to the Algorithm in Reiter's Theory of Diagnosis , 1989, Artif. Intell..

[4]  Odile Papini,et al.  Revision: an application in the framework of GIS , 2000, International Conference on Principles of Knowledge Representation and Reasoning.

[5]  Georg Gottlob,et al.  On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..

[6]  Renata Wassermann An Algorithm for Belief Revision , 2000, KR.

[7]  Fabrice Bouquet,et al.  Solving Over-Constrained CSPs Using Weighted OBDDs , 1995, Over-Constrained Systems.

[8]  Claudette Cayrol,et al.  Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models , 1996, ECAI.

[9]  Hirofumi Katsuno,et al.  Propositional Knowledge Base Revision and Minimal Change , 1991, Artif. Intell..

[10]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[11]  Odile Papini A Complete Revision Function in Propositional Calculus , 1992, ECAI.

[12]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[13]  Marco Schaerf,et al.  The Complexity of Model Checking for Belief Revision and Update , 1996, AAAI/IAAI, Vol. 1.

[14]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.