We address the problem of building intelligent query systems to reason about linear arithmetic constraints. The central issue is the development of tools for testing solvability, for constraints representation, for incremental updates and for intelligent feedback. The concept of parametric queries introduced in the context of constraint logic programming provides the starting point for this study. The relevance of this approach is illustrated by examples from the domain of spatial reasoning.
|Original language||American English|
|Title of host publication||Foundations of Software Technology and Theoretical Computer Science - 10th Conference, Proceedings|
|Editors||Kesav V. Nori, C.E. Veni Madhavan|
|Number of pages||20|
|State||Published - 1990|
|Event||10th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1990 - Bangalore, India|
Duration: 17 Dec 1990 → 19 Dec 1990
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||10th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1990|
|Period||17/12/90 → 19/12/90|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.