Abstract
Relation algebra is well suited for dealing with many problems on ordered sets. Introducing lattices via order relations, this suggests to apply it and tools for its mechanization for lattice-theoretical problems, too. We combine relation algebra and the specific purpose Computer Algebra system RELVIEW to solve some algorithmic problems. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Berghammer, R. (2006). Solving algorithmic problems on orders and lattices by relation Algebra and RELVIEW. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4194 LNCS, pp. 49–63). Springer Verlag. https://doi.org/10.1007/11870814_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
