Inproceedings3090: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Claudia Carapelle (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Claudia |ErsterAutorNachname=Carapelle |FurtherAuthors=Anni-Yasmin Turhan; }} {{Inproceedings |Referiert=1 |Tit…“) |
Claudia Carapelle (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorVorname=Claudia | |ErsterAutorVorname=Claudia | ||
|ErsterAutorNachname=Carapelle | |ErsterAutorNachname=Carapelle | ||
|FurtherAuthors=Anni-Yasmin Turhan; | |FurtherAuthors=Anni-Yasmin Turhan; | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 14: | Zeile 14: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D). | |Abstract=Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D). | ||
We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers. | We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers. | ||
|Projekt=HAEC B02 | |Projekt=HAEC B02 | ||
|Forschungsgruppe=Automatentheorie | |Forschungsgruppe=Automatentheorie | ||
|BibTex=@inproceedings{CT2016, | |||
author = {Claudia Carapelle and Anni-Yasmin Turhan}, | |||
title = {Description Logics Reasoning w.r.t. General {TBoxes} is decidable | |||
for Concrete Domains with the {EHD-property.}}, | |||
booktitle = {Proceedings of the 22nd European Conference on Artificial | |||
Intelligence (ECAI 2016)}, | |||
year = {2016}, | |||
month = {September}, | |||
note ={to appear}, | |||
} | |||
}} | }} | ||
Version vom 14. Juni 2016, 16:07 Uhr
Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
Claudia CarapelleClaudia Carapelle, Anni-Yasmin TurhanAnni-Yasmin Turhan
Claudia Carapelle, Anni-Yasmin Turhan
Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), to appear
Description Logics Reasoning w.r.t. General TBoxes is decidable for Concrete Domains with the EHD-property.
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), to appear
- KurzfassungAbstract
Reasoning for Description Logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate a concrete domain D into the well known description logic ALC, we call the resulting logic ALCP(D). We then identify sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. In particular, we show decidability of ALCP(D) for several domains over the integers, for which decidability was open. More generally, this result holds for all negation-closed concrete domains with the EHD-property, which stands for `the existence of a homomorphism is definable'. Such technique has recently been used to show decidability of CTL* with local constraints over the integers. - Projekt:Project: HAEC B02
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{CT2016,
author = {Claudia Carapelle and Anni-Yasmin Turhan},
title = {Description Logics Reasoning w.r.t. General {TBoxes} is decidable
for Concrete Domains with the {EHD-property.
,
booktitle = {Proceedings of the 22nd European Conference on Artificial
Intelligence (ECAI 2016)},
year = {2016},
month = {September},
note ={to appear},
} }}
