Title: | Pruning External Minimality Checking for ASP Using Semantic Dependencies | Authors: | Eiter, Thomas ![]() Kaminski, Tobias Dietmar |
Keywords: | Knowledge Representation and Reasoning; Logic Programming; Answer Set Programming | Issue Date: | 12-May-2019 | Book Title: | Logic Programming and Nonmonotonic Reasoning | Abstract: | HEX-programs integrate external computations in ASP. For HEX-evaluation, an external (e)-minimality check is required to prevent cyclic justifications via external sources. As the check is a bottleneck in practice, syntactic information about atom dependencies has been used previously to detect when the check can be avoided. However, the approach largely overapproximates the real dependencies due to the black-box nature of external sources. We show how the dependencies can be approximated more closely by exploiting semantic information, which significantly increases pruning of e-minimality checking. Moreover, we analyze checking and optimization of semantic dependency information. An empirical evaluation exhibits a clear benefit of this approach. |
URI: | http://hdl.handle.net/20.500.12708/16727 http://dx.doi.org/10.34726/721 |
DOI: | 10.34726/721 | Organisation: | E192 - Institut für Logic and Computation | License: | Urheberrechtsschutz 1.0 | Publication Type: | Inproceedings Konferenzbeitrag |
Appears in Collections: | Conference Paper |
Files in this item:
File | Description | Size | Format | |
---|---|---|---|---|
PruningExternalMinimalityChecking.pdf | 418.05 kB | Adobe PDF | ![]() View/Open |
Page view(s)
23
checked on Feb 26, 2021
Download(s)
11
checked on Feb 26, 2021

Google ScholarTM
Check
Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.