[Back]

B. Bliem:
"ASP Programs with Groundings of Small Treewidth";
Talk: Foundations of Information and Knowledge Systems (FOIKS) 2018, Budapest, Hungary; 2018-05-14 - 2018-05-18; in: "Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings", LNCS, 10833 (2018), ISBN: 978-3-319-90049-0; 97 - 113.

Recent experiments have shown ASP solvers to run significantly
faster on ground programs of small treewidth. If possible, it may
therefore be beneficial to write a non-ground ASP encoding such that
grounding it together with an input of small treewidth leads to a propositional
program of small treewidth. In this work, we prove that a class
of non-ground programs called guarded ASP guarantees this property.
Guarded ASP is a subclass of the recently proposed class of connectionguarded
ASP, which is known to admit groundings whose treewidth
depends on both the treewidth and the maximum degree of the input.
Here we show that this dependency on the maximum degree cannot be
dropped. Hence, in contrast to connection-guarded ASP, guarded ASP
promises good performance even if the input has large maximum degree.

Programs; Groundings Small Treewidth

http://dx.doi.org/10.1007/978-3-319-90050-6

https://publik.tuwien.ac.at/files/publik_273256.pdf

Project Head Stefan Woltran:
START