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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Meghyn Bienvenu' in GoogleThis author has not been identified. Look up 'Stanislav Kikot' in GoogleThis author has not been identified. Look up 'Roman Kontchakov' in GoogleThis author has not been identified. Look up 'Vladislav Ryzhikov' in GoogleThis author has not been identified. Look up 'Michael Zakharyaschev' in Google

runs on WebDSL