{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:57Z","timestamp":1725488937261},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_14","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:32Z","timestamp":1186878332000},"page":"204-218","source":"Crossref","is-referenced-by-count":3,"title":["Axiomatization of Frequent Sets"],"prefix":"10.1007","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Paredaens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, 1993","DOI":"10.1145\/170035.170072"},{"key":"14_CR2","unstructured":"R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. VLDB, 1994"},{"key":"14_CR3","series-title":"Technical Report","volume-title":"A Theoretical Framework for Reasoning about Frequent Itemsets","author":"T. Calders","year":"2000","unstructured":"T. Calders, and J. Paredaens. A Theoretical Framework for Reasoning about Frequent Itemsets. Technical Report 006, Universiteit Antwerpen, Belgium, http:\/\/win-www.uia.ac.be\/u\/calders\/download\/axiom.ps , June 2000."},{"issue":"12","key":"14_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R. Fagin","year":"1990","unstructured":"R. Fagin, J. Halpern, and N. Megiddo. A Logic for Reasoning about Probabilities. In Information and Computation 87(1,2): 78\u2013128, 1990.","journal-title":"Information and Computation"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0020-0190(83)90005-4","volume":"16","author":"R. Fagin","year":"1983","unstructured":"R. Fagin, M. Y. Vardi. Armstrong Databases for Functional and Inclusion Dependencies. In IPL 16(1): 13\u201319, 1983.","journal-title":"IPL"},{"issue":"1-2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0004-3702(94)90079-5","volume":"69","author":"A. M. Frisch","year":"1994","unstructured":"A. M. Frisch, P. Haddawy. Anytime Deduction for Probabilistic Logic. In Artificial Intelligence 69(1-2): 93\u2013122, 1994.","journal-title":"Artificial Intelligence"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G. Georgakopoulos","year":"1988","unstructured":"G. Georgakopoulos, D. Kavvadias, and C. H. Papadimitriou. Probabilistic Satisfiability. In Journal of Complexity 4:1\u201311, 1988.","journal-title":"Journal of Complexity"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, 2000","DOI":"10.1145\/342009.335372"},{"key":"14_CR9","unstructured":"P. Hansen, B. Jaumard, G.-B. D. Nguets\u00e9, M. P. de Arag\u00e4o. Models and Algorithms for Probabilistic and Bayesian Logic. In Proc. IJCAI, 1995"},{"key":"14_CR10","unstructured":"P. Hansen, B. Jaumard. Probabilistic Satisfiability. Les Cahiers du GERAD G-96-31, 1996"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"L. V.S. Laksmanan, R.T. Ng, J. Han, and A. Pang. Optimization of Constrained Frequent Set Queries with 2-variable Constraints. Proc. ACM SIGMOD, 1999","DOI":"10.1145\/304182.304196"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N. Nilsson","year":"1986","unstructured":"N. Nilsson. Probabilistic Logic. In Artificial Intelligence 28: 71\u201387, 1986","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:39:41Z","timestamp":1556739581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}