{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T11:10:23Z","timestamp":1688037023473},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10601-013-9141-7","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T06:14:11Z","timestamp":1360563251000},"page":"144-165","source":"Crossref","is-referenced-by-count":0,"title":["Formulating the template ILP consistency problem as a constraint satisfaction problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radom\u00edr","family":"\u010cernoch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"key":"9141_CR1","doi-asserted-by":"crossref","unstructured":"Alphonse, E., & Osmani, A. (2009). Empirical study of relational learning algorithms in the phase transition framework. In Machine learning and knowledge discovery in databases (pp. 51\u201366).","DOI":"10.1007\/978-3-642-04180-8_21"},{"key":"9141_CR2","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems. Kluwer Academic Publishers."},{"issue":"5439","key":"9141_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., & R\u00e9ka, A. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"},{"key":"9141_CR4","unstructured":"Bart\u00e1k, R. (2010). Constraint models for reasoning on unification in inductive logic programming. In Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 2010) (pp.\u00a0101\u2013110). Springer Verlag."},{"key":"9141_CR5","unstructured":"Bart\u00e1k, R., Ku\u017eelka,O., \u017delezn\u00fd, F. (2010). Using constraint satisfaction for learning hypotheses in inductive logic programming. In Proceedings of the 23rd international Florida AI Research Society conference (FLAIRS 2010) (pp.\u00a0440\u2013441). AAAI Press."},{"key":"9141_CR6","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., & Monfroy, E. (2002). Beyond NP: Arc-Consistency for quantified constraints. In Principles and practice of Constraint Programming\u2014CP 2002 (pp.\u00a017\u201332). Springer Verlag.","DOI":"10.1007\/3-540-46135-3_25"},{"key":"9141_CR7","unstructured":"Botta, M. Challenging relational learning\u2014dipartimento di informatica\u2014universit\u00e0 di torino. http:\/\/www.di.unito.it\/~mluser\/challenge\/index.html . Accessed 6 February 2013."},{"key":"9141_CR8","unstructured":"Carlsson, M., & Beldiceanu, N. (2002). Arc-Consistency for a chain of lexicographic ordering constraints. http:\/\/soda.swedish-ict.se\/2267 . Accessed 6 February 2013."},{"key":"9141_CR9","doi-asserted-by":"crossref","unstructured":"Chovanec, A., & Bart\u00e1k, R. (2011). On generating templates for hypothesis in inductive logic programming. In Advances in artificial intelligence (proceedings of 10th Mexican International Conference on Artificial Intelligence (MICAI 2011), Part 1 (pp.\u00a0162\u2013173). Springer Verlag","DOI":"10.1007\/978-3-642-25324-9_14"},{"key":"9141_CR10","unstructured":"Dechter, R. (2003). Constraint processing. Morgan Kaufmann Publishers Inc."},{"key":"9141_CR11","doi-asserted-by":"crossref","unstructured":"D\u017eeroski, S., & Lavra\u010d, N. (2001). Relational data mining. Springer Verlag.","DOI":"10.1007\/978-3-662-04599-2"},{"key":"9141_CR12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., & R\u00e9nyi, A. (1959). On the evolution of random graphs. Publicationes Mathematicae, 6, 290\u2014297.","journal-title":"Publicationes Mathematicae"},{"key":"9141_CR13","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-Completeness. W.\u00a0H. Freeman & Co."},{"key":"9141_CR14","unstructured":"Giunchiglia, F., & Sebastiani, R. (1996). Building decision procedures for modal logics from propositional decision procedures\u2014the case study of modal K(m). In CADE13: Proceedings of 13th international conference on automated deduction (pp.\u00a0583\u2013597). Springer Verlag."},{"issue":"1","key":"9141_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF03037582","volume":"17","author":"G Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Scarcello, F. (1999). On the complexity of some inductive logic programming problems. New Generation Computing, 17(1), 53\u201375.","journal-title":"New Generation Computing"},{"key":"9141_CR16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/267460.267468","volume-title":"COLT \u201997: Proceedings of the 10th annual conference on computational learning theory","author":"T Horv\u00e1th","year":"1997","unstructured":"Horv\u00e1th, T., Sloan, R.H., Tur\u00e1n, G. (1997). Learning logic programs by using the product homomorphism method. In COLT \u201997: Proceedings of the 10th annual conference on computational learning theory (pp.\u00a010\u201320). New York, NY: ACM."},{"key":"9141_CR17","unstructured":"Landwehr, N., Kersting, K., De\u00a0Raedt, L. (2005). nFOIL: Integrating naive bayes and FOIL. In Proceedings of the 20th national conference on Artificial intelligence\u2014Volume 2 (pp.\u00a0795\u2013800). AAAI Press."},{"issue":"2","key":"9141_CR18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/B:MACH.0000023150.80092.40","volume":"55","author":"J Maloberti","year":"2004","unstructured":"Maloberti, J., & Sebag, M. (2004). Fast Theta-Subsumption with constraint satisfaction algorithms. Machine Learning, 55(2), 137\u2013174.","journal-title":"Machine Learning"},{"issue":"20","key":"9141_CR19","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: theory and methods. Journal of Logic Programming, 19(20), 629\u2013679.","journal-title":"Journal of Logic Programming"},{"key":"9141_CR20","first-page":"153","volume":"5","author":"G Plotkin","year":"1970","unstructured":"Plotkin, G., Meltzer, B., Michie, D. (1970). A note on inductive generalization. Machine Intelligence, 5, 153\u2013163.","journal-title":"Machine Intelligence"},{"key":"9141_CR21","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E.C. (1994). Contradicting conventional wisdom in constraint satisfaction. Principles and practice of constraint programming (pp.\u00a0162\u2013173). Springer Verlag.","DOI":"10.1007\/3-540-58601-6_86"},{"key":"9141_CR22","unstructured":"Srinivasan, A. Aleph manual. http:\/\/www.comlab.ox.ac.uk\/activities\/machinelearning\/Aleph . Accessed 6 February 2013."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9141-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-013-9141-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-013-9141-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T10:46:47Z","timestamp":1688035607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-013-9141-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9141"],"URL":"https:\/\/doi.org\/10.1007\/s10601-013-9141-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}