lpopt: A Rule Optimization Tool for Answer Set Programming
Autor: | Michael Morak, Manuel Bichler, Stefan Woltran |
---|---|
Rok vydání: | 2020 |
Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Computer Science - Programming Languages Algebra and Number Theory Syntax (programming languages) Computer Science - Artificial Intelligence Computer science Programming language 0102 computer and information sciences Arithmetic expressions computer.software_genre 01 natural sciences Logic in Computer Science (cs.LO) Theoretical Computer Science Answer set programming Artificial Intelligence (cs.AI) Computational Theory and Mathematics 010201 computation theory & mathematics Order (business) computer Logic programming Programming Languages (cs.PL) Information Systems |
Zdroj: | Fundamenta Informaticae. 177:275-296 |
ISSN: | 1875-8681 0169-2968 |
DOI: | 10.3233/fi-2020-1990 |
Popis: | State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs. The size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce lpopt, a tool that decomposes large logic programming rules into smaller rules that are easier to handle for current solvers. The tool is specifically tailored to handle the standard syntax of the ASP language (ASP-Core) and makes it easier for users to write efficient and intuitive ASP programs, which would otherwise often require significant hand-tuning by expert ASP engineers. It is based on an idea proposed by Morak and Woltran (2012) that we extend significantly in order to handle the full ASP syntax, including complex constructs like aggregates, weak constraints, and arithmetic expressions. We present the algorithm, the theoretical foundations on how to treat these constructs, as well as an experimental evaluation showing the viability of our approach. Comment: Pre-proceedings paper presented at the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, Scotland UK, 6-8 September 2016 (arXiv:1608.02534), 14 pages, LaTeX, 2 figures |
Databáze: | OpenAIRE |
Externí odkaz: |
načítá se...