• Submit to Future Internet Login Register
• MDPI
• Journals A-Z
• For Authors
• For Editors
• About
• Open Access Policy

• Abstract
• Full-Text PDF [295 KB]
• Full-Text XML
• Article Versions Notes

• Article Statistics
• Google Scholar
• Order Reprints

• Cite this article
• Export to BibTeX
• Export to EndNote

• [+] on DOAJ
• Groza, A
• Letia, I
• [+] on Google Scholar
• Groza, A
• Letia, I
• [+] on PubMed
• Groza, A
• Letia, I

•  CiteULike
•  Facebook
•  Mendeley
•  Twitter

This article is

• freely available
• re-usable

Future Internet 2012, 4(4), 865-881; doi:10.3390/fi4040865

Article

Plausible Description Logic Programs for Stream Reasoning

Adrian Groza*  and Ioan Alfred Letia

Department of Computer Science, Technical University of Cluj-Napoca, Memorandumului 28, Cluj-Napoca 400391, Romania

* Author to whom correspondence should be addressed.

Received: 9 August 2012; in revised form: 9 September 2012 / Accepted: 25 September 2012 / Published: 17 October 2012

(This article belongs to the Special Issue Semantic Interoperability and Knowledge Building)

Download PDF Full-Text [295 KB, uploaded 17 October 2012 10:00 CEST]

Abstract: 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.

Keywords: stream reasoning; description logic; plausible logic; lazy evaluation; sensors; Haskell

Article Statistics

Cite This Article