{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:35:38Z","timestamp":1742967338318,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030802226"},{"type":"electronic","value":"9783030802233"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_14","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"207-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MCP: Capturing Big Data by Satisfiability (Tool Description)"],"prefix":"10.1007","author":[{"given":"Miki","family":"Hermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gernot","family":"Salzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"issue":"2\u20133","key":"14_CR1","first-page":"147","volume":"9","author":"D Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Mach. Learn. 9(2\u20133), 147\u2013164 (1992)","journal-title":"Mach. Learn."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01187059","volume":"143","author":"KA Baker","year":"1975","unstructured":"Baker, K.A., Pixley, A.F.: Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Mathematische Zeitschrift 143(2), 165\u2013174 (1975)","journal-title":"Mathematische Zeitschrift"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: post\u2019s lattice with applications to complexity theory. SIGACT News 34(4), 38\u201352 (2003)","journal-title":"SIGACT News"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/970831.970840","volume":"35","author":"E B\u00f6hler","year":"2004","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: constraint satisfaction problems. SIGACT News 35(1), 22\u201335 (2004)","journal-title":"SIGACT News"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-011-0916-1","volume":"188","author":"E Boros","year":"2011","unstructured":"Boros, E., Crama, Y., Hammer, P.L., Ibaraki, T., Kogan, A., Makino, K.: Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1), 33\u201361 (2011)","journal-title":"Ann. Oper. Res."},{"key":"14_CR6","unstructured":"Butenhof, D.R.: Programming with POSIX threads. Addison-Wesley, Boston (1997)"},{"issue":"8","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1007\/s10489-017-1080-3","volume":"48","author":"A Chambon","year":"2017","unstructured":"Chambon, A., Boureau, T., Lardeux, F., Saubion, F.: Logical characterization of groups of data: a comparative study. Appl. Intell. 48(8), 2284\u20132303 (2017). https:\/\/doi.org\/10.1007\/s10489-017-1080-3","journal-title":"Appl. Intell."},{"key":"14_CR8","unstructured":"Chambon, A., Lardeux, F., Saubion, F., Boureau, T.: Computing sets of patterns for logical analysis of data. Technical Report, Universit\u00e9 d\u2019Angers (2017)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Crama, Y., Hammer, P.L.: Boolean Functions - Theory, Algorithms, and Applications, Encyclopedia of Mathematics and its Applications, vol.\u00a0142. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511852008"},{"key":"14_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H, Freeman and Co (1979)"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/050635900","volume":"38","author":"A Gil","year":"2008","unstructured":"Gil, A., Hermann, M., Salzer, G., Zanuttini, B.: Efficient algorithms for constraint description problems over finite totally ordered domains. SIAM J. Comput. 38(3), 922\u2013945 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.jcss.2009.05.004","volume":"76","author":"P H\u00e1jek","year":"2010","unstructured":"H\u00e1jek, P., Holena, M., Rauch, J.: The GUHA method and its meaning for data mining. J. Comput. Syst. Sci. 76(1), 34\u201348 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2003.06.001","volume":"88","author":"JJ H\u00e9brard","year":"2003","unstructured":"H\u00e9brard, J.J., Zanuttini, B.: An efficient algorithm for horn description. Inf. Proc. Lett. 88(4), 177\u2013182 (2003)","journal-title":"Inf. Proc. Lett."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"H\u00e1jek, P., Havr\u00e1nek, T.: Mechanizing Hypothesis Formation. Springer, Berlin (1978) https:\/\/doi.org\/10.1007\/978-3-642-66943-9","DOI":"10.1007\/978-3-642-66943-9"},{"key":"14_CR15","unstructured":"Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI: The Complete Reference. MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T09:40:56Z","timestamp":1672652456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}