Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Achmanov, Programmation Linécire, Editions Mir, Moscou 1984.
J.B.J. Fourier, reported in: Analyse des travaux de l'Académie Royale des Sciences, pendant l'année 1824, Partie Mathématique, Histoire de l'Académie Royale des Sciences de l'Institut de France 7 (1827) xlvii–lv. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on his work on Linear Inequalities, Opsearch 10(1973) 38–42.)
T. Huynh and J-L. Lassez, “Practical Issues on the Projection of Polyhedral Sets,” IBM Research Report, T.J. Watson Research Center, 1990.
T. Huynh, C. Lassez and J-L. Lassez, “Fourier Algorithm Revisited,” 2nd International Conference on Algebraic and Logic Programming, Springer-Verlag Lecture Notes in Computer Sciences, 1990.
L. Joskowicz, “Reasoning about the Kinematics of Mechanical Devices,” International Journal of Artificial Intelligence in Engineering, Vol 4 No. 1, 1989.
L. Joskowicz, “Simplification and Abstraction of Kinematic Behaviors,” Proceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, 1989.
L. Joskowicz and E. Sacks, “Incremental Kinematic Analysis of Machines,” forthcoming, 1990.
P. Kanellakis, G. Kuper and P. Revesz, “Constraint Query Languages,” PODS 90, Nashville.
J-L Lassez, “Parametric Queries, Linear Constraints and Variable Elimination,” DISCO 90, Springer-Verlag Lecture Notes in Computer Sciences, 1990.
J-L. Lassez, T. Huynh and K. McAloon, “Simplification and Elimination of Redundant Arithmetic Constraints,” Proceedings of NACLP 89, MIT Press.
J-L. Lassez and M.J. Maher, “On Fourier's Algorithm for Linear Arithmetic Constraints,” IBM Research Report, T.J. Watson Research Center, 1988.
J-L. Lassez and K. McAloon, “Applications of a Canonical Form for Generalized Linear Constraints,” Proceedings of the FGCS Conference, Tokyo, December 1988, 703–710.
J-L. Lassez and K. McAloon, “A Canonical Form for Generalized Linear Constraints,” IBM Research Report, T.J. Watson Research Center, 1989.
J-L. Lassez and K. McAloon, “Independence of Negative Constraints,” TAPSOFT 89, Advanced Seminar on Foundations of Innovative Software Development, LNCS 351 Springer Verlag 89.
J-L Lassez, K. McAloon, “A Constraint Sequent Calculus,” LICS 90. Philadelphia.
T. Lozano-Pérez, and M. Wesley, “An algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,” Communications of the ACM, Vol. 22, 1979.
M. Maher, “A Logic Semantics for a class of Committed Choice Languages,” Proceedings of ICLP4, MIT Press, 1987.
V. Saraswat, “Concurrent Constraint Logic Programming,” MIT Press, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huynh, T., Joskowicz, L., Lassez, C., Lassez, JL. (1990). Reasoning about linear constraints using parametric queries. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive