{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:49:06Z","timestamp":1743126546583,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"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_5","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"55-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Direct and Binary Direct Bases for One-Set Updates of a Closure System"],"prefix":"10.1007","author":[{"given":"Kira","family":"Adaricheva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taylor","family":"Ninesling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44236-5_6","volume-title":"Lattice Theory: Special Topics and Applications","author":"K Adaricheva","year":"2016","unstructured":"Adaricheva, K., Nation, J.B.: Bases of closure systems. In: Gr\u00e4tzer, G., Wehrung, F. (eds.) Lattice Theory: Special Topics and Applications, vol. 2. Springer, Basel (2016). https:\/\/doi.org\/10.1007\/978-3-319-44236-5_6"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44236-5_4","volume-title":"Lattice Theory: Special Topics and Applications","author":"K Adaricheva","year":"2016","unstructured":"Adaricheva, K., Nation, J.B.: Lattices of algebraic subsets and implicational classes. In: Gr\u00e4tzer, G., Wehrung, F. (eds.) Lattice Theory: Special Topics and Applications, vol. 2. Springer, Basel (2016). https:\/\/doi.org\/10.1007\/978-3-319-44236-5_4"},{"key":"5_CR3","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.B.: Discovery of the $$D$$-basis in binary tables based on hypergraph dualization. Theoret. Comput. Sci. 658, 307\u2013315 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.dam.2012.08.031","volume":"161","author":"K Adaricheva","year":"2013","unstructured":"Adaricheva, K., Nation, J.B., Rand, R.: Ordered direct implicational basis of a finite closure system. Disc. Appl. Math. 161, 707\u2013723 (2013)","journal-title":"Disc. Appl. Math."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Adaricheva, K., Sloan, R., Sz\u00f6renyi, B., Turan, G.: Horn belief contraction: remainders, envelopes and complexity. In: Proceedings of the KR 2012, pp. 107\u2013115 (2012)","DOI":"10.3233\/FI-2012-643"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(02)00209-3","volume":"127","author":"N Caspard","year":"2003","unstructured":"Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Disc. Appl. Math. 127, 241\u2013269 (2003)","journal-title":"Disc. Appl. Math."},{"key":"5_CR7","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. Theoret. Comput. Sci. 411, 2155\u20132166 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1080\/1055678021000060801","volume":"17","author":"E Boros","year":"2002","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Generating dual-bounded hypergraphs. Optim. Meth. Softw. 17, 749\u2013781 (2002)","journal-title":"Optim. Meth. Softw."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W Dowling","year":"1984","unstructured":"Dowling, W., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Program. 3, 267\u2013284 (1984)","journal-title":"J. Logic Program."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M Fredman","year":"1996","unstructured":"Fredman, M., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"L Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithmfor generating hypergraph transversals and its application in joint generation. Disc. Appl. Math. 154, 2350\u20132372 (2006)","journal-title":"Disc. Appl. Math."},{"key":"5_CR12","volume-title":"The Design of Relational Databases","author":"H Mannila","year":"1992","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.J.: The Design of Relational Databases. Addison-Wesley, Reading (1992)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2307\/2268172","volume":"8","author":"J McKinsey","year":"1943","unstructured":"McKinsey, J.: The decision problem for some classes of sentences without quantifiers. J. Symbolic Logic 8, 61\u201376 (1943)","journal-title":"J. Symbolic Logic"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2014.01.012","volume":"170","author":"K Murakami","year":"2014","unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large scale hypergraphs. Disc. Appl. Math. 170, 83\u201394 (2014)","journal-title":"Disc. Appl. Math."},{"key":"5_CR15","unstructured":"Langlois, M., Sloan, R., Sz\u00f6renyi, B., Turan, G.: Horn complements: towards Horn-to-Horn belief revision. In: Proceedings of the AAAI 2008, pp. 466\u2013471 (2008)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.tcs.2015.12.028","volume":"658","author":"S Rudolph","year":"2017","unstructured":"Rudolph, S.: Succintness and tractability of closure operator representations. Theoret. Comput. Sci. 658, 327\u2013345 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/03081079.2017.1349632","volume":"46","author":"E Rodr\u00edguez-Lorenzo","year":"2017","unstructured":"Rodr\u00edguez-Lorenzo, E., Adaricheva, K., Cordero, P., Enciso, M., Mora, A.: Formation of the D-basis from implicational systems using simplification logic. Int. J. Gen. Syst. 46(5), 547\u2013568 (2017)","journal-title":"Int. J. Gen. Syst."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44583-8_21","volume-title":"Conceptual Structures: Broadening the Base","author":"P Valtchev","year":"2001","unstructured":"Valtchev, P., Missaoui, R.: Building concept (Galois) lattices from parts: generalizing the incremental methods. In: Delugach, H.S., Stumme, G. (eds.) ICCS-ConceptStruct 2001. LNCS (LNAI), vol. 2120, pp. 290\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44583-8_21"},{"key":"5_CR19","unstructured":"Wild, M.: Computations with finite closure systems and implications, Preprint N 1708. Technische Hochschule Darmstadt, pp. 1\u201322 (1994)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0030825","volume-title":"Computing and Combinatorics","author":"M Wild","year":"1995","unstructured":"Wild, M.: Computations with finite closure systems and implications. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 111\u2013120. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030825"},{"key":"5_CR21","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. Theoret. Comput. Sci. 658, 264\u2013292 (2017)","journal-title":"Theoret. Comput. Sci."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:35Z","timestamp":1710233795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_5","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)"}}]}}