Abstract
This paper presents an application of relation algebra to lexical data-bases. The semantics of knowledge representation formalisms and query languages can be provided either via a set-theoretic semantics or via an algebraic structure. With respect to formalisms based on n-ary relations (such as relational databases or power context families), a variety of algebras is applicable. In standard relational databases and in formal concept analysis (FCA) research, the algebra of choice is usually some form of Cylindric Set Algebra (CSA) or Peircean Algebraic Logic (PAL). A completely different choice of algebra is a binary Relation Algebra (RA). In this paper, it is shown how RA can be used for modelling FCA applications with respect to lexical databases. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Priss, U., & Old, L. J. (2006). An application of relation algebra to lexical databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4068 LNAI, pp. 388–400). Springer Verlag. https://doi.org/10.1007/11787181_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
