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.
This research has been supported by the FWF-projects P27730 and W1255-N23.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Deciding the sufficient and necessary criterion is \(\varPi ^p_2\)-complete for polynomial-time decidable external atoms and thus ill-suited for our aim to improve performance.
References
Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 825–885. IOS Press, Amsterdam (2009)
Dodaro, C., Ricca, F., Schüller, P.: External propagators in WASP: preliminary report. In: Bistarelli, S., Formisano, A., Maratea, M. (eds.) RCRA@AI*IA 2016, CEUR-WS, vol. 1745, pp. 1–9. CEUR-WS.org (2016)
Eiter, T., Fink, M., Krennwallner, T.: Decomposition of declarative knowledge bases with external functions. In: Boutilier, C. (ed.) IJCAI 2009. pp. 752–758 (2009)
Eiter, T., Fink, M., Krennwallner, T., Redl, C., Schüller, P.: Efficient HEX-program evaluation based on unfounded sets. J. Artif. Intell. Res. 49, 269–321 (2014)
Eiter, T., Kaminski, T., Redl, C., Schüller, P., Weinzierl, A.: Answer set programming with external source access. In: Ianni, G., et al. (eds.) Reasoning Web 2017. LNCS, vol. 10370, pp. 204–275. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61033-7_7
Eiter, T., Kaminski, T., Redl, C., Weinzierl, A.: Exploiting partial assignments for efficient evaluation of answer set programs with external source access. J. Artif. Intell. Res. 62, 665–727 (2018)
Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278–298 (2011)
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Carro, M., King, A., Saeedloei, N., Vos, M.D. (eds.) ICLP-TC 2016. OASICS, vol. 52, pp. 2:1–2:15. Schloss Dagstuhl (2016)
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)
Kalinowski, T., Narodytska, N., Walsh, T., Xia, L.: Strategic behavior when allocating indivisible goods sequentially. In: desJardins, M., Littman, M.L. (eds.) AAAI 2013. AAAI Press (2013)
Lierler, Y.: Relating constraint answer set programming languages and algorithms. Artif. Intell. 207, 1–22 (2014)
Lifschitz, V., Turner, H.: Splitting a logic program. In: Hentenryck, P.V. (ed.) ICLP 1994, pp. 23–37. MIT Press (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Eiter, T., Kaminski, T. (2019). Pruning External Minimality Checking for ASP Using Semantic Dependencies. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-20528-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20527-0
Online ISBN: 978-3-030-20528-7
eBook Packages: Computer ScienceComputer Science (R0)