The following pages link to Felix Distel (Q628338):
Displayed 12 items.
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- The limits of decidability in fuzzy description logics with general concept inclusions (Q2512986) (← links)
- How Fuzzy Is My Fuzzy Description Logic? (Q2908480) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Hardness of Enumerating Pseudo-intents in the Lectic Order (Q3552284) (← links)
- An Approach to Exploring Description Logic Knowledge Bases (Q3552290) (← links)
- Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$ (Q3630241) (← links)
- Axiomatisation of general concept inclusions from finite interpretations (Q4586152) (← links)
- Mathematical Morphology Operators over Concept Lattices (Q4924383) (← links)
- (Q5282979) (← links)
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model (Q5445322) (← links)