Ticker: A system for incremental ASP-based stream reasoning*

  title={Ticker: A system for incremental ASP-based stream reasoning*},
  author={Harald Beck and Thomas Eiter and Christian Folie},
  journal={Theory and Practice of Logic Programming},
  pages={744 - 763}
Abstract In 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… 

Multi-Shot Stream Reasoning in Answer Set Programming: A Preliminary Report

This paper presents an exhaustive update to the stream reasoning approach that leverages multi-shot solving, and describes the implementation of the stream reasoner's architecture, and illustrates its workflow via job shop scheduling as a running example.

ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding

This work presents a new incremental reasoner obtained from the evolution of DLV2 towards multi-shot reasoning, and describes the system, its usage, its applicability and performance in some practically relevant domains.

Distributed Stream Reasoning with LARS and ASP (Extended Abstract)

A novel approach to stream reasoning employing a distributed architecture that (i) allows for a better performance than specific reasoners supporting the same LARS subset, and (ii) supports all features of the LARS language including integrity constraints.

Incremental maintenance of overgrounded logic programs with tailored simplifications

This paper formally introduces tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and they are described and their properties are described.

Enhancing the scalability of expressive stream reasoning via input-driven parallelization

This work designs an algorithm to analyze input dependency so as to enable parallel execution and combine the results of a rule layer based on a fragment of Answer Set Programming (ASP), and provides a proof of correctness for the approach.

Incremental Answer Set Programming with Overgrounding

This work presents the theoretical basis of the proposed incremental grounding technique, illustrates the consequent repeated evaluation strategy and reports about the authors' experiments.

A Distributed Approach to LARS Stream Reasoning (System paper)

Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing.

Stream query processor Query Non-monotonic Rule Engine Logic Program Web of Data Solutions Data Format Processor Filtered Stream Facts Data Format Processor Stream Rule Answer Sets Reasoner

This paper designs an algorithm to analyze input dependency so as to enable parallel execution and combine the results of a rule layer based on a fragment of Answer Set Programming (ASP), and provides a proof of correctness for the approach.

Managing caching strategies for stream reasoning with reinforcement learning

A novel approach that uses the Conflict-Driven Constraint Learning (CDCL) to efficiently update legacy solutions by using intelligent management of learned constraints and the applicability of reinforcement learning to continuously assess the utility of learning constraints computed in previous invocations of the solving algorithm for the current one is suggested.



Answer Update for Rule-Based Stream Reasoning

It is shown how an answer stream (model) of a LARS program can be incrementally adjusted to new or outdated input by extending truth maintenance techniques.

Incremental Reasoning on Streams and Rich Background Knowledge

This article presents a technique for Stream Reasoning, consisting in incremental maintenance of materializations of ontological entailments in the presence of streaming information that exploits the nature of streaming data in order to efficiently maintain materialized views of RDF triples, which can be used by a reasoner.

Clingo = ASP + Control: Preliminary Report

By strictly separating logic and control programs, clingo 4 also abolishes the need for dedicated systems for incremental and reactive reasoning, like iclingo and oclingo, respectively, and its flexibility goes well beyond the advanced yet still rigid solving processes of the latter.

Stream Reasoning with Answer Set Programming: Preliminary Report

This work develops new techniques that allow us to formulate problem encodings dealing with emerging as well as expiring data in a seamless way and proposes novel language constructs and modeling techniques for specifying and reasoning with time-decaying logic programs.

Maintaining views incrementally

A counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view, and shows that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple.

A Truth Maintenance System

  • J. Doyle
  • Computer Science
    Artif. Intell.
  • 1979

Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving

A hands-on introduction to multi-shot solving with clingoi¾?4 by modeling the popular board game of Ricochet Robots by means of a simple stateful semantics along with operations reflecting clingoi-ASP functionalities and semantic underpinnings are provided.

Logical Foundations of Continuous Query Languages for Data Streams

This paper shows that the banning of blocking queries and the fact that stream data are ordered by their arrival timestamps represent major new aspects that have yet to be characterized by simple theories, and shows that these new requirements can be modeled using the familiar deductive database concepts of closed-world assumption and explicit local stratification.

Reactive Answer Set Programming

The first approach to Reactive Answer Set Programming is introduced, aiming at reasoning about real-time dynamic systems running online in changing environments and laying the theoretical foundations by appeal to module theory.