{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T08:57:05Z","timestamp":1766048225099,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278917"},{"type":"electronic","value":"9783540318811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11528784_6","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T03:24:54Z","timestamp":1285644294000},"page":"114-126","source":"Crossref","is-referenced-by-count":24,"title":["Treating Incomplete Knowledge in Formal Concept Analysis"],"prefix":"10.1007","author":[{"given":"Peter","family":"Burmeister","sequence":"first","affiliation":[]},{"given":"Richard","family":"Holzer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Burmeister, P.: (assisted by Rust, A., Scheich, P., Newrly, N. Bang, C.). Con- Imp \u2013 A program on formal concept analysis of one-valued contexts (running under MS-DOS or Linux resp.). Darmstadt University of Technology (1986\/2001)"},{"key":"6_CR2","unstructured":"Burmeister, P.: Merkmalimplikationen bei unvollst\u00e4ndigem Wissen. In: Lex, W. (ed.) Proceedings: Arbeitstagung Begriffsanalyse und K\u00fcnstliche Intelligenz (Clausthal-Zellerfeld 6. - 8. 10. 1988); Technische Universit\u00e4t Clausthal, pp. 15\u201346 (1991)"},{"key":"6_CR3","volume-title":"Begriffliche Wissensverarbeitung: Methoden und Anwendungen","author":"P. Burmeister","year":"2000","unstructured":"Burmeister, P.: ConImp \u2013 Ein Programm zur Formalen Begriffsanalyse. In: Stumme, G., Wille, R. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, Springer, Heidelberg (2000); See also Formal Concept Analysis with ConImp: Introduction to the Basic Features; (TUD 2003) at http:\/\/www.mathematik.tu-darmstadt.de\/~burmeister which is more than a translation of the above paper"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722280_27","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"P. Burmeister","year":"2000","unstructured":"Burmeister, P., Holzer, R.: On the treatment of incomplete knowledge in Formal Concept Analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol.\u00a01867, pp. 385\u2013398. Springer, Heidelberg (2000)"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/320107.320109","volume":"4","author":"E.F. Codd","year":"1979","unstructured":"Codd, E.F.: Extending the database relational model to capture more meaning. ACM Transactions on Database Systems\u00a04(4), 397\u2013434 (1979)","journal-title":"ACM Transactions on Database Systems"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/16301.16303","volume":"15","author":"E.F. Codd","year":"1986","unstructured":"Codd, E.F.: Missing information (applicable and inapplicable) in relational databases. Sigmod\u00a015(4), 53\u201378 (1986)","journal-title":"Sigmod"},{"key":"6_CR7","first-page":"313","volume-title":"Null Values in Database Management","author":"C.J. Date","year":"1986","unstructured":"Date, C.J.: Null Values in Database Management, Ch. 15, pp. 313\u2013334. Addison- Wesley, Reading (1986)"},{"key":"6_CR8","first-page":"217","volume-title":"NOT is not \u2019Not\u2019 (Notes on three-valued logic and related matters)","author":"C.J. Date","year":"1989","unstructured":"Date, C.J.: NOT is not \u2019Not\u2019 (Notes on three-valued logic and related matters), Ch. 8, pp. 217\u2013248. Addison-Wesley, Reading (1989)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(98)00271-0","volume":"217","author":"B. Ganter","year":"1999","unstructured":"Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science\u00a0217, 215\u2013233.10 (1999)","journal-title":"Theoretical Computer Science"},{"key":"6_CR10","volume-title":"Begriffliche Wissensverarbeitung: Methoden und Anwendungen","author":"B. Ganter","year":"2000","unstructured":"Ganter, B.: Begriffe und Implikationen. In: Stumme, G., Wille, R. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, Springer, Heidelberg (2000)"},{"key":"6_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis \u2013 Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis \u2013 Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"6_CR12","first-page":"377","volume-title":"Conceptual Structures: Standards and Practices","author":"B. Ganter","year":"2000","unstructured":"Ganter, B., Wille, R.: Contextual Attribute Logic. In: T\u00f6pferhart, W., Cyre, W. (eds.) Conceptual Structures: Standards and Practices, pp. 377\u2013388. Springer, Heidelberg (2000)"},{"key":"6_CR13","unstructured":"Holzer, R.: Methoden der formalen Begriffsanalyse bei der Behandlung unvollst\u00e4ndigen Wissens. Dissertation, Shaker Verlag (2001)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3233\/FUN-2004-63102","volume":"63","author":"R. Holzer","year":"2004","unstructured":"Holzer, R.: Knowledge acquisition under incomplete knowledge using methods from formal concept analysis Parts I and II. Fundamenta Informaticae\u00a063(1), 17\u201339, 41-63 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR15","unstructured":"Klein, H.-J.: Gesicherte und m\u00f6gliche Antworten auf Anfragen an relationale Datenbanken mit partiellen Relationen (1997)"},{"key":"6_CR16","unstructured":"Klein, H.-J.: Model Theoretic and Proof Theoretic View of Relational Databases with Null Values: A Comparison (1998)"},{"key":"6_CR17","unstructured":"Klein, H.-J.: Efficient Algorithms for Approximating Answers to Queries Against Incomplete Relational Databases. In: Proceedings of the 6th International Workshop on Knowledge Representation meets Databases KRDB 1999, Sweden (1999)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lipski, W.: Informational systems with incomplete information. In: Michaelson, S., Milner, R. (Hrg.) (eds.) Proc. 3rd Int. Symp. on Automata, Languages and Programming (Hrg, Edinburgh, pp. 120\u2013130 (1976)","DOI":"10.1016\/0304-3975(76)90070-0"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/320083.320088","volume":"4","author":"W. Lipski","year":"1979","unstructured":"Lipski, W.: On semantic issues connected with incomplete information databases. ACM Trans. on Database Systems\u00a04(3), 262\u2013296 (1979)","journal-title":"ACM Trans. on Database Systems"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/322234.322239","volume":"18","author":"W. Lipski","year":"1981","unstructured":"Lipski, W.: On databases with incomplete information. J. of the ACM\u00a018(1), 41\u201370 (1981)","journal-title":"J. of the ACM"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Lipski, W.: On relational algebra with marked nulls. In: Proc. 3rd ACM Symp. on Principles of Database Systems, pp. 201\u2013203 (1984)","DOI":"10.1145\/588039.588040"},{"key":"6_CR22","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)"},{"key":"6_CR23","series-title":"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.R., Angelova, G. (eds.) ICCS 2002. LNCS (LNAI), vol.\u00a02393, pp. 314\u2013325. Springer, Heidelberg (2002)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Pagliani, P.: Information Gaps as Communication Needs: A New Semantic Foundation for Some Non-Classical Logics. Journal of Logic, Language and Information\u00a06 (1997)","DOI":"10.1023\/A:1008286102793"},{"key":"6_CR25","unstructured":"Stumme, G.: Knowledge acquisition by distributive concept exploration. In: Ellis, G., Levinson, R.A., Rich, W., Sowa, J.F. (eds.) Supplementary proceedings of the third international conference on conceptual structures, Santa Cruz, CA, USA, pp. 98\u2013111 (1995)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0027880","volume-title":"Conceptual Structures: Fulfilling Peirce\u2019s Dream","author":"G. Stumme","year":"1997","unstructured":"Stumme, G.: Concept exploration \u2013 A tool for creating and exploring conceptual hierarchies. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS, vol.\u00a01257, pp. 318\u2013331. Springer, Heidelberg (1997)"},{"key":"6_CR27","unstructured":"Wille, R.: Dependencies between many-valued attributes. In: Bock, H.H. (ed.) Classification and Related Methods of Data Analysis (1988)"},{"key":"6_CR28","first-page":"365","volume-title":"Data analysis, learning symbolic and numeric knowledge","author":"R. Wille","year":"1989","unstructured":"Wille, R.: Knowledge acquisition by methods of formal concept analysis. In: Diday, E. (ed.) Data analysis, learning symbolic and numeric knowledge, pp. 365\u2013380. Nova Science Publishers, New York (1989)"},{"key":"6_CR29","unstructured":"Wolff, K.E.: A first course in formal concept analysis. In: Faulbaum, F. (ed.) SoftStat 1993, Advances in Statistical Software, vol.\u00a04, pp. 429\u2013438 (1993)"},{"key":"6_CR30","unstructured":"Zickwolff, M.: Rule exploration: first order logic in formal concept analysis. Dissertation, TH Darmstadt (1991)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11528784_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:04:36Z","timestamp":1740539076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11528784_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278917","9783540318811"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11528784_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}