ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

From LP to LP: Programming with Constraints.

Jean-Louis Lassez: From LP to LP: Programming with Constraints. DBPL 1991: 257-283
@inproceedings{DBLP:conf/dbpl/Lassez91,
  author    = {Jean-Louis Lassez},
  editor    = {Paris C. Kanellakis and
               Joachim W. Schmidt},
  title     = {From LP to LP: Programming with Constraints},
  booktitle = {Database Programming Languages: Bulk Types and Persistent Data.
               3rd International Workshop, August 27-30, 1991, Nafplion, Greece,
               Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1991},
  isbn      = {1-55860-242-9},
  pages     = {257-283},
  ee        = {db/conf/dbpl/Lassez91.html},
  crossref  = {DBLP:conf/dbpl/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 5, SSDBM, DBPL, KRDB, ADBIS, COOPIS, SIGBDP" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

References

[1]
Kô Sakai, Akira Aiba: CAL: A Theoretical Background of Constraint Logic Programming and its Applications. J. Symb. Comput. 8(6): 589-603(1989) BibTeX
[2]
...
[3]
Dennis S. Arnon: Towards a Deductive Database for Elementary Algebra and Geometry. Workshop on Deductive Databases 1990: 0- BibTeX
[4]
...
[5]
...
[6]
...
[7]
Alan Borning: The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory. ACM Trans. Program. Lang. Syst. 3(4): 353-387(1981) BibTeX
[8]
...
[9]
Bruno Buchberger: History and Basic Features of the Critical-Pair/Completion Procedure. J. Symb. Comput. 3(1/2): 3-38(1987) BibTeX
[10]
...
[11]
...
[12]
...
[13]
...
[14]
...
[15]
...
[16]
...
[17]
...
[18]
James H. Davenport, Joos Heintz: Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5(1/2): 29-35(1988) BibTeX
[19]
...
[20]
Ernest Davis: Constraint Propagation with Interval Labels. Artif. Intell. 32(3): 281-331(1987) BibTeX
[21]
...
[22]
...
[23]
Jean H. Gallier, Stan Raatz: Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4(2): 119-155(1987) BibTeX
[24]
...
[25]
...
[26]
Nevin Heintze, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap: On Meta-Programming in CLR(R). NACLP 1989: 52-66 BibTeX
[27]
...
[28]
Richard Helm, Kim Marriott, Martin Odersky: Constraint-Based Query Optimization for Spatial Databases. PODS 1991: 181-191 BibTeX
[29]
...
[30]
Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Reasoning About Linear Constraints Using Parametric Queries. FSTTCS 1990: 1-20 BibTeX
[31]
Tien Huynh, Catherine Lassez, Jean-Louis Lassez: Fourier Algorithm Revisited. ALP 1990: 117-131 BibTeX
[32]
...
[33]
Joxan Jaffar, Jean-Louis Lassez: Constraint Logic Programming. POPL 1987: 111-119 BibTeX
[34]
Joxan Jaffar, Jean-Louis Lassez: From Unification to Constraints. LP 1987: 1-18 BibTeX
[35]
Joxan Jaffar, Spiro Michaylov: Methodology and Implementation of a CLP System. ICLP 1987: 196-218 BibTeX
[36]
...
[37]
...
[38]
...
[39]
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. PODS 1990: 299-313 BibTeX
[40]
...
[41]
...
[42]
...
[43]
Jean-Louis Lassez: Querying Constraints. PODS 1990: 288-298 BibTeX
[44]
Jean-Louis Lassez, Tien Huynh, Ken McAloon: Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51 BibTeX
[45]
Jean-Louis Lassez, Michael J. Maher: On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reasoning 9(3): 373-379(1992) BibTeX
[46]
Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Unification Revisited. Foundations of Deductive Databases and Logic Programming. 1988: 587-625 BibTeX
[47]
Jean-Louis Lassez, Ken McAloon: A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13(1): 1-24(1992) BibTeX
[48]
Jean-Louis Lassez, Ken McAloon: A Constraint Sequent Calculus. LICS 1990: 52-61 BibTeX
[49]
Michael J. Maher: Logic Semantics for a Class of Committed-Choice Programs. ICLP 1987: 858-876 BibTeX
[50]
Michael J. Maher, Peter J. Stuckey: Expanding Query Power in Constraint Logic Programming Languages. NACLP 1989: 20-36 BibTeX
[51]
Kim Marriott, Martin Odersky: Negative Boolean Constraints. Theor. Comput. Sci. 160(1&2): 365-380(1996) BibTeX
[52]
...
[53]
Judea Pearl: Embracing Causality in Default Reasoning. Artif. Intell. 35(2): 259-271(1988) BibTeX
[54]
...
[55]
...
[56]
...
[57]
...
[58]
Robert E. Shostak: On the SUP-INF Method for Proving Presburger Formulas. J. ACM 24(4): 529-543(1977) BibTeX
[59]
...
[60]
...
[61]
...
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
DBLP-3, 1991 Proceedings: Copyright © by Morgan Kaufmann Publishers, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:05:57 2009