{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:27:41Z","timestamp":1743020861484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_9","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"110-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-0330","authenticated-orcid":false,"given":"Francesco","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"9_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30\u2013August 5 2005, pp. 364\u2013369. Professional Book Center (2005)"},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, New York (2017)"},{"issue":"13\u201314","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1016\/j.dam.2013.02.029","volume":"161","author":"R Belohl\u00e1vek","year":"2013","unstructured":"Belohl\u00e1vek, R., Vychodil, V.: Closure-based constraints in formal concept analysis. Discrete Appl. Math. 161(13\u201314), 1894\u20131911 (2013)","journal-title":"Discrete Appl. Math."},{"key":"9_CR4","unstructured":"Borchmann, D.: Learning terminological knowledge with high confidence from erroneous data. Doctoral thesis, Technische Universit\u00e4t Dresden, Dresden, Germany (2014)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/11663081.2016.1168230","volume":"26","author":"D Borchmann","year":"2016","unstructured":"Borchmann, D., Distel, F., Kriegel, F.: Axiomatisation of general concept inclusions from finite interpretations. J. Appl. Non-Class. Logics 26(1), 1\u201346 (2016)","journal-title":"J. Appl. Non-Class. Logics"},{"key":"9_CR6","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proceedings, Tenth International Conference on Principles of Knowledge Representation and Reasoning, Lake District of the United Kingdom, 2\u20135 June 2006, pp. 260\u2013270. AAAI Press (2006)"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1613\/jair.334","volume":"6","author":"G De Giacomo","year":"1997","unstructured":"De Giacomo, G., Lenzerini, M.: A uniform framework for concept definitions in description logics. J. Artif. Intell. Res. 6, 87\u2013110 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR9","unstructured":"Distel, F.: Learning description logic knowledge bases from data using methods from formal concept analysis. Doctoral thesis, Technische Universit\u00e4t Dresden, Dresden, Germany (2011)"},{"key":"9_CR10","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"},{"key":"9_CR11","first-page":"5","volume":"95","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 95, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Hernich, A., Lutz, C., Papacchini, F., Wolter, F.: Horn-Rewritability vs. PTime query evaluation in ontology-mediated querying. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 1861\u20131867. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/257"},{"key":"9_CR13","volume-title":"Foundations of Semantic Web Technologies","author":"P Hitzler","year":"2010","unstructured":"Hitzler, P., Kr\u00f6tzsch, M., Rudolph, S.: Foundations of Semantic Web Technologies. Chapman and Hall\/CRC Press, Boca Raton (2010)"},{"key":"9_CR14","unstructured":"Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5 2005, pp. 466\u2013471. Professional Book Center (2005)"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10817-007-9080-3","volume":"39","author":"U Hustadt","year":"2007","unstructured":"Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive datalog. J. Autom. Reason. 39(3), 351\u2013384 (2007)","journal-title":"J. Autom. Reason."},{"key":"9_CR16","unstructured":"Kriegel, F.: Concept Explorer FX (2010\u20132019), Software for Formal Concept Analysis with Description Logic Extensions. https:\/\/github.com\/francesco-kriegel\/conexp-fx"},{"key":"9_CR17","unstructured":"Kriegel, F.: NextClosures with constraints. In: Huchard, M., Kuznetsov, S. (eds.) Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, 18\u201322 July 2016. CEUR Workshop Proceedings, vol. 1624, pp. 231\u2013243. CEUR-WS.org (2016)"},{"key":"9_CR18","series-title":"Lecture Notes in Social Networks","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-64167-6_5","volume-title":"Formal Concept Analysis of Social Networks","author":"F Kriegel","year":"2017","unstructured":"Kriegel, F.: Acquisition of terminological knowledge from social networks in description logic. In: Missaoui, R., Kuznetsov, S.O., Obiedkov, S. (eds.) Formal Concept Analysis of Social Networks. LNSN, pp. 97\u2013142. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64167-6_5"},{"key":"9_CR19","unstructured":"Kriegel, F.: Most specific consequences in the description logic $$\\cal{EL}$$. LTCS-Report 18\u201311, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2018, accepted for publication in Discrete Applied Mathematics). https:\/\/tu-dresden.de\/inf\/lat\/reports#Kr-LTCS-18-11"},{"key":"9_CR20","unstructured":"Kriegel, F.: Joining implications in formal contexts and inductive learning in a horn description logic (Extended Version). LTCS-Report 19\u201302, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2019). https:\/\/tu-dresden.de\/inf\/lat\/reports#Kr-LTCS-19-02"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Kriegel, F.: Most specific consequences in the description logic $$\\cal{EL}$$. Discrete Applied Mathematics (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.01.029","DOI":"10.1016\/j.dam.2019.01.029"},{"issue":"5","key":"9_CR22","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1080\/03081079.2017.1349570","volume":"46","author":"F Kriegel","year":"2017","unstructured":"Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base with background knowledge. Int. J. Gen. Syst. 46(5), 490\u2013510 (2017)","journal-title":"Int. J. Gen. Syst."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-75560-9_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Krisnadhi","year":"2007","unstructured":"Krisnadhi, A., Lutz, C.: Data complexity in the $$\\cal{EL}$$ family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333\u2013347. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_25"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422085.2422087","volume":"14","author":"Markus Kr\u00f6tzsch","year":"2013","unstructured":"Kr\u00f6tzsch, M., Rudolph, S., Hitzler, P.: Complexities of horn description logics. ACM Trans. Comput. Logic 14(1), 2:1\u20132:36 (2013)","journal-title":"ACM Transactions on Computational Logic"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-45620-1_34","volume-title":"Automated Deduction\u2014CADE-18","author":"O Kupferman","year":"2002","unstructured":"Kupferman, O., Sattler, U., Vardi, M.Y.: The complexity of the graded $${\\mu }$$-Calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 423\u2013437. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45620-1_34"},{"issue":"11","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2007.04.014","volume":"156","author":"SO Kuznetsov","year":"2008","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Appl. Math. 156(11), 1994\u20132003 (2008)","journal-title":"Discrete Appl. Math."},{"key":"9_CR27","unstructured":"Rudolph, S.: Relational exploration: combining description logics and formal concept analysis for knowledge specification. Doctoral thesis, Technische Universit\u00e4t Dresden, Dresden, Germany (2006)"},{"key":"9_CR28","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 24\u201330 August 1991, pp. 466\u2013471. Morgan Kaufmann (1991)"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-80098-6_39","volume-title":"Studies in Classification, Data Analysis, and Knowledge Organization","author":"G Stumme","year":"1996","unstructured":"Stumme, G.: Attribute exploration with background implications and exceptions. In: Bock, H.H., Polasek, W. (eds.) Studies in Classification, Data Analysis, and Knowledge Organization, pp. 457\u2013469. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-3-642-80098-6_39"},{"key":"9_CR30","unstructured":"Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. Doctoral thesis, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, Aachen, Germany (2001)"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:45Z","timestamp":1710233805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_9","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)"}}]}}