Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Jean Christoph Jung"'
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:6193-6201
The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69518fe96a02698b819c78d6b8e93d7d
https://doi.org/10.1609/aaai.v35i7.16770
https://doi.org/10.1609/aaai.v35i7.16770
Publikováno v:
AAAI
We study two forms of least general generalizations in description logic, the least common subsumer (LCS) and most specific concept (MSC). While the LCS generalizes from examples that take the form of concepts, the MSC generalizes from individuals in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7066c939371f0b45675e46ace790fb91
https://doi.org/10.1609/aaai.v34i03.5675
https://doi.org/10.1609/aaai.v34i03.5675
Publikováno v:
Artificial Intelligence. 314:103808
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44154481a6687ac4facf6b96c6f8c80f
https://doi.org/10.1016/j.artint.2022.103808
https://doi.org/10.1016/j.artint.2022.103808
Publikováno v:
IJCAI
Scopus-Elsevier
Scopus-Elsevier
We consider the problem to learn a concept or a query in the presence of an ontology formulated in the description logic ELr, in Angluin's framework of active learning that allows the learning algorithm to interactively query an oracle (such as a dom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::713d2c22527fecc836fb2a3fbce06a34
https://doi.org/10.24963/ijcai.2021/260
https://doi.org/10.24963/ijcai.2021/260
Publikováno v:
KR
We study the separation of positive and negative data examples in terms of description logic concepts in the presence of an ontology. In contrast to previous work, we add a signature that specifies a subset of the symbols that can be used for separat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f62f2a6bb63d1a689efefbe2c15b0e84
Publikováno v:
Thirty-Second AAAI Conference on Artificial Intelligence
We study query answering in the description logic $\mathcal{SQ}$ supporting qualified number restrictions on both transitive and non-transitive roles. Our main contributions are a tree-like model property for $\mathcal{SQ}$ knowledge bases and, build
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9fab577bba2481150d9552defcb6f78
http://arxiv.org/abs/2011.08816
http://arxiv.org/abs/2011.08816
Publikováno v:
Artificial Intelligence
Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental in applications such as concept learning, reverse engineering of database queries, generating referring expressions, and en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e564a16b7a43c160ee34010b58e87c6d
http://livrepository.liverpool.ac.uk/3092806/1/KR2020separation.pdf
http://livrepository.liverpool.ac.uk/3092806/1/KR2020separation.pdf
Publikováno v:
KR
Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental in applications such as concept learning, reverse engineering of database queries, and generating referring expressions. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4068ae48073cb020961bd07bb4e199e8
https://doi.org/10.24963/kr.2020/52
https://doi.org/10.24963/kr.2020/52
Publikováno v:
KR
We consider fragments of the description logic SHOIF extended with regular expressions on roles. Our main result is that satisfiability and finite satisfiability are decidable in two fragments SHOIF^1 and SHOIF^2, NExpTime-complete for the former and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eabc25633d23612cfd6e37c20854ee5d
https://doi.org/10.24963/kr.2020/53
https://doi.org/10.24963/kr.2020/53
We investigate the decidability and computational complexity of conservative extensions and the related notions of inseparability and entailment in Horn description logics (DLs) with inverse roles. We consider both query conservative extensions, defi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94f741c341dead9387220dc069d51a1c