Space-contained conflict revision, for geographic information
| dc.creator | Doukari, Omar | |
| dc.creator | Jeansoulin, Robert | |
| dc.date | 2007-03-26 | |
| dc.date.accessioned | 2026-07-07T07:53:48Z | |
| dc.date.available | 2026-07-07T07:53:48Z | |
| dc.description | 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. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0703130 | |
| dc.identifier | http://arxiv.org/abs/cs/0703130 | |
| dc.identifier | Proc. of 10th AGILE International Conference on Geographic Information Science, AGILE 2007. (07/05/2007) 1-14 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/126359 | |
| dc.subject | Artificial Intelligence | |
| dc.title | Space-contained conflict revision, for geographic information | |
| dc.type | text |