An Application of Relation Algebra to Lexical Databases | Zendy

Uta Priss | Zendy; Lloyd J. Old | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Application of Relation Algebra to Lexical Databases

Author(s) -

Uta Priss,

Lloyd J. Old

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-35893-5

DOI - 10.1007/11787181_28

Subject(s) - relational algebra , rotation formalisms in three dimensions , computer science , binary relation , relation algebra , relational database , relation (database) , algebra over a field , set (abstract data type) , semantics (computer science) , relational calculus , context (archaeology) , power set , database , algebraic specification , conjunctive query , relational model , programming language , algebra representation , mathematics , discrete mathematics , two element boolean algebra , specification language , pure mathematics , paleontology , geometry , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research