{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/combining-answer-set-programming-and-domain","title":"Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems (Application Paper)","arxiv_id":"1608.00730","date":"2016-08-02","proceeding":null,"authors":["Carmine Dodaro","Philip Gasteiger","Nicola Leone","Benjamin Musitsch","Francesco Ricca","Kostyantyn Shchekotykhin"],"abstract":"Answer Set Programming (ASP) is a popular logic programming paradigm that has\nbeen applied for solving a variety of complex problems. Among the most\nchallenging real-world applications of ASP are two industrial problems defined\nby Siemens: the Partner Units Problem (PUP) and the Combined Configuration\nProblem (CCP). The hardest instances of PUP and CCP are out of reach for\nstate-of-the-art ASP solvers. Experiments show that the performance of ASP\nsolvers could be significantly improved by embedding domain-specific\nheuristics, but a proper effective integration of such criteria in\noff-the-shelf ASP implementations is not obvious. In this paper the combination\nof ASP and domain-specific heuristics is studied with the goal of effectively\nsolving real-world problem instances of PUP and CCP. As a byproduct of this\nactivity, the ASP solver WASP was extended with an interface that eases\nembedding new external heuristics in the solver. The evaluation shows that our\ndomain-heuristic-driven ASP solver finds solutions for all the real-world\ninstances of PUP and CCP ever provided by Siemens. This paper is under\nconsideration for acceptance in TPLP.","url_abs":"http://arxiv.org/abs/1608.00730v1","url_pdf":"http://arxiv.org/pdf/1608.00730v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"combining-answer-set-programming-and-domain","repo_url":"https://github.com/alviano/wasp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}