Skip to main content
SpringerLink
Log in

Automatic Generation of Propagation Rules for Finite Domains

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming – CP 2000 (CP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1894))

Abstract

A general approach to specify the propagation and simplification process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over finite domains defined extensionally by e.g. a truth table or their tuples. Using our algorithm, the user has the possibility to specify the admissible syntactic forms of the rules. The generated rules will be implemented as rules of the language Constraint Handling Rules (CHR).

Furthermore, we show that our approach performs well on various examples, including Boolean constraints, three valued logic, Allen’s qualitative approach to temporal logic and qualitative spatial reasoning with the Region Connection Calculus.

The research reported in this paper has been supported by the Bavarian-French Hochschulzentrum.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Constraint Handling Rules Online, http://www.pms.informatik.uni-muenchen.de/~webchr/

  2. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP’97, LNCS 1330. Springer-Verlag, Nov. 1997.

    Chapter  Google Scholar 

  3. S. Abdennadher and T. Frühwirth. Operational equivalence of CHR programs and constraints. In 5th International Conference on Principles and Practice of Constraint Programming, CP’99, LNCS 1713. Springer-Verlag, 1999.

    Google Scholar 

  4. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207–216. ACM Press, 1993.

    Google Scholar 

  5. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of ACM, 26(11):832–843, 1983.

    Article  MATH  Google Scholar 

  6. K. Apt and E. Monfroy. Automatic generation of constraint propagation algorithms for small finite domains. In 5th International Conference on Principles and Practice of Constraint Programming, CP’99, LNCS 1713. Springer-Verlag, 1999.

    Google Scholar 

  7. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proceedings of the 15th International Conference on Data Engineering, pages 188–197. IEEE Computer Society, 1999.

    Google Scholar 

  8. T. Frühwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 37(1–3):95–138, October 1998.

    Google Scholar 

  9. C. Kirchner, H. Kirchner, and M. Vittek. Implementing computational systems with constraints. In Proceedings of the First Workshop on Principles and Practice of Constraints Programming. MIT Press, Apr. 1993.

    Google Scholar 

  10. H. Kirchner and C. Ringeissen. A constraint solver in finite algebras and its combination with unification algorithms. In Proc. Joint International Conference and Symposium on Logic Programming, pages 225–239. MIT Press, 1992.

    Google Scholar 

  11. S. Kleene. Introduction to Metamathematics. Van Nostrand, Princeton, New Jersey, 1950.

    Google Scholar 

  12. S. Muggleton and L. De Raedt. Inductive Logic Programming: theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.

    Article  MathSciNet  Google Scholar 

  13. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25–46, 1999.

    Article  Google Scholar 

  14. G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153–163. Edinburgh University Press, 1970.

    MathSciNet  Google Scholar 

  15. D. A. Randell, Z. Cui, and A. G. Cohn. A spatial logic based on regions and connection. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 165–176, Cambridge, MA, Oct. 1992. Morgan Kaufmann.

    Google Scholar 

  16. C. Ringeissen. Etude et implantation d’un algorithme d’unification dans les algèbres finies. Rapport de DEA, Université de Nancy I, 1990.

    Google Scholar 

  17. C. Ringeissen and E. Monfroy. Generating propagation rules for finite domains via unification in finite algebra. In ERCIM Working Group on Constraints / CompulogNet Area on Constraint Programming Workshop, 1999.

    Google Scholar 

  18. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping of discovered association rules. In Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 47–52, Apr. 1995.

    Google Scholar 

  19. P. van Hentenryck. Constraint logic programming. The Knowledge Engineering Review, 6, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Munich, Oettingenstr. 67, 80538, München, Germany

    Slim Abdennadher

  2. Laboratoire d’Ingénierie des Systèmes d’Information, Bâtiment 501, INSA Lyon, 69621, Villeurbanne Cedex, France

    Christophe Rigotti

Authors
  1. Slim Abdennadher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Rigotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdennadher, S., Rigotti, C. (2000). Automatic Generation of Propagation Rules for Finite Domains. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation