Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirtieth Annual ACM/IEEE Symposium on

Logic in Computer Science (LICS 2015)

Paper: Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (at LICS 2015)

Authors: Meghyn Bienvenu Stanislav Kikot Vladimir V. Podolskii

Abstract

No Abstract Available

BibTeX

  @InProceedings{BienvenuKikotPodols-TreelikeQueriesinOW,
    author = 	 {Meghyn Bienvenu and Stanislav Kikot and Vladimir V. Podolskii},
    title = 	 {Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results},
    booktitle =  {Proceedings of the Thirtieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015)},
    year =	 {2015},
    month =	 {July}, 
    pages =      {317--328},
    location =   {Kyoto, Japan}, 
    publisher =	 {ACM}
  }
   

Last modified: 2026-02-0810:27
Sam Staton