Nested HEX-Programs
作者： Thomas Krennwallner , Thomas Eiter , Christoph Redl
DOI:
关键词: Procedural programming 、 Programming language 、 Aggregate (data warehouse) 、 Answer set programming 、 Set (abstract data type) 、 Computer science 、 Feature (linguistics) 、 Remote procedure call 、 Declarative programming 、 Artificial intelligence
摘要: Answer-Set Programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (like remote procedure calls) general. The feature desired for increasing modularity and---assuming proper place---(meta-)reasoning over results. While HEX-programs extend with source access, they do not support of (sub-)programs upfront. We present nested HEX-programs, which serve the feature, a user-friendly manner. Notably, answer sets called sub-programs can be individually accessed. This particularly useful applications that need reason like belief set merging, user-defined aggregate functions, or preferences sets.
harvard.edu
arxiv.org参考文章(10)
Roman Schindlauer, Hans Tompits, Thomas Eiter, Giovambattista Ianni, A uniform integration of higher-order reasoning and external evaluations in answer-set programming international joint conference on artificial intelligence. pp. 90- 96 ,(2005)
Christoph Redl, Thomas Eiter, Thomas Krennwallner, Declarative Belief Set Merging Using Merging Plans Practical Aspects of Declarative Languages. pp. 99- 114 ,(2011) , 10.1007/978-3-642-18378-2_10
Chitta Baral, Juraj Dzifcak, Hiro Takahashi, Macros, macro calls and use of ensembles in modular answer set programming international conference on logic programming. pp. 376- 390 ,(2006) , 10.1007/11799573_28
Stefan Woltran, Hans Tompits, Tomi Janhunen, Emilia Oikarinen, Modularity aspects of disjunctive stable models Journal of Artificial Intelligence Research. ,vol. 35, pp. 813- 857 ,(2009) , 10.1613/JAIR.2810
Thomas Eiter, Georg Gottlob, Helmut Veith, Modular Logic Programming and Generalized Quantifiers international conference on logic programming. ,vol. 1265, pp. 290- 309 ,(1997) , 10.1007/3-540-63255-7_22
Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Semantics and complexity of recursive aggregates in answer set programming Artificial Intelligence. ,vol. 175, pp. 278- 298 ,(2011) , 10.1016/J.ARTINT.2010.04.002
Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damasio, MWeb: A principled framework for modular web rule bases and its semantics ACM Transactions on Computational Logic. ,vol. 12, pp. 17- ,(2011) , 10.1145/1877714.1877723
Gerhard Brewka, Thomas Eiter, Mirosław Truszczyński, Answer set programming at a glance Communications of the ACM. ,vol. 54, pp. 92- 103 ,(2011) , 10.1145/2043174.2043195
James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang, A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning computational intelligence. ,vol. 20, pp. 308- 334 ,(2004) , 10.1111/J.0824-7935.2004.00240.X
David S. Warren, Terrance Swift, XSB: Extending Prolog with Tabled Logic Programming arXiv: Programming Languages. ,(2010)