Rule-aided constraint resolution in Laure

  • Yves Caseau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)

Abstract

This paper presents how deductive rules can be used as heuristics to guide constraint resolution. We describe the LAURE language, which allows the definition of constraints on order-sorted finite domains. We propose a semantic for integrating rules and constraints in an object-oriented model. An algorithm for constraint resolution is described, which can be integrated with rule propagation. An illustration of relevance to AI problems is given with examples such as scheduling.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AKG87]
    S. Abiteboul, P. Kanellakis, G. Grahne. On the Representation and Querying of Sets of Possible Worlds. Proc. of ACM SIGMOD, 1987.Google Scholar
  2. [AK89]
    S. Abiteboul, P. Kanellakis. Object Identity as a Query Language Primitive. Proc. ACM Conf. on Management of Data, 1989.Google Scholar
  3. [AP90]
    H. Ait-Kaci, A. Podelski. The Meaning of Life. PRL Research Report, DEC, 1990.Google Scholar
  4. [BBM89]
    A. Borgida, R. Brachman, D. McGuinness, L.A. Resnick. CLASSIC: A Structural Data Model for Objects. ACM SIGMOD International Conference on the Management of Data, Portland, June, 1989.Google Scholar
  5. [BMM89]
    A. Borning, M. Maher, A. Martindale' M. Wilson. Constraint Hierarchies and Logic Programming. Proc. of the Sixth International Logic Programming Conference, Lisbon, June 1989.Google Scholar
  6. [BR86]
    F. Bancilhon, F. Ramakrishnan. An Amateur's Introduction to Recursive Query Processing Strategies. Proceedings ACM SIGMOD Int. Conference on Management of Data, Washington, May 1986.Google Scholar
  7. [Ca89]
    Y. Caseau. A Formal System for Producing Demons from Rules. Proc. of DOOD89, Kyoto 1989.Google Scholar
  8. [Ca91a]
    Y. Caseau. A Deductive Object-Oriented Language. Annals of Mathematics and Artificial Intelligence, Special Issue on Deductive Databases, February 1991.Google Scholar
  9. [Ca91b]
    Y. Caseau. Abstract Interpretation of Constraints for Run-Time Optimizations. To appear in Proc. of the International Logic Programming Symposium, October 1991.Google Scholar
  10. [Ca91c]
    Y. Caseau. An Object-Oriented Language for Advanced Applications. Proc. of TOOLS USA'91, Santa-Barbara, July 1991.Google Scholar
  11. [CLP]
    N. Heintze, et al., Constraint Logic Programming: A Reader. 4th IEEE Symposium on Logic Programming, San Francisco, 1987.Google Scholar
  12. [CC77]
    P. Cousot, R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Constructions or Approximation of Fixpoints. Proc. Fourth ACM Symposium of Principles of Programming Languages, 1977.Google Scholar
  13. [DSVH87]
    M. Dincbas, H. Simonis, P. Van Hentenryck. Extending Equation Solving and Constraint Handling in Logic Programming. Colloquium on Resolution of Equation in Algebraic Structures, Austin, May 1987.Google Scholar
  14. [Don90]
    C. Dony. Exception Handling and Object-Oriented Programming: Towards a Synthesis. Proc of OOPSLA'90, Ottawa, 1990.Google Scholar
  15. [Fre90]
    B. Freeman-Benson. Kaleidoscope: Mixing Objects, Constraints, and Imperative Programming. Proc. of OOPLSLA'90, Ottawa, October 1990.Google Scholar
  16. [FSS91]
    B. Freytag, H. Schütz, G. Specht. LOLA — A Logic Language for Deductive Databases and its Implementation. Proc. of DASFAA'91, Tokyo, April 1991.Google Scholar
  17. [Fo82]
    C.L. Forgy. RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Matching Problem. Artificial Intelligence, no 19,1982.Google Scholar
  18. [G&al90]
    M. Ganti, P. Goyal, R. Nassif, P. Sunil. An Object-Oriented Development Environment. COMPCON, Feb 1990,.Google Scholar
  19. [GJ90]
    J. Graver, R. Johnson. A Type System for Smalltalk. Proc. of the 17th ACM Symposium on Principles of Programming Languages, San Francisco, 1990.Google Scholar
  20. [HS89]
    R. Hull, J. Su. Untyped Sets, Invention, and Computable Queries. Proceeding of PODS-89, Philadelphia, 1989.Google Scholar
  21. [IV89]
    T. Imielensky, K. Vadaparty. Complexity of Querying Databases with OR-Objects. Proceeding of PODS-89, Philadelphia, 1989.Google Scholar
  22. [KW89]
    M. Kifer, J. Wu. A logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited). Proceeding of PODS-89, Philadelphia, 1989.Google Scholar
  23. [KL89]
    M. Kifer, G. Lausen. F-Logic: A High-Order Language for Reasoning about Objects, Inheritance and Scheme. ACM SIGMOD Conf. on Management of Data, May 1989.Google Scholar
  24. [Ku85]
    G. M. Kuper. The Logical Data Model: A New Approach to Database Logic. PhD Dissertation, Stanford University, 1985.Google Scholar
  25. [McL81]
    B. J. MacLennan. Programming With A Relational Calculus. Rep n∘ NPS52-81-013, Naval Postgraduate School, September 1981.Google Scholar
  26. [MN88]
    P. Maes, D. Nardi. Meta-level Architecture and Reflection. Elsevier Science Publication (North Holland), 1988.Google Scholar
  27. [Ta55]
    A. Tarski. A Lattice Theoretical Fixpoint Theorem and its Application. Pacific Journal of Mathematics n∘ 5, 1955.Google Scholar
  28. [VD86]
    P. Van Hentenryck, M. Dincbas. Domains in Logic Programming. AAAI-86, Philadelphia, Aug. 1986.Google Scholar
  29. [VH89]
    P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, Cambridge, 1989.Google Scholar
  30. [Vi86]
    L. Vieille. Recursive Axioms in Deductive Databases: The Query/Subquery Approach. Proc. First Intl. Conference on Expert Database Systems, Charleston, 1986.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Yves Caseau
    • 1
  1. 1.BellcoreMorristownUSA

Personalised recommendations