Skip to main content
×
×
Home

A model building framework for answer set programming with external computations*

  • THOMAS EITER (a1), MICHAEL FINK (a1), GIOVAMBATTISTA IANNI (a2), THOMAS KRENNWALLNER (a3), CHRISTOPH REDL (a3) and PETER SCHÜLLER (a4)...
Abstract

As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information in heterogeneous formats. To cater for this need, hex programs were designed as a generalization of answer set programs with an API style interface that allows to access arbitrary external sources, providing great flexibility. Efficient evaluation of such programs however is challenging, and it requires to interleave external computation and model building; to decide when to switch between these tasks is difficult, and existing approaches have limited scalability in many real-world application scenarios. We present a new approach for the evaluation of logic programs with external source access, which is based on a configurable framework for dividing the non-ground program into possibly overlapping smaller parts called evaluation units. The latter will be processed by interleaving external evaluation and model building using an evaluation graph and a model graph, respectively, and by combining intermediate results. Experiments with our prototype implementation show a significant improvement compared to previous approaches. While designed for hex-programs, the new evaluation approach may be deployed to related rule-based formalisms as well.

Copyright
Footnotes
Hide All
*

This article is a significant extension of Eiter et al. (2011) and parts of Schüller (2012). This work has been supported by the Austrian Science Fund (FWF) Grants P24090 and P27730, and the Scientific and Technological Research Council of Turkey (TUBITAK) Grant 114E430.

Footnotes
References
Hide All
Amir, E. and McIlraith, S. A. 2005. Partition-based logical reasoning for first-order and propositional theories. Artificial Intelligence 162, 1–2, 4988.
Bairakdar, S. E.-D., Dao-Tran, M., Eiter, T., Fink, M. and Krennwallner, T. 2010. The DMCS solver for distributed nonmonotonic multi-context systems. In European Conference on Logics in Artificial Intelligence (JELIA). Springer, 352355.
Balduccini, M. 2009. Representing constraint satisfaction problems in answer set programming. In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP).
Balduccini, M. and Lierler, Y. 2013. Hybrid automated reasoning tools: From black-box to clear-box integration. In Answer Set Programming and Other Computing Paradigms (ASPOCP). 17–31.
Basol, S., Erdem, O., Fink, M. and Ianni, G. 2010. HEX programs with action atoms. In Technical Communications of the International Conference on Logic Programming (ICLP). 24–33.
Bögl, M., Eiter, T., Fink, M. and Schüller, P. 2010. The MCS-IE system for explaining inconsistency in multi-context systems. In European Conference on Logics in Artificial Intelligence (JELIA). 356–359.
Brewka, G. and Eiter, T. 2007. Equilibria in heterogeneous nonmonotonic multi-context systems. In AAAI Conference on Artificial Intelligence. AAAI Press, 385390.
Brewka, G., Eiter, T. and Truszczynski, M. 2011. Answer set programming at a glance. Commun. ACM 54, 12, 92103.
Calimeri, F., Cozza, S. and Ianni, G. 2007. External sources of knowledge and value invention in logic programming. Annals of Mathematics and Artificial Intelligence 50, 3–4, 333361.
Calimeri, F., Cozza, S., Ianni, G. and Leone, N. 2008. Computable functions in ASP: Theory and implementation. In ICLP, Lecture Notes in Computer Science. Springer, 407424.
Calimeri, F., Fink, M., Germano, S., Ianni, G., Redl, C. and Wimmer, A. 2013. AngryHEX: An artificial player for angry birds based on declarative knowledge bases. In National Workshop and Prize on Popularize Artificial Intelligence. 29–35.
Clarke, E., Grumberg, O., Jha, S., Lu, Y. and Veith, H. 2003. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50, 5, 752794.
Dao-Tran, M., Eiter, T. and Krennwallner, T. 2009. Realizing default logic over description logic knowledge bases. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Springer, 602613.
Dung, P. M. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 2, 321357.
Eiter, T., Fink, M., Ianni, G., Krennwallner, T. and Schüller, P. 2011. Pushing efficient evaluation of HEX programs by modular decomposition. In International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 93–106.
Eiter, T., Fink, M. and Krennwallner, T. 2009. Decomposition of declarative knowledge bases with external functions. In International Joint Conference on Artificial Intelligence (IJCAI). AAAI Press, 752758.
Eiter, T., Fink, M., Krennwallner, T. and Redl, C. 2012. Conflict-driven ASP solving with external sources. Theory and Practice of Logic Programming 12, 4–5, 659679.
Eiter, T., Fink, M., Krennwallner, T. and Redl, C. 2013. Liberal safety criteria for HEX-programs. In 27th AAAI Conference (AAAI 2013), July 14–18, 2013, Bellevue, Washington, USA (July 14–18, 2013), desJardins, M. and Littman, M., Eds. AAAI Press.
Eiter, T., Fink, M., Krennwallner, T. and Redl, C. 2014a. Domain expansion for ASP-programs with external sources. Tech. Rep. INFSYS RR-1843-14-02, Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria.
Eiter, T., Fink, M., Krennwallner, T., Redl, C. and Schüller, P. 2014b. Efficient HEX-program evaluation based on unfounded sets. Journal of Artificial Intelligence Research 49, 269321.
Eiter, T., Gottlob, G. and Mannila, H. 1997. Disjunctive datalog. ACM Transactions on Database Systems 22, 3, 364418.
Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R. and Tompits, H. 2008. Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172, 12–13, 14951539.
Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In International Joint Conference on Artificial Intelligence (IJCAI). Professional Book Center, 9096.
Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2006. Effective integration of declarative rules with external evaluations for semantic-web reasoning. In European Semantic Web Conference (ESWC). Springer, 273287.
Faber, W., Leone, N. and Pfeifer, G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In European Conference on Logics in Artificial Intelligence (JELIA). Springer, 200212.
Gebser, M., Kaminski, R., Kaufmann, B. and Schaub, T. 2014. Clingo = ASP + control: Preliminary report. Accessed 24 June 2015. URL: CoRR abs/1405.3694.
Gebser, M., Kaufmann, B. and Schaub, T. 2009a. Solution enumeration for projected boolean search problems. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR). Springer, 7186.
Gebser, M., Kaufmann, B. and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187–188, 5289.
Gebser, M., Ostrowski, M. and Schaub, T. 2009b. Constraint answer set solving. In International Conference on Logic Programming (ICLP). Springer, 235249.
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming: Proceedings of the 5th International Conference and Symposium, Kowalski, R. and Bowen, K., Eds. MIT Press, 10701080.
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3/4, 365386.
Havur, G., Ozbilgin, G., Erdem, E. and Patoglu, V. 2014. Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach. In International Conference on Robotics and Automation (ICRA). 445–452.
Hoehndorf, R., Loebe, F., Kelso, J. and Herre, H. 2007. Representing default knowledge in biomedical ontologies: Application to the integration of anatomy and phenotype ontologies. BMC Bioinformatics 8, 1, 377.
Janhunen, T., Oikarinen, E., Tompits, H. and Woltran, S. 2009. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research 35, 813857.
Järvisalo, M., Oikarinen, E., Janhunen, T. and Niemelä, I. 2009. A module-based framework for multi-language constraint modeling. In Logic Programming and Nonmonotonic Reasoning (LPNMR). 155–168.
Lassila, O. and Swick, R. 1999. Resource description framework (RDF) model and syntax specification. Accessed 24 June 2015. URL: http://www.w3.org/TR/1999/REC-rdf-syntax-19990222.
Lierler, Y. 2014. Relating constraint answer set programming languages and algorithms. Artificial Intelligence 207, 122.
Lierler, Y. and Truszczynski, M. 2013. Modular answer set solving. In Late-Breaking Developments in the Field of Artificial Intelligence, Bellevue, Washington, USA, July 14–18, 2013. AAAI Workshops, vol. WS-13-17. AAAI.
Lifschitz, V. and Turner, H. 1994. Splitting a logic program. In Proceedings ICLP-94. MIT-Press, Santa Margherita Ligure, Italy, 2338.
Linke, T. 2001. Graph theoretical characterization and computation of answer sets. In International Joint Conference on Artificial Intelligence (IJCAI). 641–645.
Linke, T. and Sarsakov, V. 2004. Suitable graphs for answer set programming. In LPAR, Baader, F. and Voronkov, A., Eds. Lecture Notes in Computer Science, vol. 3452. Springer, 154168.
Mellarkod, V. S., Gelfond, M. and Zhang, Y. 2008. Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligenc 53, 1–4, 251287.
Mosca, A. and Bernini, D. 2008. Ontology-driven geographic information system and dlvhex reasoning for material culture analysis. In Italian Workshop RiCeRcA at ICLP.
Niemelä, I. 1999. Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligenc 25, 3–4, 241273.
Oikarinen, E. and Janhunen, T. 2008. Achieving compositionality of the stable model semantics for smodels programs. TPLP 8, 5–6, 717761.
Ostrowski, M. and Schaub, T. 2012. ASP modulo CSP: The clingcon system. Theory and Practice of Logic Programming (TPLP) 12, 4–5, 485503.
Palù, A. D., Dovier, A., Pontelli, E. and Rossi, G. 2009. Gasp: Answer set programming with lazy grounding. Fundamenta Informaticae 96, 3, 297322.
Perri, S., Ricca, F. and Sirianni, M. 2010. A parallel ASP instantiator based on DLV. In Declarative Aspects of Multicore Programming (DAMP'10). LNCS. Springer, 7382.
Polleres, A. 2007. From SPARQL to rules (and back). In International Conference on World Wide Web (WWW). ACM, 787796.
Przymusinski, T. C. 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, Minker, J., Ed. Morgan Kaufman, 193216.
Przymusinski, T. C. 1991. Stable semantics for disjunctive programs. New Generation Computing 9, 401424.
Redl, C. 2014. Answer set programming with external sources: Algorithms and efficient evaluation. Ph.D. thesis, Vienna University of Technology.
Ross, K. 1994. Modular stratification and magic sets for datalog programs with negation. Journal of the ACM 41, 6, 12161267.
Schindlauer, R. 2006. Answer set programming for the semantic web. Ph.D. thesis, Vienna University of Technology, Vienna, Austria.
Schüller, P. 2012. Inconsistency in multi-context systems: Analysis and efficient evaluation. Ph.D. thesis, Vienna University of Technology, Vienna, Austria.
Schüller, P., Patoglu, V. and Erdem, E. 2013. A systematic analysis of levels of integration between low-level reasoning and task planning. In Workshop on Combining Task and Motion Planning at IEEE International Conference on Robotics and Automation (ICRA).
Shen, Y., Wang, K., Eiter, T., Fink, M., Redl, C., Krennwallner, T. and Deng, J. 2014. FLP answer set semantics without circular justifications for general logic programs. Artificial Intelligence 213, 141.
Tasharrofi, S. and Ternovska, E. 2011. A semantic account for modularity in multi-language modelling of search problems. In International Symposium on Frontiers of Combining Systems (FroCoS). 259–274.
Wang, Y., You, J., Yuan, L., Shen, Y. and Zhang, M. 2012. The loop formula based semantics of description logic programs. Theoretical Computer Science 415, 6085.
Zakraoui, J. and Zagler, W. L. 2012. A method for generating CSS to improve web accessibility for old users. In Int. Conf. on Computers Helping People with Special Needs (ICCHP). 329–336.
Zirtiloglu, H. and Yolum, P. 2008. Ranking semantic information for e-government: complaints management. In International Workshop on Ontology-supported business intelligence (OBI). ACM.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Type Description Title
PDF
Supplementary materials

Eiter supplementary material
Online Appendix

 PDF (273 KB)
273 KB

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed