@misc{365,
  author = {Szymon Klarman and Tommie Meyer},
  title = {Complexity of Temporal Query Abduction in DL-Lite},
  abstract = {Temporal query abduction is the problem of hypothesizing a minimal set of temporal data which, given some fixed background knowledge, warrants the entailment of the query. This problem formally underlies a variety of forms of explanatory and diagnostic reasoning in the context of time series data, data streams, or otherwise temporally annotated structured information. In this paper, we consider (temporally ordered) data represented in Description Logics from the popular DLLite family and Temporal Query Language, based on the combination of LTL with conjunctive queries. In this defined setting, we study the complexity of temporal query abduction, assuming different restrictions on the problem and minimality criteria for abductive solutions. As a result, we draw several revealing demarcation lines between NP-, DP- and PSpace-complete variants of the problem.},
  year = {2014},
  journal = {27th International Workshop on Description Logics (DL 2014)},
  number = {233-244},
  month = {17/07 - 20/07},
  url = {http://ceur-ws.org/Vol-1193/paper_45.pdf},
}