Incremental Answer Set Programming with Overgrounding

DOI10.1017/S1471068419000292zbMath1434.68555arXiv1907.09212OpenAlexW3106212667MaRDI QIDQ5108513

Giovambattista Ianni, Francesco Pacenza, Jessica Zangari, Francesco Calimeri, Simona Perri

Publication date: 4 May 2020

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

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

zbMATH Keywords

knowledge representationanswer set programminggroundingstream reasoningovergroundinginstantiation of logic programs

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items

Unnamed Item ⋮ Managing caching strategies for stream reasoning with reinforcement learning ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications

Uses Software

• Gringo
• MiniZinc
• clasp
• GASP
• WASP
• Clingo
• OMiGA

Cites Work

• Unnamed Item
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Magic sets for disjunctive Datalog programs
• Maintenance of datalog materialisations revisited
• Blending lazy-grounding and CDNL search for answer-set solving
• A lattice-theoretical fixpoint theorem and its applications
• GASP: Answer Set Programming with Lazy Grounding
• Advances in WASP
• Progress in clasp Series 3
• Answer Set Programming: A Primer
• The well-founded semantics for general logic programs
• Ticker: A system for incremental ASP-based stream reasoning
• ASPeRiX, a first-order forward chaining approach for answer set computing
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• Multi-shot ASP solving with clingo
• The Sixth Answer Set Programming Competition
• Logics in Artificial Intelligence
• Lazy Model Expansion by Incremental Grounding
• Computable Functions in ASP: Theory and Implementation