Modeling and reasoning in context-aware systems based on relational concept analysis and description logic

Digital technologies are an opportunity to overcome disabilities, provided that accessibility is ensured. In this paper, we focus on visual accessibility and the way it is supported in Operating Systems (OS). The significant variability in this support has practical consequences, e.g., the difficulty to recommend or select an OS, or migrate from one OS to another. This suggests building a variability model for OS that would classify them and would serve as a reference. We propose a methodology to build such a variability model with the help of the Formal Concept Analysis (FCA) framework. In addition, as visual accessibility can be divided into several concerns (e.g., zoom, or contrast), we leverage an extension of FCA, namely Relational Concept Analysis. We also build an ontology to dispose of a standardized description of visual accessibility options. We apply our proposal to the analysis of the variability of a few representative operating systems.

Download Full-text

A Proposition for Combining Pattern Structures and Relational Concept Analysis

Formal Concept Analysis - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07248-7_8 ◽

2014 ◽

pp. 96-111 ◽

Cited By ~ 5

Author(s):

Víctor Codocedo ◽

Amedeo Napoli

Keyword(s):

Concept Analysis ◽

Pattern Structures ◽

Relational Concept

Download Full-text

Constructing and Extending Description Logic Ontologies using Methods of Formal Concept Analysis

KI - Künstliche Intelligenz ◽

10.1007/s13218-020-00673-8 ◽

2020 ◽

Vol 34 (3) ◽

pp. 399-403 ◽

Cited By ~ 1

Author(s):

Francesco Kriegel

Keyword(s):

Formal Concept Analysis ◽

Description Logic ◽

Description Logics ◽

Concept Analysis ◽

Rank Function ◽

Formal Concept ◽

Graded Lattice

Abstract My thesis describes how methods from Formal Concept Analysis can be used for constructing and extending description logic ontologies. In particular, it is shown how concept inclusions can be axiomatized from data in the description logics $$\mathcal {E}\mathcal {L}$$ E L , $$\mathcal {M}$$ M , $$\textsf {Horn}$$ Horn -$$\mathcal {M}$$ M , and $$\textsf{Prob}\text{-}\mathcal {E}\mathcal {L}$$ Prob - E L . All proposed methods are not only sound but also complete, i.e., the result not only consists of valid concept inclusions but also entails each valid concept inclusion. Moreover, a lattice-theoretic view on the description logic $$\mathcal {E}\mathcal {L}$$ E L is provided. For instance, it is shown how upper and lower neighbors of $$\mathcal {E}\mathcal {L}$$ E L concept descriptions can be computed and further it is proven that the set of $$\mathcal {E}\mathcal {L}$$ E L concept descriptions forms a graded lattice with a non-elementary rank function.

Download Full-text