Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints

Aus International Center for Computational Logic
Version vom 16. Oktober 2019, 20:26 Uhr von Bartosz Bednarczyk (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Bartosz |ErsterAutorNachname=Bednarczyk |FurtherAuthors=Sebastian Rudolph; Franz Baader }} {{Inproceedings |Refe…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints

Bartosz BednarczykBartosz Bednarczyk,  Sebastian RudolphSebastian Rudolph,  Franz BaaderFranz Baader
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints


Bartosz Bednarczyk, Sebastian Rudolph, Franz Baader
Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints
In Mantas Simkus, Grant E. Weddell, eds., Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints, volume 2373 of CEUR Workshop Proceedings, June 2019. CEUR-WS.org
  • KurzfassungAbstract
    We consider an expressive description logic (DL) in which the global and local cardinality constraints introduced in previous papers can be mixed. On the one hand, we show that this does not increase the complexity of satisfiability checking and other standard inference problems. On the other hand, conjunctive query entailment in this DL turns out to be undecidable. We prove that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted.
  • Projekt:Project: DeciGUT
  • Forschungsgruppe:Research Group: Computational LogicComputational Logic
@inproceedings{DBLP:conf/dlog/BaaderBR19,
  author    = {Franz Baader and
               Bartosz Bednarczyk and
               Sebastian Rudolph},
  title     = {Satisfiability Checking and Conjunctive Query Answering in Description
               Logics with Global and Local Cardinality Constraints},
  booktitle = {Proceedings of the 32nd International Workshop on Description Logics,
               Oslo, Norway, June 18-21, 2019.},
  year      = {2019},
  crossref  = {DBLP:conf/dlog/2019},
  url       = {http://ceur-ws.org/Vol-2373/paper-3.pdf},
  timestamp = {Fri, 30 Aug 2019 13:15:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/dlog/BaaderBR19},
  bibsource = {dblp computer science bibliography, https://dblp.org} 
}
@proceedings{DBLP:conf/dlog/2019,
  editor    = {Mantas Simkus and
               Grant E. Weddell},
  title     = {Proceedings of the 32nd International Workshop on Description Logics,
               Oslo, Norway, June 18-21, 2019},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {2373},
  publisher = {CEUR-WS.org},
  year      = {2019},
  url       = {http://ceur-ws.org/Vol-2373},
  urn       = {urn:nbn:de:0074-2373-7},
  timestamp = {Fri, 30 Aug 2019 13:15:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/dlog/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org} 
}