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.
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. Abiteboul, P. Kanellakis, G. Grahne. On the Representation and Querying of Sets of Possible Worlds. Proc. of ACM SIGMOD, 1987.
S. Abiteboul, P. Kanellakis. Object Identity as a Query Language Primitive. Proc. ACM Conf. on Management of Data, 1989.
H. Ait-Kaci, A. Podelski. The Meaning of Life. PRL Research Report, DEC, 1990.
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.
A. Borning, M. Maher, A. Martindale' M. Wilson. Constraint Hierarchies and Logic Programming. Proc. of the Sixth International Logic Programming Conference, Lisbon, June 1989.
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.
Y. Caseau. A Formal System for Producing Demons from Rules. Proc. of DOOD89, Kyoto 1989.
Y. Caseau. A Deductive Object-Oriented Language. Annals of Mathematics and Artificial Intelligence, Special Issue on Deductive Databases, February 1991.
Y. Caseau. Abstract Interpretation of Constraints for Run-Time Optimizations. To appear in Proc. of the International Logic Programming Symposium, October 1991.
Y. Caseau. An Object-Oriented Language for Advanced Applications. Proc. of TOOLS USA'91, Santa-Barbara, July 1991.
N. Heintze, et al., Constraint Logic Programming: A Reader. 4th IEEE Symposium on Logic Programming, San Francisco, 1987.
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.
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.
C. Dony. Exception Handling and Object-Oriented Programming: Towards a Synthesis. Proc of OOPSLA'90, Ottawa, 1990.
B. Freeman-Benson. Kaleidoscope: Mixing Objects, Constraints, and Imperative Programming. Proc. of OOPLSLA'90, Ottawa, October 1990.
B. Freytag, H. Schütz, G. Specht. LOLA — A Logic Language for Deductive Databases and its Implementation. Proc. of DASFAA'91, Tokyo, April 1991.
C.L. Forgy. RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Matching Problem. Artificial Intelligence, no 19,1982.
M. Ganti, P. Goyal, R. Nassif, P. Sunil. An Object-Oriented Development Environment. COMPCON, Feb 1990,.
J. Graver, R. Johnson. A Type System for Smalltalk. Proc. of the 17th ACM Symposium on Principles of Programming Languages, San Francisco, 1990.
R. Hull, J. Su. Untyped Sets, Invention, and Computable Queries. Proceeding of PODS-89, Philadelphia, 1989.
T. Imielensky, K. Vadaparty. Complexity of Querying Databases with OR-Objects. Proceeding of PODS-89, Philadelphia, 1989.
M. Kifer, J. Wu. A logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited). Proceeding of PODS-89, Philadelphia, 1989.
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.
G. M. Kuper. The Logical Data Model: A New Approach to Database Logic. PhD Dissertation, Stanford University, 1985.
B. J. MacLennan. Programming With A Relational Calculus. Rep n∘ NPS52-81-013, Naval Postgraduate School, September 1981.
P. Maes, D. Nardi. Meta-level Architecture and Reflection. Elsevier Science Publication (North Holland), 1988.
A. Tarski. A Lattice Theoretical Fixpoint Theorem and its Application. Pacific Journal of Mathematics n∘ 5, 1955.
P. Van Hentenryck, M. Dincbas. Domains in Logic Programming. AAAI-86, Philadelphia, Aug. 1986.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, Cambridge, 1989.
L. Vieille. Recursive Axioms in Deductive Databases: The Query/Subquery Approach. Proc. First Intl. Conference on Expert Database Systems, Charleston, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caseau, Y. (1991). Rule-aided constraint resolution in Laure. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013534
Download citation
DOI: https://doi.org/10.1007/BFb0013534
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive