LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis

Janostik, Radek; Konečný, Jan; Krajča, Petr

doi:10.1016/j.ins.2021.04.104

Search citation statements

Order By: Relevance

Paper Sections

Select...

Implementation Details1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article3

Book2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To compute the canonical implication base of the induced context K I we employ the algorithm LinCbO (Janoštík, Konečný, Krajča 2021a. It is based on Close-by-One (CbO) (Kuznetsov 1993) and closures w.r.t.…”

Section: Implementation Detailsmentioning

confidence: 99%

Efficient Axiomatization of OWL 2 EL Ontologies from Data by Means of Formal Concept Analysis

Kriegel

2024

AAAI

View full text Add to dashboard Cite

We present an FCA-based axiomatization method that produces a complete OWL 2 EL TBox (the terminological part of an OWL 2 EL ontology) from a graph dataset in at most exponential time. We describe technical details that allow for efficient implementation as well as variations that dispense with the computation of extremely large axioms, thereby rendering the approach applicable albeit some completeness is lost. Moreover, we evaluate the prototype on real-world datasets.

show abstract

Section: Implementation Detailsmentioning

confidence: 99%