Inproceedings3361: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Keine Bearbeitungszusammenfassung
Keine Bearbeitungszusammenfassung
 
Zeile 9: Zeile 9:
|To appear=0
|To appear=0
|Year=2023
|Year=2023
|Booktitle=Proceedings of the 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Booktitle=Proceedings of the 18th European Conference on Logics in Artificial Intelligence (JELIA 2023)
|Publisher=Springer International Publishing
|Pages=369-384
|Publisher=Springer
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Editor=Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz
|Series=Lecture Notes in Computer Science
|Series=Lecture Notes in Artificial Intelligence
|Volume=14281
}}
}}
{{Publikation Details
{{Publikation Details
Zeile 18: Zeile 20:
|Download=Jelia23LR.pdf
|Download=Jelia23LR.pdf
|Slides=LR-JELIA23-talk.pdf
|Slides=LR-JELIA23-talk.pdf
|DOI Name=10.1007/978-3-031-43619-2_26
|Projekt=DeciGUT
|Projekt=DeciGUT
|Forschungsgruppe=Computational Logic
|Forschungsgruppe=Computational Logic
}}
}}

Aktuelle Version vom 23. September 2023, 17:14 Uhr

Toggle side column

Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets

Tim LyonTim Lyon,  Sebastian RudolphSebastian Rudolph
Tim Lyon, Sebastian Rudolph
Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
In Sarah Alice Gaggl, Maria Vanina Martinez, Magdalena Ortiz, eds., Proceedings of the 18th European Conference on Logics in Artificial Intelligence (JELIA 2023), volume 14281 of Lecture Notes in Artificial Intelligence, 369-384, 2023. Springer
  • KurzfassungAbstract
    This paper establishes alternative characterizations of very expressive classes of existential rule sets with decidable query entailment. We consider the notable class of greedy bounded-treewidth sets (gbts) and a new, generalized variant, called weakly gbts (wgbts). Revisiting and building on the notion of derivation graphs, we define (weakly) cycle-free derivation graph sets ((w)cdgs) and employ elaborate proof-theoretic arguments to obtain that gbts and cdgs coincide, as do wgbts and wcdgs. These novel characterizations advance our analytic proof-theoretic understanding of existential rules and will likely be instrumental in practice.
  • Projekt:Project: DeciGUT
  • Forschungsgruppe:Research Group: Computational LogicComputational Logic
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-031-43619-2_26.
@inproceedings{LR2023,
  author    = {Tim Lyon and Sebastian Rudolph},
  title     = {Derivation-Graph-Based Characterizations of Decidable Existential
               Rule Sets},
  editor    = {Sarah Alice Gaggl and Maria Vanina Martinez and Magdalena Ortiz},
  booktitle = {Proceedings of the 18th European Conference on Logics in
               Artificial Intelligence (JELIA 2023)},
  series    = {Lecture Notes in Artificial Intelligence},
  volume    = {14281},
  publisher = {Springer},
  year      = {2023},
  pages     = {369-384},
  doi       = {10.1007/978-3-031-43619-2_26}
}