Multi-shot ASP solving with clingo

From MaRDI portal
Publication:5197744

DOI10.1017/S1471068418000054zbMath1486.68027arXiv1705.09811OpenAlexW2963234253WikidataQ129528853 ScholiaQ129528853MaRDI QIDQ5197744

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)

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



Related Items

Efficient Knowledge Compilation Beyond Weighted Model Counting, Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling, Witnesses for Answer Sets of Logic Programs, Integrating ASP into ROS for Reasoning in Robots, ASP Solving for Expanding Universes, Progress in clasp Series 3, An Implementation of Consistency-Based Multi-agent Belief Change Using ASP, ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories, Learning Boolean controls in regulated metabolic networks: a case-study, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, Flexible FOND Planning with Explicit Fairness Assumptions, Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming, Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells, Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention, FOLASP: FO(·) as Input Language for Answer Set Solvers, Lifted inference for statistical statements in probabilistic answer set programming, A general framework for preferences in answer set programming, Solving projected model counting by utilizing treewidth and its limits, Better Paracoherent Answer Sets with Less Resources, Incremental Answer Set Programming with Overgrounding, A Distributed Approach to LARS Stream Reasoning (System paper), Towards a qualitative theory of the interruption of eating behavior change, Inverse reinforcement learning through logic constraint inference, 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, Statistical statements in probabilistic logic programming, Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy, ASP for flexible payroll management, Optimising business process discovery using answer set programming, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Modelling Multi-Agent Epistemic Planning in ASP, Managing caching strategies for stream reasoning with reinforcement learning, Incremental maintenance of overgrounded logic programs with tailored simplifications, Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints, eclingo : A Solver for Epistemic Logic Programs, Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms, Design and results of the second international competition on computational models of argumentation, Optimizing Answer Set Computation via Heuristic-Based Decomposition, The External Interface for Extending WASP, selp: A Single-Shot Epistemic Logic Program Solver, A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders, Train Scheduling with Hybrid Answer Set Programming, Reactive Answer Set Programming, Learning programs by learning from failures, 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, DualGrounder: lazy instantiation via clingo multi-shot framework, A multi-shot ASP encoding for the aircraft routing and maintenance planning problem, Clingo, A parallel memory-efficient epistemic logic program solver: harder, better, faster, Graph-based construction of minimal models


Uses Software


Cites Work