scholarly journals Ticker: A system for incremental ASP-based stream reasoning

2017 ◽  
Vol 17 (5-6) ◽  
pp. 744-763 ◽  
Author(s):  
HARALD BECK ◽  
THOMAS EITER ◽  
CHRISTIAN FOLIE

AbstractIn complex reasoning tasks, as expressible by Answer Set Programming (ASP), problems often permit for multiple solutions. In dynamic environments, where knowledge is continuously changing, the question arises how a given model can be incrementally adjusted relative to new and outdated information. This paper introduces Ticker, a prototypical engine for well-defined logical reasoning over streaming data. Ticker builds on a practical fragment of the recent rule-based language LARS, which extends ASP for streams by providing flexible expiration control and temporal modalities. We discuss Ticker's reasoning strategies: first, the repeated one-shot solving mode calls Clingo on an ASP encoding. We show how this translation can be incrementally updated when new data is streaming in or time passes by. Based on this, we build on Doyle's classic justification-based truth-maintenance system to update models of non-stratified programs. Finally, we empirically compare the obtained evaluation mechanisms.

2011 ◽  
Vol 20 (02) ◽  
pp. 349-366 ◽  
Author(s):  
KEEHYUNG KIM ◽  
HYUKGEUN CHOI ◽  
RI (BOB) McKAY

In a complex crime scene with many possible suspects and conflicting evidence, crime investigation requires scientific and logical steps to narrow down the suspects. Since human investigators have difficulty in fully handling all reasoning in this highly complex hypothesis space, we propose a decision support system to aid the investigation process. The system integrates a rule-based reasoner, a Bayesian network for criminal profiling, and an assumption-based truth maintenance system for evidential reasoning to determine the most plausible suspect. The reasoning process reasons about a profiling classification and an alibi credibility measure. It proved effective in a realistic simulation.


Author(s):  
Ranko Vujosevic ◽  
Andrew Kusiak

Abstract The data base requirements for concurrent design systems are discussed. An object-oriented data base, which allows for definition of complex objects, specification of relationships between objects, and modular expandability without affecting the existing information is defined. The data base is developed based on the object-oriented data model implemented in Smalltalk-80. An assumption-based truth maintenance system for maintaining the dependency relationships between design and manufacturing information is described.


2012 ◽  
pp. 211-218 ◽  
Author(s):  
Agostino Poggi ◽  
Michele Tomaiuolo

Expert systems are successfully applied to a number of domains. Often built on generic rule-based systems, they can also exploit optimized algorithms. On the other side, being based on loosely coupled components and peer to peer infrastructures for asynchronous messaging, multi-agent systems allow code mobility, adaptability, easy of deployment and reconfiguration, thus fitting distributed and dynamic environments. Also, they have good support for domain specific ontologies, an important feature when modelling human experts’ knowledge. The possibility of obtaining the best features of both technologies is concretely demonstrated by the integration of JBoss Rules, a rule engine efficiently implementing the Rete-OO algorithm, into JADE, a FIPA-compliant multi-agent system.


Author(s):  
Jeremy Straub

This article presents a multi-goal solver for problems that can be modeled using a Blackboard Architecture. The Blackboard Architecture can be used for data fusion, robotic control and other applications. It combines the rule-based problem analysis of an expert system with a mechanism for interacting with its operating environment. In this context, numerous control or domain (system-subject) problems may exist which can be solved through reaching one of multiple outcomes. For these problems which have multiple solutions, any of which constitutes an end-goal, a solving mechanism which is solution-choice-agnostic and finds the lowest-cost path to the lowest-cost solution is required. Such a solver mechanism is presented and characterized herein. The performance of the solver (including both the computational time required to ascertain a solution and execute it) is compared to the naïve Blackboard approach. This performance characterization is performed across multiple levels of rule counts and rule connectivity. The naïve approach is shown to generate a solution faster, but the solutions generated by this approach, in most cases, are inferior to those generated by the solver.


Author(s):  
Harald Beck ◽  
Bruno Bierbaumer ◽  
Minh Dao-Tran ◽  
Thomas Eiter ◽  
Hermann Hellwagner ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document