Incremental maintenance of overgrounded logic programs with tailored simplifications

DOI10.1017/S147106842000040XzbMATH Open1468.68223arXiv2008.04108OpenAlexW3088666520MaRDI QIDQ5140010FDOQ5140010

Authors: Giovambattista Ianni, Francesco Pacenza, Jessica Zangari 

Publication date: 13 December 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. The proposed overgrounded programs with tailoring (OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, our tailored simplification technique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).

Full work available at URL: https://arxiv.org/abs/2008.04108

Recommendations

• Optimized algorithms for incremental analysis of logic programs
• scientific article; zbMATH DE number 1487945
• Incremental analysis of logic programs with assertions and open predicates
• Maintaining distributed logic programs incrementally
• Incremental answer set programming with overgrounding
• scientific article; zbMATH DE number 1104390
• The complexity of revising logic programs
• Logic Programming
• Incremental reasoning on monadic second-order logics with logic programming

zbMATH Keywords

groundingknowledge representationanswer-set programmingstream reasoningovergroundinginstantiation of logic programs

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• GASP: Answer set programming with lazy grounding
• Advances in WASP
• Multi-shot ASP solving with clingo
• Computable Functions in ASP: Theory and Implementation
• Conflict-driven answer set solving: from theory to practice
• Logics in Artificial Intelligence
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• LARS: a logic-based framework for analytic reasoning over streams
• The intelligent grounder of DLV
• Relativized hyperequivalence of logic programs for modular programming
• Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks
• Ticker: a system for incremental ASP-based stream reasoning
• Optimizing answer set computation via heuristic-based decomposition
• Maintenance of datalog materialisations revisited
• Incremental answer set programming with overgrounding
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• A distributed approach to LARS stream reasoning (system paper)

Cited In (1)

• Incremental answer set programming with overgrounding

Uses Software

• GASP
• WASP
• Clingo
• LARS

This page was built for publication: Incremental maintenance of overgrounded logic programs with tailored simplifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140010)