Repository | Book | Chapter

An application of relation algebra to lexical databases

Uta Priss

pp. 388-400

This paper presents an application of relation algebra to lexical databases. 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.

Publication details

DOI: 10.1007/11787181_28

Full citation:

Priss, U. (2006)., An application of relation algebra to lexical databases, in P. Hitzler & P. Øhrstrøm (eds.), Conceptual structures: inspiration and application, Dordrecht, Springer, pp. 388-400.

This document is unfortunately not available for download at the moment.