{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:28Z","timestamp":1725486088247},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_4","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T20:54:55Z","timestamp":1181163295000},"page":"18-34","source":"Crossref","is-referenced-by-count":6,"title":["Automatic Generation of Propagation Rules for Finite Domains"],"prefix":"10.1007","author":[{"given":"Slim","family":"Abdennadher","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Rigotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"4_CR1","unstructured":"Constraint Handling Rules Online, http:\/\/www.pms.informatik.uni-muenchen.de\/~webchr\/"},{"key":"4_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017444","volume-title":"Third International Conference on Principles and Practice of Constraint Programming, CP\u201997","author":"S. Abdennadher","year":"1997","unstructured":"S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP\u201997, LNCS 1330. Springer-Verlag, Nov. 1997."},{"key":"4_CR3","series-title":"Lect Notes Comput Sci","volume-title":"5th International Conference on Principles and Practice of Constraint Programming, CP\u201999","author":"S. Abdennadher","year":"1999","unstructured":"S. Abdennadher and T. Fr\u00fchwirth. Operational equivalence of CHR programs and constraints. In 5th International Conference on Principles and Practice of Constraint Programming, CP\u201999, LNCS 1713. Springer-Verlag, 1999."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013216. ACM Press, 1993.","DOI":"10.1145\/170035.170072"},{"issue":"11","key":"4_CR5","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. F. Allen","year":"1983","unstructured":"J. F. Allen. Maintaining knowledge about temporal intervals. Communications of ACM, 26(11):832\u2013843, 1983.","journal-title":"Communications of ACM"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","volume-title":"5th International Conference on Principles and Practice of Constraint Programming, CP\u201999","author":"K. Apt","year":"1999","unstructured":"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\u201999, LNCS 1713. Springer-Verlag, 1999."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013197. IEEE Computer Society, 1999.","DOI":"10.1109\/ICDE.1999.754924"},{"issue":"1\u20133","key":"4_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"T. Fr\u00fchwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 37(1\u20133):95\u2013138, October 1998.","journal-title":"Journal of Logic Programming"},{"key":"4_CR9","unstructured":"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."},{"key":"4_CR10","unstructured":"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\u2013239. MIT Press, 1992."},{"key":"4_CR11","volume-title":"Introduction to Metamathematics","author":"S. Kleene","year":"1950","unstructured":"S. Kleene. Introduction to Metamathematics. Van Nostrand, Princeton, New Jersey, 1950."},{"issue":"20","key":"4_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt. Inductive Logic Programming: theory and methods. Journal of Logic Programming, 19,20:629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems"},{"key":"4_CR14","first-page":"153","volume":"5","author":"G. Plotkin","year":"1970","unstructured":"G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153\u2013163. Edinburgh University Press, 1970.","journal-title":"Machine Intelligence"},{"key":"4_CR15","unstructured":"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\u2013176, Cambridge, MA, Oct. 1992. Morgan Kaufmann."},{"key":"4_CR16","unstructured":"C. Ringeissen. Etude et implantation d\u2019un algorithme d\u2019unification dans les alg\u00e8bres finies. Rapport de DEA, Universit\u00e9 de Nancy I, 1990."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-44654-0_8"},{"key":"4_CR18","unstructured":"H. Toivonen, M. Klemettinen, P. Ronkainen, K. H\u00e4t\u00f6nen, 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\u201352, Apr. 1995."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"P. van Hentenryck. Constraint logic programming. The Knowledge Engineering Review, 6, 1991.","DOI":"10.1017\/S0269888900005798"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:40:55Z","timestamp":1556466055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}