dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

Querying Constraints.

Jean-Louis Lassez: Querying Constraints. PODS 1990: 288-298
@inproceedings{DBLP:conf/pods/Lassez90,
  author    = {Jean-Louis Lassez},
  editor    = {Daniel J. Rosenkrantz and
               Yehoshua Sagiv},
  title     = {Querying Constraints},
  booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on
               Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee,
               USA},
  publisher = {ACM Press},
  year      = {1990},
  isbn      = {0-89791-352-3},
  pages     = {288-298},
  ee        = {http://doi.acm.org/10.1145/298514.298581, db/conf/pods/Lassez90.html},
  crossref  = {DBLP:conf/pods/90},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The design of languages to tackle constraint satisfaction problems has a long history. Only more recently the reverse problem of introducing constraints as primitive constructs in programming languages has been addressed. A main task that the designers and implementers of such languages face is to use and adapt the concepts and algorithms from the extensive studies on constraints done in areas such as Mathematical Programming, Symbolic Computation, Artificial Intelligence, Program Verification and Computational Geometry. In this paper, we illustrate this task in a simple and yet important domain: linear arithmetic constraints. We show how one can design a querying system for sets of linear constraints by using basic concepts from logic programming and symbolic computation, as well as algorithms from linear programming and computational geometry. We conclude by reporting briefly on how notions of negation and canonical representation used in linear constraints can be generalized to account for cases in term algebras, symbolic computation, affine geometry, and elsewhere.

Copyright © 1990 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...

Printed Edition

Daniel J. Rosenkrantz, Yehoshua Sagiv (Eds.): Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA. ACM Press 1990, ISBN 0-89791-352-3
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Online Edition: ACM Digital Library


References

[A]
...
[DE]
...
[F]
...
[FRT]
...
[GT]
...
[HL]
...
[JL]
Joxan Jaffar, Jean-Louis Lassez: Constraint Logic Programming. POPL 1987: 111-119 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[JMSY]
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap: The CLP(R) Language and System. ACM Trans. Program. Lang. Syst. 14(3): 339-395(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[KKR]
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LHM]
Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LM]
Jean-Louis Lassez, Michael J. Maher: On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reasoning 9(3): 373-379(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LMM]
...
[LMc]
Jean-Louis Lassez, Ken McAloon: A Constraint Sequent Calculus. LICS 1990: 52-61 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LMc88]
Jean-Louis Lassez, Ken McAloon: Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS 1988: 703-710 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LMc89]
Jean-Louis Lassez, Ken McAloon: Independence of Negative Constraints. TAPSOFT, Vol.1 1989: 19-27 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[M]
Michael J. Maher: Logic Semantics for a Class of Committed-Choice Programs. ICLP 1987: 858-876 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[MR]
...
[S]
...

Last update Fri Sep 14 17:28:29 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page