More About the Language of clingo

The programming constructs described below significantly extend the expressive possibilities of the language used Chaps. 2 and 3. The first three sections are about aggregates—functions that apply to sets. Then we show how clingo can be used to solve combinatorial optimization problems and discuss clingo programs with symbolic functions and classical negation.

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

[2]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach , 2014 .

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

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

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

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

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

[8]  Andreas Pfandler,et al.  Democratix: A Declarative Approach to Winner Determination , 2015, ADT.

[9]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[10]  Vladimir Lifschitz,et al.  Relating Two Dialects of Answer Set Programming , 2019, Theory Pract. Log. Program..

[11]  I. Niemelä,et al.  Extending the Smodels system with cardinality and weight constraints , 2001 .

[12]  Martin Gebser,et al.  Abstract gringo , 2015, Theory Pract. Log. Program..

[13]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.