Managing caching strategies for stream reasoning with reinforcement learning
From MaRDI portal
Publication:5140004
Abstract: Efficient decision-making over continuously changing data is essential for many application domains such as cyber-physical systems, industry digitalization, etc. Modern stream reasoning frameworks allow one to model and solve various real-world problems using incremental and continuous evaluation of programs as new data arrives in the stream. Applied techniques use, e.g., Datalog-like materialization or truth maintenance algorithms to avoid costly re-computations, thus ensuring low latency and high throughput of a stream reasoner. However, the expressiveness of existing approaches is quite limited and, e.g., they cannot be used to encode problems with constraints, which often appear in practice. In this paper, we suggest a novel approach that uses the Conflict-Driven Constraint Learning (CDCL) to efficiently update legacy solutions by using intelligent management of learned constraints. In particular, we study the applicability of reinforcement learning to continuously assess the utility of learned constraints computed in previous invocations of the solving algorithm for the current one. Evaluations conducted on real-world reconfiguration problems show that providing a CDCL algorithm with relevant learned constraints from previous iterations results in significant performance improvements of the algorithm in stream reasoning scenarios. Under consideration for acceptance in TPLP.
Recommendations
- A distributed approach to LARS stream reasoning (system paper)
- Ticker: a system for incremental ASP-based stream reasoning
- Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks
- Prediction and explanation over DL-Lite data streams
- Incremental reasoning on monadic second-order logics with logic programming
Cites work
- A distributed approach to LARS stream reasoning (system paper)
- Advances in WASP
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
- Complexity of \(n\)-queens completion
- Efficient SAT solving under assumptions
- Incremental answer set programming with overgrounding
- LARS: a logic-based framework for analytic reasoning over streams
- Multi-shot ASP solving with clingo
- Optimization Methods for the Partner Units Problem
- Reinforcement learning. An introduction
- Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks
- Ticker: a system for incremental ASP-based stream reasoning
- XSB: extending Prolog with tabled logic programming
Cited in
(2)
This page was built for publication: Managing caching strategies for stream reasoning with reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140004)
