{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:31:13Z","timestamp":1761597073801},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,14]],"date-time":"2008-03-14T00:00:00Z","timestamp":1205452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00236-008-0072-5","type":"journal-article","created":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T06:44:34Z","timestamp":1205390674000},"page":"211-236","source":"Crossref","is-referenced-by-count":13,"title":["Applying relation algebra and RelView to solve problems on orders and lattices"],"prefix":"10.1007","volume":"45","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,14]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Behnke, R., Berghammer, R., Meyer, E., Schneider, P.: RelView\u2014a system for calculation with relations and relational programming. In: Astesiano, E. (ed.) Proceedings of 1st Conference on Fundamental Approaches to Software Engineering, pp. 318\u2013321. LNCS, vol. 1382. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0053599"},{"key":"72_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(83)90015-8","volume":"43","author":"R. Berghammer","year":"1983","unstructured":"Berghammer R. and Schmidt G. (1983). Discrete ordering relations. Discr. Math. 43: 1\u20137","journal-title":"Discr. Math."},{"key":"72_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0255(99)00012-2","volume":"119","author":"R. Berghammer","year":"1999","unstructured":"Berghammer R. (1999). Combining relational calculus and the Dijkstra-Gries method for deriving relational programs. Inf. Sci. 119: 155\u2013171","journal-title":"Inf. Sci."},{"key":"72_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6423(99)00043-X","volume":"38","author":"R. Berghammer","year":"2000","unstructured":"Berghammer R. and Hoffmann T. (2000). Deriving relational programs for computing kernels by reconstructing a proof of Richardson\u2019s theorem. Sci. Comput. Prog. 38: 1\u201325","journal-title":"Sci. Comput. Prog."},{"key":"72_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0020-0255(01)00163-3","volume":"139","author":"R. Berghammer","year":"2001","unstructured":"Berghammer R. and Hoffmann T. (2001). Relational depth-first-search with applications. Inf. Sci. 139: 167\u2013186","journal-title":"Inf. Sci."},{"key":"72_CR6","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relation algebra using binary decision diagrams. In: de Swart, H. (ed.): Proceedings of 6th International Workshop Relational Methods in Computer Science, pp. 241\u2013257. LNCS, vol. 2561. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36280-0_17"},{"key":"72_CR7","first-page":"50","volume":"1","author":"R. Berghammer","year":"2004","unstructured":"Berghammer R. (2004). Computation of cut completions and concept lattices using relational algebra and RelView. J. Relat. Meth. Comput. Sci. 1: 50\u201372","journal-title":"J. Relat. Meth. Comput. Sci."},{"key":"72_CR8","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Neumann, F.: RelView\u2014An OBDD-based Computer Algebra system for relations. In: Gansha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) Proceedings of 8th International Workshop Computer Algebra in Scientific Computing, pp. 40\u201351. LNCS, vol. 3718. Springer, Heidelberg (2005)","DOI":"10.1007\/11555964_4"},{"key":"72_CR9","first-page":"301","volume":"70","author":"R. Berghammer","year":"2006","unstructured":"Berghammer R. and Fronk A. (2006). Exact computation of minimum feedback vertex sets with relational algebra. Fund. Inform. 70: 301\u2013316","journal-title":"Fund. Inform."},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Milanese, U.: Relational approach to Boolean logic problems. In: MacCaull, W., D\u00fcnsch, I., Winter, M. (eds.) Proceedings of 8th International Workshop Relational Methods in Computer Science, pp. 48\u201359. LNCS, vol. 3929. Springer, Heidelberg (2006)","DOI":"10.1007\/11734673_4"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Schmidt, G.: Algebraic visualization of relations using RelView. In: Gansha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) Proceedings of 10th International Workshop Computer Algebra in Scientific Computing, pp. 58\u201372. LNCS, vol. 4770. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-75187-8_6"},{"key":"72_CR12","unstructured":"Birkhoff, G.: Lattice theory, 3rd edn. American Math. Society Coll. Publ., Vol. XXV, American Math. Society, Providence (1967)"},{"issue":"Serie A","key":"72_CR13","first-page":"1512","volume":"268","author":"R. Bonnet","year":"1969","unstructured":"Bonnet R. and Pouzet M. (1969). Extensions et stratifications d\u2019ensembles disperses. C.R. Acad. Sci. 268(Serie A): 1512\u20131515","journal-title":"C.R. Acad. Sci."},{"key":"72_CR14","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey B.A. and Priestley H.A. (1990). Introduction to Lattices and Order. Cambridge University Press, Cambridge"},{"key":"72_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF01448979","volume":"53","author":"R. Dedekind","year":"1900","unstructured":"Dedekind R. (1900). \u00dcber die von drei Moduln erzeugte Dualgruppe. Math. Ann. 53: 371\u2013403","journal-title":"Math. Ann."},{"key":"72_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate Calculus and Program Semantics","author":"E.W. Dijkstra","year":"1990","unstructured":"Dijkstra E.W. and Scholten C.S. (1990). Predicate Calculus and Program Semantics. Springer, Heidelberg"},{"key":"72_CR17","doi-asserted-by":"crossref","unstructured":"Freese, R., Jezek, J., Nation, J.B.: Free lattices. Mathematical Surveys and Monographs, vol. 42. American Math. Society, Providence (1995)","DOI":"10.1090\/surv\/042"},{"key":"72_CR18","doi-asserted-by":"crossref","unstructured":"Freese, R.: Automated lattice drawing. In: Eklund, P. (ed.) Proceedings of International Conference on Formal Concept Analysis, pp. 112\u2013127. LNCS, vol. 2961. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24651-0_12"},{"key":"72_CR19","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. and Wille R. (1999). Formal concept Analysis: Mathematical Foundations. Springer, Heidelberg"},{"key":"72_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Computer Programming","author":"D. Gries","year":"1981","unstructured":"Gries D. (1981). The Science of Computer Programming. Springer, Heidelberg"},{"key":"72_CR21","doi-asserted-by":"crossref","unstructured":"Hermes, H.: Einf\u00fchrung in die Verbandstheorie. Grundlehren der math. Wissenschaften in Einzeldarstellungen, 2nd edn. Springer, Heidelberg (1967)","DOI":"10.1007\/978-3-642-86524-4"},{"key":"72_CR22","doi-asserted-by":"crossref","unstructured":"Hulpke, A.: Computing normal subgroups. In: Proc. Int. Symposium on Symbolic and Algebraic Computation, pp. 194\u2013198. ACM Press, New York (1998)","DOI":"10.1145\/281508.281612"},{"key":"72_CR23","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"A.B. Kahn","year":"1962","unstructured":"Kahn A.B. (1962). Topological sorting of large networks. Commun. ACM 5: 558\u2013562","journal-title":"Commun. ACM"},{"key":"72_CR24","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport L. (1978). Time, clocks and the ordering of events in a distributed system. Commun. ACM 21: 558\u2013565","journal-title":"Commun. ACM"},{"key":"72_CR25","volume-title":"Algebra. Graduate Texts in Mathematics","author":"S. Lang","year":"2002","unstructured":"Lang S. (2002). Algebra. Graduate Texts in Mathematics, 3rd edn. Springer, Heidelberg","edition":"3"},{"key":"72_CR26","unstructured":"Leoniuk, B.: ROBDD-basierte Implementierung von Relationen und relationalen Operationen mit Anwendungen. Dissertation, Univ. Kiel (2001)"},{"key":"72_CR27","volume-title":"Relation algebras. Studies in Logic and the Fundations of Mathematics, vol. 150","author":"R. Maddux","year":"2006","unstructured":"Maddux R. (2006). Relation algebras. Studies in Logic and the Fundations of Mathematics, vol. 150. Elsevier, Amsterdam"},{"key":"72_CR28","unstructured":"Milanese, U.: Zur Implementierung eines ROBDD-basierten Systems f\u00fcr die Manipulation und Visualisierung von Relationen. Dissertation, Univ. Kiel (2003)"},{"key":"72_CR29","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1305\/ndjfl\/1093893707","volume":"16","author":"W.C. Nemitz","year":"1969","unstructured":"Nemitz W.C. (1969). Semi-Boolean lattices. Notre Dame Journal of Formal Logic 16: 235\u2013238","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"72_CR30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0020-0190(99)00072-1","volume":"70","author":"L. Nourine","year":"1999","unstructured":"Nourine L. and Raynaud O. (1999). A fast algorithm for building lattices. Inform. Proc. Let. 70: 259\u2013264","journal-title":"Inform. Proc. Let."},{"key":"72_CR31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1215\/S0012-7094-38-00419-3","volume":"4","author":"O. Ore","year":"1938","unstructured":"Ore O. (1938). Structures and group theory II. Duke Math. J. 4: 247\u2013269","journal-title":"Duke Math. J."},{"key":"72_CR32","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G. Pruesse","year":"1994","unstructured":"Pruesse G. and Ruskey F. (1994). Generating all linear extensions fast. SIAM J. Comput. 23: 373\u2013386","journal-title":"SIAM J. Comput."},{"key":"72_CR33","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoret. Comput. Sci., Springer Verlag (1993)","DOI":"10.1007\/978-3-642-77968-8"},{"key":"72_CR34","unstructured":"Schmidt, R.: Subgroup lattices of groups. de Gruyter Expositions in Mathematics, vol. 14, de Gruyter (1994)"},{"key":"72_CR35","volume-title":"Elemente der Verbandstheorie","author":"L.A. Skornjakow","year":"1973","unstructured":"Skornjakow L.A. (1973). Elemente der Verbandstheorie. Akademie-Verlag, Berlin"},{"key":"72_CR36","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner E. (1928). Ein Satz \u00fcber Untermengen einer endlichen Menge. Math. Zeitschrift 27: 544\u2013548","journal-title":"Math. Zeitschrift"},{"key":"72_CR37","doi-asserted-by":"crossref","first-page":"386","DOI":"10.4064\/fm-16-1-386-389","volume":"16","author":"E. Szpilrajn","year":"1930","unstructured":"Szpilrajn E. (1930). Sur l\u2019extension de l\u2019ordre partiel. Fundamenta Math. 16: 386\u2013389","journal-title":"Fundamenta Math."},{"key":"72_CR38","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski A. (1941). On the calculus of relations. J. Symbolic Logic 6: 73\u201389","journal-title":"J. Symbolic Logic"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0072-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0072-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0072-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T01:27:22Z","timestamp":1684286842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0072-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,14]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0072-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,14]]}}}