R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A system of types and operators for handling vague spatial objects
International Journal of Geographical Information Science
An Ontology for Grounding Vague Geographic Terms
Proceedings of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008)
Supervaluation semantics for an inland water feature ontology
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
C-Phrase: A system for building robust natural language interfaces to databases
Data & Knowledge Engineering
| Hi-index | 0.00 |
While qualitative relations (e.g. RCC8 relations) can readily be derived from spatial databases, a more difficult matter is the representation of vague spatial relations such as 'near-to', 'next-to', 'between', etc. After surveying earlier approaches, this paper proposes a method that is tractable, learnable and directly suitable for use in natural language interfaces to spatial databases. The approach is based on definite logic programs with contexts represented as first class objects and supervaluation over a set of threshold parameters. Given an initial hand-built program with open threshold parameters, a polynomial-time algorithm finds a setting of threshold parameters that are consistent with a training corpus of vague descriptions of scenes. The results of this algorithm may then be compiled into view definitions which are accessed in real-time by natural language interfaces employing normal, non-exotic query answering mechanisms.