Eliminating Unfounded Set Checking for HEX-Programs

HEX-programs are an extension of the Answer Set Programming (ASP) paradigm incorporating external means of computation into the declarative programming language through so-called external atoms. Their semantics is defined in terms of minimal models of the Faber-Leone-Pfeifer (FLP) reduct. Developing native solvers for HEX-programs based on an appropriate notion of unfounded sets has been subject to recent research for reasons of efficiency. Although this has lead to an improvement over naive minimality checking using the FLP reduct, testing for foundedness remains a computationally expensive task. In this work we improve on HEX-program evaluation in this respect by identifying a syntactic class of programs, that can be efficiently recognized and allows to entirely skip the foundedness check. Moreover, we develop criteria for decomposing a program into components, such that the search for unfounded sets can be restricted. Observing that our results apply to many HEX-program applications provides analytic evidence for the significance and effectiveness of our approach, which is complemented by a brief discussion of preliminary experimental validation.

[1]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

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

[3]  Wolfgang Faber,et al.  Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates , 2005, LPNMR.

[4]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

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

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

[7]  Mario Alviano,et al.  Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates , 2011, J. Artif. Intell. Res..

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

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

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

[11]  Marc Toussaint,et al.  Proc. of the 19th. International Joint Conference on Artificial Intelligence (IJCAI'05) , 2005 .

[12]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.

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

[14]  Thomas Eiter,et al.  Exploiting conjunctive queries in description logic programs , 2009, Annals of Mathematics and Artificial Intelligence.

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

[16]  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..

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

[18]  Michael Fink,et al.  IMPROVING HEX-PROGRAM EVALUATION BASED ON UNFOUNDED SETS , 2012 .

[19]  Martin Gebser,et al.  Conflict-Driven Disjunctive Answer Set Solving , 2008, KR.

[20]  Thomas Eiter,et al.  Exploiting Unfounded Sets for HEX-Program Evaluation , 2012, JELIA.

[21]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[22]  Antonius Weinzierl,et al.  Finding explanations of inconsistency in multi-context systems , 2010, Artif. Intell..