Attribute exploration with background knowledge
Theoretical Computer Science
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Logical Scaling in Formal Concept Analysis
ICCS '97 Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Completing description logic knowledge bases using formal concept analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A finite basis for the set of ƐL-implications holding in a finite model
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Usability Issues in Description Logic Knowledge Base Completion
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
What's happening in semantic web: and what FCA could have to do with it
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
An approach to exploring description logic knowledge bases
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data
Proceedings of the seventh international conference on Knowledge capture
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In a previous ICFCA paper we have shown that, in the Description Logics $\mathcal {EL}$ and ${\mathcal {EL}}_{\rm gfp}$, the set of general concept inclusions holding in a finite model always has a finite basis. In this paper, we address the problem of how to compute this basis efficiently, by adapting methods from formal concept analysis.