Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Issue on the 26th International Symposium on Logic-Based Program Synthesis and Transformation: LOPSTR 2016
Guest editors: Manuel Hermenegildo, Pedro López-García, Alberto Pettorossi and Maurizio Proietti
Article type: Research Article
Authors: Bichler, Manuela | Morak, Michaelb; * | Woltran, Stefanc
Affiliations: [a] TU Wien, Vienna, Austria. [email protected] | [b] University of Klagenfurt, Austria. [email protected] | [c] TU Wien, Vienna, Austria. [email protected]
Correspondence: [*] Address for correspondence: University of Klagenfurt, Universitaetsstrasse 65-67, 9020 Klagenfurt, Austria.
Abstract: 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 handtuning 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.
Keywords: Logic Programming, Answer Set Programming, Rule Decomposition, Tree Decomposition, Preprocessing
DOI: 10.3233/FI-2020-1990
Journal: Fundamenta Informaticae, vol. 177, no. 3-4, pp. 275-296, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]