Islands of tractability for relational constraints: towards dichotomy results for the description logic EL
From MaRDI portal
Publication:2904059
Recommendations
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
- Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
Cited in
(9)- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- On the positive fragment of the polymodal provability logic GLP
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
- A dichotomy for some elementarily generated modal logics
- A note on strictly positive logics and word rewriting systems
- Kripke completeness of strictly positive modal logics over meet-semilattices with operators
- Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
- AN ESCAPE FROM VARDANYAN’S THEOREM
This page was built for publication: Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904059)
