Plausible Description Logic Programs for Stream Reasoning
Department of Computer Science, Technical University of Cluj-Napoca, Memorandumului 28, Cluj-Napoca 400391, Romania
*
Author to whom correspondence should be addressed.
Future Internet 2012, 4(4), 865-881; https://doi.org/10.3390/fi4040865
Received: 9 August 2012 / Revised: 9 September 2012 / Accepted: 25 September 2012 / Published: 17 October 2012
(This article belongs to the Special Issue Semantic Interoperability and Knowledge Building)
Sensor networks are estimated to drive the formation of the future Internet, with stream reasoning responsible for analysing sensor data. Stream reasoning is defined as real time logical reasoning on large, noisy, heterogeneous data streams, aiming to support the decision process of large numbers of concurrent querying agents. In this research we exploited non-monotonic rule-based systems for handling inconsistent or incomplete information and also ontologies to deal with heterogeneity. Data is aggregated from distributed streams in real time and plausible rules fire when new data is available. The advantages of lazy evaluation on data streams were investigated in this study, with the help of a prototype developed in Haskell.
View Full-Text
Keywords:
stream reasoning; description logic; plausible logic; lazy evaluation; sensors; Haskell
▼
Show Figures
Figure 1
This is an open access article distributed under the Creative Commons Attribution License
MDPI and ACS Style
Groza, A.; Letia, I.A. Plausible Description Logic Programs for Stream Reasoning. Future Internet 2012, 4, 865-881. https://doi.org/10.3390/fi4040865
AMA Style
Groza A, Letia IA. Plausible Description Logic Programs for Stream Reasoning. Future Internet. 2012; 4(4):865-881. https://doi.org/10.3390/fi4040865
Chicago/Turabian StyleGroza, Adrian; Letia, Ioan Alfred. 2012. "Plausible Description Logic Programs for Stream Reasoning" Future Internet 4, no. 4: 865-881. https://doi.org/10.3390/fi4040865
Find Other Styles
Search more from Scilit
