Complexity and compilation of GZ-aggregates in answer set programming

Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. The paper focuses on this proposal, and analyzes the complexity of both coherence testing and cautious reasoning under the new semantics. Some surprising results highlight similarities and differences versus mainstream stable model semantics for aggregates. Moreover, the paper reports on the design of compilation techniques for implementing the new semantics on top of existing ASP solvers, which eventually lead to realize a prototype system that allows for experimenting with Gelfond-Zhang's aggregates. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.

[1]  Joohyung Lee,et al.  System f2lp - Computing Answer Sets of First-Order Formulas , 2009, LPNMR.

[2]  Michael Gelfond,et al.  Vicious Circle Principle and Logic Programs with Aggregates , 2014, Theory and Practice of Logic Programming.

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

[4]  Mario Alviano,et al.  Anytime Computation of Cautious Consequences in Answer Set Programming , 2014, Theory and Practice of Logic Programming.

[5]  Joohyung Lee,et al.  First-Order Semantics of Aggregates in Answer Set Programming Via Modified Circumscription , 2011, AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning.

[6]  Mario Alviano,et al.  Stable Model Semantics of Abstract Dialectical Frameworks Revisited: A Logic Programming Perspective , 2015, IJCAI.

[7]  Miroslaw Truszczynski,et al.  Logic programs with abstract constraint atoms: The role of computations , 2007, Artif. Intell..

[8]  Enrico Pontelli,et al.  A Constructive semantic characterization of aggregates in answer set programming , 2007, Theory Pract. Log. Program..

[9]  Miroslaw Truszczynski,et al.  Properties and Applications of Programs with Monotone and Convex Constraints , 2006, J. Artif. Intell. Res..

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

[11]  Martin Gebser,et al.  Improving the Normalization of Weight Rules in Answer Set Programs , 2014, JELIA.

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

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

[14]  Mario Alviano,et al.  The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics , 2013, LPNMR.

[15]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

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

[17]  Jori Bomanson,et al.  Normalizing Cardinality Rules Using Merging and Sorting Constructions , 2013, LPNMR.

[18]  Tomi Janhunen,et al.  Some (in)translatability results for normal logic programs and propositional theories , 2006, J. Appl. Non Class. Logics.

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

[20]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

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

[22]  Paolo Ferraris,et al.  Logic programs with propositional connectives and aggregates , 2008, TOCL.

[23]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

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

[25]  Mario Alviano,et al.  WASP: A Native ASP Solver Based on Constraint Learning , 2013, LPNMR.

[26]  Gerald Pfeifer,et al.  Design and implementation of aggregate functions in the DLV system* , 2008, Theory and Practice of Logic Programming.

[27]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[28]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.