A relational model of data for large shared data banks
Communications of the ACM
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Existential Concept Graphs of Power Context Families
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
The Second Calculus of Binary Relations
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Contextual-Logic Extension of TOSCANA
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Linked
An FCA interpretation of relation algebra
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Revisiting the Potentialities of a Mechanical Thesaurus
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Relation Algebra Operations on Formal Contexts
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Data weeding techniques applied to Roget's thesaurus
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Concept neighbourhoods in lexical databases
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
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.