{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:05Z","timestamp":1760170385054},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708285"},{"type":"electronic","value":"9783540709015"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70901-5_16","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T10:28:43Z","timestamp":1179397723000},"page":"240-270","source":"Crossref","is-referenced-by-count":4,"title":["A Solution of the Word Problem for Free Double Boolean Algebras"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Vormbrock","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-642-57217-3_2","volume-title":"Begriffliche Wissensverarbeitung: Methoden und Anwendungen","author":"P. Burmeister","year":"2000","unstructured":"Burmeister, P.: ConImp \u2013 Ein Programm zur Fomalen Begriffsanalyse. In: Stumme, G., Wille, R. (eds.) Begriffliche Wissensverarbeitung: Methoden und Anwendungen, pp. 25\u201356. Springer, Heidelberg (2000)"},{"key":"16_CR2","unstructured":"Burris, S., Sankappanavar, H.P.: A course in universal algebra. Millenium Edition (2000), \n                  \n                    http:\/\/www.math.uwaterloo.ca\/~snburris\/htdocs\/ualg.html"},{"key":"16_CR3","doi-asserted-by":"crossref","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)"},{"key":"16_CR4","series-title":"Contributions to General Algebra","volume-title":"Algebras of Semiconcepts and Double Boolean Algebras","author":"C. Herrmann","year":"2000","unstructured":"Herrmann, C., et al.: Algebras of Semiconcepts and Double Boolean Algebras. Contributions to General Algebra, vol.\u00a013. Verlag Johannes Heyn, Klagenfurt (2000)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02573302","volume":"39","author":"M. Skorsky","year":"1989","unstructured":"Skorsky, M.: Regular Monoids Generated by two Galois Connections. Semigroup Forum\u00a039, 263\u2013293 (1989)","journal-title":"Semigroup Forum"},{"key":"16_CR6","volume-title":"Concept Exploration. Knowledge Acquisition in Conceptual Knowledge Systems","author":"G. Stumme","year":"1997","unstructured":"Stumme, G.: Concept Exploration. Knowledge Acquisition in Conceptual Knowledge Systems. Shaker, Aachen (1997)"},{"key":"16_CR7","unstructured":"Vormbrock, B.: Kongruenzrelationen auf doppelt-booleschen Algebren. Diplomarbeit, FB Mathematik, TU Darmstadt (2002)"},{"key":"16_CR8","unstructured":"Vormbrock, B.: Congruence Relations on Double Boolean Algebras. Algebra Universalis (submitted)"},{"key":"16_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-540-24651-0_19","volume-title":"Concept Lattices","author":"B. Vormbrock","year":"2004","unstructured":"Vormbrock, B.: A First Step Towards Protoconcept Exploration. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 208\u2013221. Springer, Heidelberg (2004)"},{"key":"16_CR10","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Formal Concept Analysis","author":"B. Vormbrock","year":"2005","unstructured":"Vormbrock, B., Wille, R.: Semiconcept and Protoconcept Algebras: The Basic Theorems. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626, Springer, Heidelberg (2005)"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/10722280_22","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"R. Wille","year":"2000","unstructured":"Wille, R.: Boolean Concept Logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol.\u00a01867, pp. 317\u2013331. Springer, Heidelberg (2000)"},{"key":"16_CR13","first-page":"265","volume-title":"Working with Conceptual Structures. Contributions to ICCS 2000","author":"R. Wille","year":"2000","unstructured":"Wille, R.: Contextual Logic Summary. In: Stumme, G. (ed.) Working with Conceptual Structures. Contributions to ICCS 2000, pp. 265\u2013276. Shaker, Aachen (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70901-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:19Z","timestamp":1605744679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70901-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708285","9783540709015"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70901-5_16","relation":{},"subject":[]}}