Mining ℰℒ⊥ Bases with Adaptable Role Depth
From MaRDI portal
Publication:6135964
DOI10.1613/jair.1.13777arXiv2102.10689MaRDI QIDQ6135964
Unnamed Author, Barış Sertkaya, Ana Ozaki, Ricardo Guimarães
Publication date: 28 August 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10689
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of enumerating pseudo-intents
- On generating all maximal independent sets
- Horn approximations of empirical data
- Computing premises of a minimal cover of functional dependencies is intractable
- Concept learning in description logics using refinement operators
- Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \)
- Learning description logic axioms from discrete probability distributions over description graphs
- Attribute-incremental construction of the canonical implication basis
- Ontology Learning from Interpretations in Lightweight Description Logics
- An Introduction to Description Logic
- DL-FOIL Concept Learning in Description Logics
- Two Basic Algorithms in Concept Analysis
- Some Computational Problems Related to Pseudo-intents
- Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$
- Finding a minimum equivalent graph of a digraph
- Axiomatisation of general concept inclusions from finite interpretations
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis
- Conceptual Structures at Work
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Mining ℰℒ⊥ Bases with Adaptable Role Depth
