Multi-shot ASP solving with clingo
From MaRDI portal
Publication:5197744
DOI10.1017/S1471068418000054zbMATH Open1486.68027arXiv1705.09811OpenAlexW2963234253WikidataQ129528853 ScholiaQ129528853MaRDI QIDQ5197744FDOQ5197744
Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Martin Gebser
Publication date: 19 September 2019
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo. Multi-shot ASP solving features grounding and solving processes that deal with continuously changing logic programs. In doing so, they remain operative and accommodate changes in a seamless way. For instance, such processes allow for advanced forms of search, as in optimization or theory solving, or interaction with an environment, as in robotics or query-answering. Common to them is that the problem specification evolves during the reasoning process, either because data or constraints are added, deleted, or replaced. This evolutionary aspect adds another dimension to ASP since it brings about state changing operations. We address this issue by providing an operational semantics that characterizes grounding and solving processes in multi-shot ASP solving. This characterization provides a semantic account of grounder and solver states along with the operations manipulating them. The operative nature of multi-shot solving avoids redundancies in relaunching grounder and solver programs and benefits from the solver's learning capacities. clingo accomplishes this by complementing ASP's declarative input language with control capacities. On the declarative side, a new directive allows for structuring logic programs into named and parameterizable subprograms. The grounding and integration of these subprograms into the solving process is completely modular and fully controllable from the procedural side. To this end, clingo offers a new application programming interface that is conveniently accessible via scripting languages.
Full work available at URL: https://arxiv.org/abs/1705.09811
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- plasp 3: towards effective ASP planning
- External sources of knowledge and value invention in logic programming
- Abstract gringo
- The D-FLAT System for Dynamic Programming on Tree Decompositions
- Advances in WASP
- Integrating ASP into ROS for Reasoning in Robots
- Clingo goes linear constraints over reals and integers
- Clingcon: The next generation
- Moviola: interpreting dynamic logic programs via multi-shot answer set programming
- Implementing Preferences with asprin
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Conflict-driven ASP solving with external sources
- The DLV system for knowledge representation and reasoning
- Conflict-driven answer set solving: from theory to practice
- Solving SAT and SAT Modulo Theories
- Engineering an Incremental ASP Solver
- Temporal induction by incremental SAT solving
- Merging Logic Programs under Answer Set Semantics
- ASP modulo CSP: The clingcon system
- Unsatisfiability-based optimization in clasp
- Solving logic program conflict through strong and weak forgettings
- LUPS -- A language for updating logic programs
- Reactive Answer Set Programming
- Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving
- A Tutorial on Hybrid Answer Set Solving with clingo
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Complexity and compilation of GZ-aggregates in answer set programming
- Logic programming and nonmonotonic reasoning. 14th international conference, LPNMR 2017, Espoo, Finland, July 3--6, 2017. Proceedings
Cited In (65)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders
- Flexible FOND Planning with Explicit Fairness Assumptions
- ASP modulo CSP: The clingcon system.
- ASP Solving for Expanding Universes
- Design and results of the second international competition on computational models of argumentation
- Incremental Answer Set Programming with Overgrounding
- A Distributed Approach to LARS Stream Reasoning (System paper)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Title not available (Why is that?)
- Train Scheduling with Hybrid Answer Set Programming
- ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
- Modelling Multi-Agent Epistemic Planning in ASP
- Title not available (Why is that?)
- An Implementation of Consistency-Based Multi-agent Belief Change Using ASP
- Integrating ASP into ROS for Reasoning in Robots
- Solving projected model counting by utilizing treewidth and its limits
- Learning Boolean controls in regulated metabolic networks: a case-study
- Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Managing caching strategies for stream reasoning with reinforcement learning
- Witnesses for Answer Sets of Logic Programs
- Lifted inference for statistical statements in probabilistic answer set programming
- Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
- FOLASP: FO(·) as Input Language for Answer Set Solvers
- Progress in clasp Series 3
- selp: A Single-Shot Epistemic Logic Program Solver
- A general framework for preferences in answer set programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clingo
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Learning programs by learning from failures
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- DualGrounder: lazy instantiation via clingo multi-shot framework
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Testing in ASP: revisited language and programming environment
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- eclingo : A Solver for Epistemic Logic Programs
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- The External Interface for Extending WASP
- Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells
- Better Paracoherent Answer Sets with Less Resources
- Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention
- ASP for flexible payroll management
- Optimising business process discovery using answer set programming
- Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
- Reactive Answer Set Programming
- Graph-based construction of minimal models
- Statistical statements in probabilistic logic programming
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis
- A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
- Temporal ASP: from logical foundations to practical use with \texttt{telingo}
- Answer set programming made easy
- Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments
- Tackling universal properties of minimal trap spaces of Boolean networks
- On acceptance conditions in abstract argumentation frameworks
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- \textsc{delphic}: practical DEL planning via possibilities
- Generative Datalog and answer set programming (extended abstract)
- Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes
- Reasoning in assumption-based argumentation using tree-decompositions
- Towards a qualitative theory of the interruption of eating behavior change
- Inverse reinforcement learning through logic constraint inference
Uses Software
This page was built for publication: Multi-shot ASP solving with clingo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197744)
