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

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.

[1]  Ilkka Niemelä,et al.  A Module-Based Framework for Multi-language Constraint Modeling , 2009, LPNMR.

[2]  Kewen Wang,et al.  FLP answer set semantics without circular justifications for general logic programs , 2014, Artif. Intell..

[3]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[4]  Robert Hoehndorf,et al.  Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies , 2007, BMC Bioinformatics.

[5]  Michael Gelfond,et al.  Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.

[6]  Dan Brickley,et al.  Resource Description Framework (RDF) Model and Syntax Specification , 2002 .

[7]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[8]  Teodor C. Przymusinski On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[9]  Miroslaw Truszczynski,et al.  Modular Answer Set Solving , 2013, AAAI.

[10]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[11]  Thomas Linke,et al.  Suitable Graphs for Answer Set Programming , 2005, Answer Set Programming.

[12]  Robert A. Kowalski,et al.  Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes) , 1988, ICLP/SPL.

[13]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[14]  Jose M. Such,et al.  International Joint Conference on Artificial Intelligence (IJCAI) , 2016 .

[15]  Ilkka Niemelä,et al.  Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009) , 2009 .

[16]  Jonathan Lawry,et al.  Symbolic and Quantitative Approaches to Reasoning with Uncertainty , 2009 .

[17]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[18]  Thomas Eiter,et al.  Domain expansion for ASP-programs with external sources , 2016, Artif. Intell..

[19]  Giovambattista Ianni,et al.  External sources of knowledge and value invention in logic programming , 2007, Annals of Mathematics and Artificial Intelligence.

[20]  Thomas Eiter,et al.  Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems , 2007, AAAI.

[21]  Stefan Woltran,et al.  Modularity Aspects of Disjunctive Stable Models , 2007, LPNMR.

[22]  Hans Tompits,et al.  Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning , 2006, ESWC.

[23]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[24]  Esra Erdem,et al.  Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[25]  Michael Fink,et al.  HEX Programs with Action Atoms , 2010, ICLP.

[26]  Martin Gebser,et al.  Solution Enumeration for Projected Boolean Search Problems , 2009, CPAIOR.

[27]  Giovambattista Ianni,et al.  Computable Functions in ASP: Theory and Implementation , 2008, ICLP.

[28]  Thomas Eiter,et al.  Answer Set Programming for the Semantic Web , 2007, ICLP.

[29]  Thomas Linke,et al.  Graph Theoretical Characterization and Computation of Answer Sets , 2001, IJCAI.

[30]  Sheila A. McIlraith,et al.  Partition-based logical reasoning for first-order and propositional theories , 2005, Artif. Intell..

[31]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[32]  Jack Minker Foundations of deductive databases and logic programming , 1988 .

[33]  Thomas Eiter,et al.  Efficient HEX-Program Evaluation Based on Unfounded Sets , 2014, J. Artif. Intell. Res..

[34]  Pinar Yolum,et al.  Ranking semantic information for e-government: complaints management , 2008, OBI '08.

[35]  Thomas Eiter,et al.  The mcs-ie System for Explaining Inconsistency in Multi-Context Systems , 2010, JELIA.

[36]  Yuliya Lierler,et al.  Relating constraint answer set programming languages and algorithms , 2014, Artif. Intell..

[37]  Thomas Eiter,et al.  Conflict-driven ASP solving with external sources , 2012, Theory and Practice of Logic Programming.

[38]  Martin Gebser,et al.  Clingo = ASP + Control: Preliminary Report , 2014, ArXiv.

[39]  Eugenia Ternovska,et al.  A Semantic Account for Modularity in Multi-language Modelling of Search Problems , 2011, FroCoS.

[40]  Thomas Eiter,et al.  Decomposition of Declarative Knowledge Bases with External Functions , 2009, IJCAI.

[41]  Martin Gebser,et al.  Constraint Answer Set Solving , 2009, ICLP.

[42]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[43]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[44]  Marcello Balduccini,et al.  Representing Constraint Satisfaction Problems in Answer Set Programming , 2022 .

[45]  Francesco Ricca,et al.  A parallel ASP instantiator based on DLV , 2010, DAMP '10.

[46]  José Júlio Alferes,et al.  Logics in Artificial Intelligence 9th European Conference, Jelia 2004, Lisbon, Portugal, September 27-30, 2004 : Proceedings , 2004 .

[47]  Axel Polleres,et al.  From SPARQL to rules (and back) , 2007, WWW '07.

[48]  Thomas Eiter,et al.  Realizing Default Logic over Description Logic Knowledge Bases , 2009, ECSQARU.

[49]  Yuliya Lierler,et al.  Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration , 2013, ArXiv.

[50]  Li-Yan Yuan,et al.  The loop formula based semantics of description logic programs , 2012, Theor. Comput. Sci..

[51]  Wolfgang L. Zagler,et al.  A Method for Generating CSS to Improve Web Accessibility for Old Users , 2012, ICCHP.

[52]  Torsten Schaub,et al.  ASP modulo CSP: The clingcon system , 2012, Theory and Practice of Logic Programming.

[53]  Michael Fink,et al.  Angry-HEX: An Artificial Player for Angry Birds Based on Declarative Knowledge Bases , 2016, IEEE Transactions on Computational Intelligence and AI in Games.

[54]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[55]  Thomas Eiter,et al.  The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems , 2010, JELIA.

[56]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[57]  Thomas Eiter,et al.  Pushing Efficient Evaluation of HEX Programs by Modular Decomposition , 2011, LPNMR.

[58]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[59]  K. A. Ross Modular stratification and magic sets for DATALOG programs with negation , 1990, PODS 1990.

[60]  Alessandro Dal Palù,et al.  GASP: Answer Set Programming with Lazy Grounding , 2009, Fundam. Informaticae.

[61]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[62]  Peter Schüller,et al.  Levels of Integration between Low-Level Reasoning and Task Planning , 2013, AAAI 2013.

[63]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[64]  Teodor C. Przymusinski Stable semantics for disjunctive programs , 1991, New Generation Computing.

[65]  Tomi Janhunen,et al.  Achieving compositionality of the stable model semantics for smodels programs1 , 2008, Theory and Practice of Logic Programming.