Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
From MaRDI portal
Publication:4593048
DOI10.1017/S1471068416000284zbMATH Open1379.68281DBLPjournals/tplp/DodaroGLMRS16arXiv1608.00730OpenAlexW2506402500WikidataQ62043814 ScholiaQ62043814MaRDI QIDQ4593048
Kostyantyn Shchekotykhin, Carmine Dodaro, N. Leone, Benjamin Musitsch, Philip Gasteiger, F. Ricca
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf ASP implementations is not obvious. In this paper the combination of ASP and domain-specific heuristics is studied with the goal of effectively solving real-world problem instances of PUP and CCP. As a byproduct of this activity, the ASP solver WASP was extended with an interface that eases embedding new external heuristics in the solver. The evaluation shows that our domain-heuristic-driven ASP solver finds solutions for all the real-world instances of PUP and CCP ever provided by Siemens. This paper is under consideration for acceptance in TPLP.
Full work available at URL: https://arxiv.org/abs/1608.00730
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Advances in WASP
- Optimization Methods for the Partner Units Problem
- The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Design and results of the Fifth Answer Set Programming Competition
- Progress in clasp Series 3
- Taming primary key violations to query large inconsistent data via ASP
- Generating explanations for biomedical queries
- Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- Improved answer-set programming encodings for abstract argumentation
- Optimizing phylogenetic supertrees using answer set programming
- Combining Heuristics for Configuration Problems Using Answer Set Programming
Cited In (17)
- Combining Heuristics for Configuration Problems Using Answer Set Programming
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
- Partial Compilation of ASP Programs
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Beyond NP: Quantifying over Answer Sets
- Paracoherent answer set computation
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Lifting symmetry breaking constraints with inductive logic programming
- Title not available (Why is that?)
- Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach
- The External Interface for Extending WASP
- Better Paracoherent Answer Sets with Less Resources
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Shared aggregate sets in answer set programming
Uses Software
This page was built for publication: Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593048)
