License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.17
URN: urn:nbn:de:0030-drops-67306
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6730/
Go to the corresponding OASIcs Volume Portal


Arias, JoaquĆ­n

Tabled CLP for Reasoning Over Stream Data

pdf-format:
OASIcs-ICLP-2016-17.pdf (0.5 MB)


Abstract

The interest in reasoning over stream data is growing as quickly as the amount of data generated. Our intention is to change the way stream data is analyzed. This is an important problem because we constantly have new sensors collecting information, new events from electronic devices and/or from customers and we want to reason about this information. For example, information about traffic jams and costumer order could be used to define a deliverer route. When there is a new order or a new traffic jam, we usually restart from scratch in order to recompute the route. However, if we have several deliveries and we analyze the information from thousands of sensors, we would like to reduce the computation requirements, e.g. reusing results from the previous computation. Nowadays, most of the applications that analyze stream data are specialized for specific problems (using complex algorithms and heuristics) and combine a computation language with a query language. As a result, when the problems become more complex (in e.g. reasoning requirements), in order to modify the application complex and error prone coding is required.

We propose a framework based on a high-level language rooted in logic and constraints that will be able to provide customized services to different problems. The framework will discard wrong solutions in early stages and will reuse previous results that are still consistent with the current data set. The use of a constraint logic programming language will make it easier to translate the problem requirements into the code and will minimize the amount of re-engineering needed to comply with the requirements when they change.

BibTeX - Entry

@InProceedings{arias:OASIcs:2016:6730,
  author =	{Joaqu{\'i}n Arias},
  title =	{{Tabled CLP for Reasoning Over Stream Data}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{17:1--17:8},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6730},
  URN =		{urn:nbn:de:0030-drops-67306},
  doi =		{10.4230/OASIcs.ICLP.2016.17},
  annote =	{Keywords: logic, languages, tabling, constraints, graph, analysis, reasoning}
}

Keywords: logic, languages, tabling, constraints, graph, analysis, reasoning
Collection: Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)
Issue Date: 2016
Date of publication: 11.11.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI