Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev. Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries. In Alessandro Artale, Birte Glimm, Roman Kontchakov, editors, Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017. Volume 1879 of CEUR Workshop Proceedings, CEUR-WS.org, 2017. [doi]

@inproceedings{BienvenuKKRZ17a,
  title = {Optimal Nonrecursive Datalog Rewritings of Linear TGDs and Bounded (Hyper)Tree-Width Queries},
  author = {Meghyn Bienvenu and Stanislav Kikot and Roman Kontchakov and Vladislav Ryzhikov and Michael Zakharyaschev},
  year = {2017},
  url = {http://ceur-ws.org/Vol-1879/paper64.pdf},
  researchr = {https://researchr.org/publication/BienvenuKKRZ17a},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017},
  editor = {Alessandro Artale and Birte Glimm and Roman Kontchakov},
  volume = {1879},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}