{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:31:25Z","timestamp":1758274285171,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778668"},{"type":"electronic","value":"9783030778675"}],"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-77867-5_5","type":"book-chapter","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:27:55Z","timestamp":1624318075000},"page":"74-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Kind of Implication to Reason with Unknown Information"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7518-1828","authenticated-orcid":false,"given":"Francisco","family":"P\u00e9rez-G\u00e1mez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5506-6467","authenticated-orcid":false,"given":"Pablo","family":"Cordero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0531-4055","authenticated-orcid":false,"given":"Manuel","family":"Enciso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4548-8030","authenticated-orcid":false,"given":"Angel","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: Lattice Theory, 1st edn. American Mathematical Society Colloquium Publications, Providence (1940)","DOI":"10.1090\/coll\/025"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11528784_6","volume-title":"Formal Concept Analysis","author":"P Burmeister","year":"2005","unstructured":"Burmeister, P., Holzer, R.: Treating incomplete knowledge in formal concept analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 114\u2013126. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11528784_6"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-030-00485-9_9","volume":"796","author":"P Cordero","year":"2019","unstructured":"Cordero, P., Enciso, M., Mora, A., Rodr\u00edguez-Jim\u00e9nez, J.M.: Inference of mixed information in formal concept analysis. Stud. Comput. Intell. 796, 81\u201387 (2019)","journal-title":"Stud. Comput. Intell."},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B Davey","year":"2002","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order, vol. 2. Cambridge University Press, Cambridge (2002)"},{"key":"5_CR5","unstructured":"Finn, V.: About machine-oriented formalization of plausible reasonings. F. Beckon-J.S. Mill Style, Semiotika I Informatika 20, 35\u2013101 (1983)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M Fitting","year":"1991","unstructured":"Fitting, M.: Bilattices and the semantics of logic programming. J. Logic Programm. 11(2), 91\u2013116 (1991)","journal-title":"J. Logic Programm."},{"key":"5_CR7","unstructured":"Fitting, M.: Bilattices are nice things. In: Hendricks, V.F., Pedersen, S.A., Bolander, T. (eds.) Self-reference, pp. 53\u201377. Cambridge University Press, CSLI Publications, Cambridge (2006)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ganter, B., Kuznetsov, S.: Hypotheses and version spaces. ICCS, pp. 83\u201395 (2003)","DOI":"10.1007\/978-3-540-45091-7_6"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-49291-8_6","volume-title":"Conceptual Exploration","author":"B Ganter","year":"2016","unstructured":"Ganter, B., Obiedkov, S.: More expressive variants of exploration. In: Conceptual Exploration, pp. 237\u2013292. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49291-8_6"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-21462-3_24","volume-title":"Formal Concept Analysis","author":"T Makhalova","year":"2019","unstructured":"Makhalova, T., Trnecka, M.: A study of boolean matrix factorization under supervised settings. In: Cristea, D., Le Ber, F., Sertkaya, B. (eds.) ICFCA 2019. LNCS (LNAI), vol. 11511, pp. 341\u2013348. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21462-3_24"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-32262-7_29","volume":"3403","author":"B Ganter","year":"2005","unstructured":"Ganter, B., Kwuida, L.: Which concept lattices are pseudocomplemented? Lect. Notes Comput. Sci. 3403, 408\u2013416 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Applied lattice theory: formal concept analysis. In: Gr\u00e4tzer, G. (ed.) General Lattice Theory. Birkh\u00e4user. Preprints (1997)","DOI":"10.1007\/978-3-0348-9326-8"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ijar.2020.02.009","volume":"120","author":"J Konecny","year":"2020","unstructured":"Konecny, J.: Attribute implications in L-concept analysis with positive and negative attributes: validity and properties of models. Int. J. Approximate Reason. 120, 203\u2013215 (2020)","journal-title":"Int. J. Approximate Reason."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ijar.2015.06.004","volume":"63","author":"SO Kuznetsov","year":"2015","unstructured":"Kuznetsov, S.O., Revenko, A.: Interactive error correction in implicative theories. Int. J. Approximate Reason. 63, 89\u2013100 (2015)","journal-title":"Int. J. Approximate Reason."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1007\/BF02362847","volume":"80","author":"SO Kuztnesov","year":"1996","unstructured":"Kuztnesov, S.O.: Mathematical aspects of concept analysis. J. Math. Sci. 80, 1654\u20131698 (1996)","journal-title":"J. Math. Sci."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11528784_11","volume-title":"Formal Concept Analysis","author":"SO Kuznetsov","year":"2005","unstructured":"Kuznetsov, S.O.: Galois connections in data analysis: contributions from the soviet era and modern russian research. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 196\u2013225. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11528784_11"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.3233\/FI-2012-659","volume":"115","author":"R Missaoui","year":"2012","unstructured":"Missaoui, R., Nourine, L., Renaud, Y.: Computing implications with negation from a formal context. Fundam. Informaticae 115(4), 357\u2013375 (2012)","journal-title":"Fundam. Informaticae"},{"issue":"4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1080\/00207160.2011.644275","volume":"89","author":"A Mora","year":"2012","unstructured":"Mora, A., Cordero, P., Enciso, M., Fortes, I., Aguilera, G.: Closure via functional dependence simplification. Int. J. Comput. Math. 89(4), 510\u2013526 (2012)","journal-title":"Int. J. Comput. Math."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-45483-7_24","volume-title":"Conceptual Structures: Integration and Interfaces","author":"S Obiedkov","year":"2002","unstructured":"Obiedkov, S.: Modal logic for evaluating formulas in incomplete contexts. In: Priss, U., Corbett, D., Angelova, G. (eds.) ICCS-ConceptStruct 2002. LNCS (LNAI), vol. 2393, pp. 314\u2013325. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45483-7_24"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ins.2016.06.015","volume":"369","author":"J Rodr\u00edguez-Jim\u00e9nez","year":"2016","unstructured":"Rodr\u00edguez-Jim\u00e9nez, J., Cordero, P., Enciso, M., Rudolph, S.: Concept lattices with negative information: a characterization theorem. Inform. Sci. 369, 51\u201362 (2016)","journal-title":"Inform. Sci."},{"issue":"16","key":"5_CR21","doi-asserted-by":"publisher","first-page":"4829","DOI":"10.1002\/mma.3814","volume":"39","author":"JM Rodr\u00edguez-Jim\u00e9nez","year":"2016","unstructured":"Rodr\u00edguez-Jim\u00e9nez, J.M., Cordero, P., Enciso, M., Mora, A.: Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis. Math. Methods Appl. Sci. 39(16), 4829\u20134845 (2016)","journal-title":"Math. Methods Appl. Sci."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume":"83","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Sets 83, 445\u2013470 (1982)","journal-title":"Ordered Sets"}],"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-77867-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:23:35Z","timestamp":1672539815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77867-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778668","9783030778675"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77867-5_5","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":"22 June 2021","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":"Strasbourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"29 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2021.sciencesconf.org\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","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":"14","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":"44% - 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":"1,6","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)"}}]}}