{"type":"ScholarlyArticle","title":"Lazy-Grounding for Answer Set Programs with External Source Access","authors":[{"name":"Thomas Eiter","slug":"thomas-eiter","given":"Thomas","family":"Eiter","affiliation":"Institut für Informationssysteme , Technische Universität Wien Favoritenstraße 9-11 , A-1040 Vienna , Austria"},{"name":"Tobias Kaminski","slug":"tobias-kaminski","given":"Tobias","family":"Kaminski","affiliation":"Institut für Informationssysteme , Technische Universität Wien Favoritenstraße 9-11 , A-1040 Vienna , Austria"},{"name":"Antonius Weinzierl","slug":"antonius-weinzierl","given":"Antonius","family":"Weinzierl","affiliation":"Institut für Informationssysteme , Technische Universität Wien Favoritenstraße 9-11 , A-1040 Vienna , Austria"}],"abstract":"HEX-programs enrich the well-known Answer Set Programming (ASP) paradigm. In HEX, problems are solved using nonmonotonic logic programs with bidirectional access to external sources. ASP evaluation is traditionally based on grounding the input program first, but recent advances in lazy-grounding make the latter also interesting for HEX, as the grounding bottleneck of ASP may be avoided. We explore this issue and present a new evaluation algorithm for HEX-programs based on lazy-grounding solving for ASP. Nonmonotonic dependencies and value invention (i.e., import of new constants) from external sources make an efficient solution nontrivial. However, illustrative benchmarks show a clear advantage of the new algorithm for grounding-intense programs, which is a new perspective to make HEX more suitable for real-world application needs.","doi":"10.24963/ijcai.2017/141","url":"https://ijcai.org/proceedings/2017/141","pdf":"https://ijcai.org/proceedings/2017/0141.pdf","markdown":"https://ijcai.org/proceedings/2017/141.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/141","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":141,"pages":{"first":1015,"last":1022},"keywords":["Constraints and Satisfiability: Solvers and Tools","Knowledge Representation, Reasoning, and Logic: Knowledge Representation Languages","Knowledge Representation, Reasoning, and Logic: Non-monotonic Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Brewka et al., 2016] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming: An in- troduction to the special issue. AI Magazine, 37(3):5-6, 2016.","title":"Answer set programming: An introduction to the special issue","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Dao-Tran et al., 2012] Minh Dao-Tran, Thomas Eiter, Michael Fink, Gerald Weidinger, and Antonius Weinzierl. Omiga : An open minded grounding on-the-fly answer set solver. In Luis Fariñas del Cerro, Andreas Herzig, and Jérôme Mengin, editors, Logics in Artificial Intelligence, JELIA 2012, volume 7519 of LNCS, pages 480-483. Springer, 2012.","title":"Omiga : An open minded grounding on-the-fly answer set solver","authors":"Dao-Tran","year":"2012","venue":"Logics in Artificial Intelligence, JELIA 2012","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Eiter et al., 2005] Thomas Eiter, Giovambattista Ianni, Ro- man Schindlauer, and Hans Tompits. A uniform integra- tion of higher-order reasoning and external evaluations in answer-set programming. In Leslie Pack Kaelbling and Alessandro Saffiotti, editors, International Joint Confer- ence on Artificial Intelligence, IJCAI 2005, pages 90-96. Professional Book Center, 2005.","title":"A uniform integration of higher-order reasoning and external evaluations in answer-set programming","authors":"Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits","year":"2005","venue":"International Joint Conference on Artificial Intelligence, IJCAI 2005","doi":null,"url":null,"internal_url":"/proceedings/2005/169"},{"position":4,"raw":"[Eiter et al., 2014] Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl, and Peter Schüller. Effi- cient HEX-program evaluation based on unfounded sets. J. of Artificial Intelligence Research, 49:269-321, 2014.","title":"Efficient HEX-program evaluation based on unfounded sets","authors":"Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl, Peter Schüller","year":"2014","venue":"J. of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Eiter et al., 2016a] Thomas Eiter, Michael Fink, Giovam- battista Ianni, Thomas Krennwallner, Christoph Redl, and Peter Schüller. A model building framework for an- swer set programming with external computations. TPLP, 16(4):418-464, 2016.","title":"A model building framework for answer set programming with external computations","authors":"Eiter","year":"2016","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Eiter et al., 2016b] Thomas Eiter, Michael Fink, Thomas Krennwallner, and Christoph Redl. Domain expansion for asp-programs with external sources. Artificial Intelligence, 233:84-121, 2016.","title":"Domain expansion for asp-programs with external sources","authors":"Eiter","year":"2016","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Eiter et al., 2016c] Thomas Eiter, Tobias Kaminski, Christoph Redl, and Antonius Weinzierl. Exploiting partial assignments for efficient evaluation of answer set programs with external source access. In Subbarao Kambhampati, editor, International Joint Conference on Artificial Intelligence, IJCAI 2016, pages 1058-1065. IJCAI/AAAI Press, 2016.","title":"Exploiting partial assignments for efficient evaluation of answer set programs with external source access","authors":"Eiter","year":"2016","venue":"International Joint Conference on Artificial Intelligence, IJCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/154"},{"position":8,"raw":"[Eiter et al., 2016d] Thomas Eiter, Christoph Redl, and Pe- ter Schüller. Problem solving using the HEX family. In Christoph Beierle, Gerhard Brewka, and Matthias Thimm, editors, Computational Models of Rationality, Essays ded- icated to Gabriele Kern-Isberner on the occasion of her 60th birthday, pages 150-174. College Publications, 2016.","title":"Problem solving using the HEX family","authors":"Eiter","year":"2016","venue":"Computational Models of Rationality, Essays dedicated to Gabriele Kern-Isberner on the occasion of her 60th birthday","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eiter et al., 2017] Thomas Eiter, Tobias Kaminski, and An- tonius Weinzierl. Lazy-grounding for answer set programs with external source access. Technical Report INFSYS RR-1843-17-01, Institut für Informationssysteme, Tech- nische Universität Wien, Vienna, Austria, June 2017.","title":"Lazy-grounding for answer set programs with external source access","authors":"Thomas Eiter, Tobias Kaminski, Antonius Weinzierl","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erdem et al., 2016] Esra Erdem, Michael Gelfond, and Nicola Leone. Applications of answer set programming. AI Magazine, 37(3):53-68, 2016.","title":"Applications of answer set programming","authors":"Esra Erdem, Michael Gelfond, Nicola Leone","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gebser et al., 2011a] Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Thomas Schneider. Potassco: The potsdam answer set solving collection. AI Commun., 24(2):107-124, 2011.","title":"Potassco: The potsdam answer set solving collection","authors":"Gebser","year":"2011","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gebser et al., 2011b] Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Thomas Schneider. Potassco: The potsdam answer set solving collection. AI Commun., 24(2):107-124, 2011.","title":"Potassco: The potsdam answer set solving collection","authors":"Gebser","year":"2011","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gebser et al., 2012] Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solv- ing: From theory to practice. Artificial Intelligence, 187- 188:52-89, August 2012.","title":"Conflict-driven answer set solving: From theory to practice","authors":"Gebser","year":"2012","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gebser et al., 2015] Martin Gebser, Anna Ryabokon, and Gottfried Schenner. Combining heuristics for config- uration problems using answer set programming. In Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski, editors, Logic Programming and Nonmono- tonic Reasoning, LPNMR 2015. Proceedings, volume 9345 of LNCS, pages 384-397. Springer, 2015.","title":"Combining heuristics for configuration problems using answer set programming","authors":"Gebser","year":"2015","venue":"Logic Programming and Nonmonotonic Reasoning, LPNMR 2015. Proceedings","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro- grams and disjunctive databases. New Generation Computing, 9(3-4):365-386, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kakas et al., 1992] Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive logic programming. J. Log. Comput., 2(6):719-770, 1992.","title":"Abductive logic programming","authors":"C Antonis, Robert A Kakas, Francesca Kowalski, Toni","year":"1992","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kaufmann et al., 2016] Benjamin Kaufmann, Nicola Leone, Simona Perri, and Torsten Schaub. Grounding and solving in answer set programming. AI Magazine, 37(3):25-32, 2016.","title":"Grounding and solving in answer set programming","authors":"Benjamin Kaufmann, Nicola Leone, Simona Perri, Torsten Schaub","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lefèvre and Nicolas, 2009a] Claire Lefèvre and Pascal Nicolas. A First Order Forward Chaining Approach for Answer Set Computing. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Logic Programming and Non- monotonic Reasoning, LPNMR 2009, volume 5753 of LNCS, pages 196-208. Springer, 2009.","title":"A First Order Forward Chaining Approach for Answer Set Computing","authors":"Nicolas ; Lefèvre, Claire Lefèvre, Pascal Nicolas","year":"2009","venue":"Logic Programming and Nonmonotonic Reasoning, LPNMR 2009","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lefèvre and Nicolas, 2009b] Claire Lefèvre and Pascal Nicolas. The First Version of a New ASP Solver: AS- PeRiX. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Logic Programming an Nonmonotonic Reason- ing, LPNMR 2009, volume 5753 of LNCS, pages 522-527. Springer, 2009.","title":"The First Version of a New ASP Solver: AS-PeRiX","authors":"Nicolas ; Lefèvre, Claire Lefèvre, Pascal Nicolas","year":"2009","venue":"Logic Programming an Nonmonotonic Reasoning, LPNMR 2009","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lefèvre et al., 2017] Claire Lefèvre, Christopher Béatrix, Igor Stéphan, and Laurent Garcia. Asperix, a first-order forward chaining approach for answer set computing. TPLP, pages 1-45, January 2017.","title":"Asperix, a first-order forward chaining approach for answer set computing","authors":"Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Palù et al., 2009] Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, and Gianfranco Rossi. Gasp: Answer set programming with lazy grounding. Fundamenta Informat- icae, 96(3):297-322, 2009.","title":"Gasp: Answer set programming with lazy grounding","authors":"Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi","year":"2009","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Redl, 2016] Christoph Redl. The DLVHEX system for knowledge representation: Recent advances (system de- scription). CoRR, abs/1607.08864, 2016.","title":"The DLVHEX system for knowledge representation: Recent advances (system description)","authors":"Christoph Redl","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Soininen et al., 2001] Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Representing configuration knowledge with weight constraint rules. In Alessandro Provetti and Tran Cao Son, editors, Answer Set Program- ming, ASP'01 Workshop 2001, 2001.","title":"Representing configuration knowledge with weight constraint rules","authors":"Timo Soininen, Ilkka Niemelä, Juha Tiihonen, Reijo Sulonen","year":"2001","venue":"Answer Set Programming, ASP'01 Workshop 2001","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Weinzierl, 2017] Antonius Weinzierl. Blending lazy- grounding and CDNL search for answer-set solving. In Logic Programming and Nonmonotonic Reasoning, LP- NMR 2017, LNCS. Springer, 2017. To appear.","title":"Blending lazygrounding and CDNL search for answer-set solving","authors":"Antonius Weinzierl, Weinzierl","year":"2017","venue":"Logic Programming and Nonmonotonic Reasoning","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}