Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Yevgeny Kazakov"'
Autor:
Yevgeny Kazakov, Birte Glimm
Publikováno v:
Reasoning Web. Explainable Artificial Intelligence ISBN: 9783030314224
Reasoning Web
Reasoning Web
Description Logics (DLs) are a family of languages designed to represent conceptual knowledge in a formal way as a set of ontological axioms. DLs provide a formal foundation of the ontology language OWL, which is a W3C standardized language to repres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::576640161dbc3b0bc69037972ff1eca7
https://doi.org/10.1007/978-3-030-31423-1_1
https://doi.org/10.1007/978-3-030-31423-1_1
Autor:
Yevgeny Kazakov, Peter Skočovský
Publikováno v:
Automated Reasoning ISBN: 9783319942049
IJCAR
IJCAR
If a conclusion follows from a set of axioms, then its justification is a minimal subset of axioms for which the entailment holds. An entailment can have several justifications. Such justifications are commonly used for the purpose of debugging of in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07124f5bd15fc3b9d2528ec567c30268
https://doi.org/10.1007/978-3-319-94205-6_40
https://doi.org/10.1007/978-3-319-94205-6_40
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 31
Abstraction refinement is a recently introduced technique using which reasoning over large ABoxes is reduced to reasoning over small abstract ABoxes. Although the approach is sound for any classical Description Logic such as SROIQ, it is complete onl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa00342d2ce50dc2fc2af49d2b29e30
https://doi.org/10.1609/aaai.v31i1.10691
https://doi.org/10.1609/aaai.v31i1.10691
Publikováno v:
Journal of Automated Reasoning. 53:1-61
? $\mathcal {E} \mathcal {L}$ is a simple tractable Description Logic that features conjunctions and existential restrictions. Due to its favorable computational properties and relevance to existing ontologies, ? ? $\mathcal {E} \mathcal {L}$ has bec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a0ca902e6db4a0d69c833267e597cbb
https://doi.org/10.1007/s10817-013-9296-3
https://doi.org/10.1007/s10817-013-9296-3
Autor:
Yevgeny Kazakov, Birte Glimm
Publikováno v:
Logic for Programming, Artificial Intelligence, and Reasoning ISBN: 9783540894384
LPAR
LPAR
We show that adding role conjunctions to the Description Logics (DLs) $\mathcal{SHI}$ and $\mathcal{SHOIF}$ causes a jump in the computational complexity of the standard reasoning tasks from ExpTime -complete to 2ExpTime -complete and from NExpTime -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d8adf491a86fd672e0cd7ac22c365e0
https://ora.ox.ac.uk/objects/uuid:dd5630d9-2fda-454b-ad6f-a0c950431832
https://ora.ox.ac.uk/objects/uuid:dd5630d9-2fda-454b-ad6f-a0c950431832
Autor:
Yevgeny Kazakov
Resolution for the first order logic can be considered as a practical tool for obtaining a decision procedures for some theories (cf. arm). For modal logics, however, there is no uniform formulation of the resolution principle, yet the normal modal l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::df92522e8c70e36aba8c2c751c946d34
https://ora.ox.ac.uk/objects/uuid:cfb73b93-b57b-40ca-a34d-1c79367a647c
https://ora.ox.ac.uk/objects/uuid:cfb73b93-b57b-40ca-a34d-1c79367a647c
Autor:
Yevgeny Kazakov, Hans de Nivelle
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obtain a decision procedure for the guarded fragment with transitive guar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::38e63e3f9e6eb0727dc5679e430313d4
https://ora.ox.ac.uk/objects/uuid:fd2180e8-ce59-41eb-a2f8-8604fc6cfafb
https://ora.ox.ac.uk/objects/uuid:fd2180e8-ce59-41eb-a2f8-8604fc6cfafb
The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use non-simple roles—that is, transitive roles or their super-roles—in number restrictions. When modeling co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0eb4681f3937b65c169216cdf90cc09c
https://ora.ox.ac.uk/objects/uuid:9fefb2f0-816b-41ee-bea7-e14a116441ae
https://ora.ox.ac.uk/objects/uuid:9fefb2f0-816b-41ee-bea7-e14a116441ae
The ability to extract meaningful fragments from an ontology is essential for ontology reuse. We propose a definition of a module that guarantees to completely capture the meaning of a given set of terms, i.e., to include all axioms relevant to the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::82870947aa4884d30c8ec7b1efd8e6e0
https://ora.ox.ac.uk/objects/uuid:f861cc63-ec7e-45af-bf5d-f741f266a5f1
https://ora.ox.ac.uk/objects/uuid:f861cc63-ec7e-45af-bf5d-f741f266a5f1
Autor:
Yevgeny Kazakov, Boris Motik
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlying the Semantic Web ontology language OWLDL. Our procedure is goal-oriented, and it naturally extends a similar procedure for SHIQ, which has proven
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d9ed67b130af33ed9724071ac74fdd98
https://doi.org/10.1007/11814771_53
https://doi.org/10.1007/11814771_53