{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:13Z","timestamp":1760597893772,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214616"},{"type":"electronic","value":"9783030214623"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_3","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:04:14Z","timestamp":1560452654000},"page":"32-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Implications from Data and from Queries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1497-4001","authenticated-orcid":false,"given":"Sergei","family":"Obiedkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2015.11.031","volume":"658","author":"K Adaricheva","year":"2017","unstructured":"Adaricheva, K., Nation, J.: Discovery of the D-basis in binary tables based on hypergraph dualization. Theor. Comput. Sci. 658, 307\u2013315 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR2","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"3_CR3","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":"3_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D Angluin","year":"1997","unstructured":"Angluin, D., Kriis, M., Sloan, R.H., Tur\u00e1n, G.: Malicious omissions and errors in answers to membership queries. Mach. Learn. 28(2), 211\u2013255 (1997)","journal-title":"Mach. Learn."},{"issue":"1","key":"3_CR5","first-page":"7","volume":"14","author":"D Angluin","year":"1994","unstructured":"Angluin, D., Slonim, D.K.: Randomly fallible teachers: learning monotone DNF with an incomplete membership oracle. Mach. Learn. 14(1), 7\u201326 (1994)","journal-title":"Mach. Learn."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10994-011-5248-5","volume":"85","author":"M Arias","year":"2011","unstructured":"Arias, M., Balc\u00e1zar, J.L.: Construction and learnability of canonical Horn formulas. Mach. Learn. 85(3), 273\u2013297 (2011)","journal-title":"Mach. Learn."},{"issue":"Part B","key":"3_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.tcs.2015.12.019","volume":"658","author":"M Arias","year":"2017","unstructured":"Arias, M., Balc\u00e1zar, J.L., T\u00eern\u0103uc\u0103, C.: Learning definite Horn formulas from closure queries. Theor. Comput. Sci. 658(Part B), 346\u2013356 (2017)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Baader, F., Ganter, B., Sertkaya, B., Sattler, U.: Completing description logic knowledge bases using formal concept analysis. In: Veloso, M.M. (ed.) Proceedings IJCAI 2007, pp. 230\u2013235. AAAI Press (2007)","key":"3_CR8","DOI":"10.25368\/2022.155"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.dam.2012.10.026","volume":"161","author":"MA Babin","year":"2013","unstructured":"Babin, M.A., Kuznetsov, S.O.: Computing premises of a minimal cover of functional dependencies is intractable. Discrete Appl. Math. 161(6), 742\u2013749 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"22","key":"3_CR10","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1016\/j.tcs.2009.12.021","volume":"411","author":"K Bertet","year":"2010","unstructured":"Bertet, K., Monjardet, B.: The multiple facets of the canonical direct unit implicational basis. Theor. Comput. Sci. 411(22), 2155\u20132166 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-59271-8_5","volume-title":"Formal Concept Analysis","author":"D Borchmann","year":"2017","unstructured":"Borchmann, D., Hanika, T., Obiedkov, S.: On the usability of probably approximately correct implication bases. In: Bertet, K., Borchmann, D., Cellier, P., Ferr\u00e9, S. (eds.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 72\u201388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_5"},{"doi-asserted-by":"crossref","unstructured":"Borchmann, D., Hanika, T., Obiedkov, S.: Probably approximately correct learning of Horn envelopes from queries. Discrete Appl. Math. (2019, in press)","key":"3_CR12","DOI":"10.1016\/j.dam.2019.02.036"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-11928-6_9","volume-title":"Formal Concept Analysis","author":"Felix Distel","year":"2010","unstructured":"Distel, F.: Hardness of enumerating pseudo-intents in the lectic order. In: Kwuida and Sertkaya [25], pp. 124\u2013137"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.dam.2010.12.004","volume":"159","author":"F Distel","year":"2011","unstructured":"Distel, F., Sertkaya, B.: On the complexity of enumerating pseudo-intents. Discrete Appl. Math. 159(6), 450\u2013466 (2011)","journal-title":"Discrete Appl. Math."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11928-6_22","volume-title":"Formal Concept Analysis","author":"Bernhard Ganter","year":"2010","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida and Sertkaya [25], pp. 312\u2013340"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49291-8","volume-title":"Conceptual Exploration","author":"B Ganter","year":"2016","unstructured":"Ganter, B., Obiedkov, S.: Conceptual Exploration. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49291-8"},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"95","key":"3_CR18","first-page":"5","volume":"24","author":"JL Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines 24(95), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-91379-7_10","volume-title":"Graph-Based Representation and Reasoning","author":"T Hanika","year":"2018","unstructured":"Hanika, T., Zumbr\u00e4gel, J.: Towards collaborative conceptual exploration. In: Chapman, P., Endres, D., Pernelle, N. (eds.) ICCS 2018. LNCS (LNAI), vol. 10872, pp. 120\u2013134. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91379-7_10"},{"unstructured":"J\u00e4schke, R., Rudolph, S.: Attribute exploration on the web. Preprint (2013). www.qucosa.de","key":"3_CR20"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H Kautz","year":"1995","unstructured":"Kautz, H., Kearns, M., Selman, B.: Horn approximations of empirical data. Artif. Intell. 74(1), 129\u2013145 (1995)","journal-title":"Artif. Intell."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1613\/jair.183","volume":"3","author":"R Khardon","year":"1995","unstructured":"Khardon, R.: Translating between Horn representations and their characteristic models. J. Artif. Intell. Res. (JAIR) 3, 349\u2013372 (1995)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45728-3_8","volume-title":"Pattern Detection and Discovery","author":"M Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M.: Concise representations of association rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 92\u2013109. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45728-3_8. ISBN 978-3-540-45728-2"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-38317-5_17","volume-title":"Formal Concept Analysis","author":"SO Kuznetsov","year":"2013","unstructured":"Kuznetsov, S.O.: Fitting pattern structures to knowledge discovery in big data. In: Cellier, P., Distel, F., Ganter, B. (eds.) ICFCA 2013. LNCS (LNAI), vol. 7880, pp. 254\u2013266. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38317-5_17"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11928-6","volume-title":"Formal Concept Analysis","year":"2010","unstructured":"Kwuida, L., Sertkaya, B. (eds.): ICFCA 2010. LNCS (LNAI), vol. 5986. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11928-6"},{"unstructured":"Obiedkov, S., Romashkin, N.: Collaborative conceptual exploration as a tool for crowdsourcing domain ontologies. In: Proceedings of Russian and South African Workshop on Knowledge Discovery Techniques Based on Formal Concept Analysis, CEUR Workshop Proceedings, vol. 1552, pp. 58\u201370 (2015)","key":"3_CR26"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2016.03.018","volume":"658","author":"M Wild","year":"2017","unstructured":"Wild, M.: The joy of implications, aka pure Horn formulas: mainly a survey. Theoretical Computer Science 658, 264\u2013292 (2017)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21462-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:21Z","timestamp":1710233781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}