Advertisement

More About the Language of clingo

  • Vladimir Lifschitz
Chapter

Abstract

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.

References

  1. 20.
    Günther Charwat and Andreas Pfandler. Democratix: A declarative approach to winner determination. In Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT), 2015.Google Scholar
  2. 34.
    Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in Answer Set Programming. Artificial Intelligence, 175:278–298, 2011.MathSciNetCrossRefGoogle Scholar
  3. 37.
    Paolo Ferraris. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 119–131, 2005.Google Scholar
  4. 44.
    Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract gringo. Theory and Practice of Logic Programming, 15:449–463, 2015.MathSciNetCrossRefGoogle Scholar
  5. 50.
    Michael Gelfond and Yulia Kahl. Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press, 2014.CrossRefGoogle Scholar
  6. 51.
    Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Programming Conference and Symposium, pages 1070–1080. MIT Press, 1988.Google Scholar
  7. 52.
    Michael Gelfond and Vladimir Lifschitz. Logic programs with classical negation. In David Warren and Peter Szeredi, editors, Proceedings of International Conference on Logic Programming (ICLP), pages 579–597, 1990.Google Scholar
  8. 55.
    Michael Gelfond and Yuanlin Zhang. Vicious circle principle and logic programs with aggregates. Theory and Practice of Logic Programming, 14(4-5):587–601, 2014.MathSciNetCrossRefGoogle Scholar
  9. 63.
    Amelia Harrison and Vladimir Lifschitz. Relating two dialects of Answer Set Programming. In Proceedings of International Conference on Logic Programming (ICLP), 2019.Google Scholar
  10. 75.
    Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3):499–562, 2006.MathSciNetCrossRefGoogle Scholar
  11. 99.
    Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer, 2000.Google Scholar
  12. 101.
    David Pearce. A new logical characterization of stable models and answer sets. In Jürgen Dix, Luis Pereira, and Teodor Przymusinski, editors, Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57–70. Springer, 1997.Google Scholar
  13. 102.
    David Pearce and Gerd Wagner. Reasoning with negative information I: Strong negation in logic programs. Acta Philosophica Fennica, 49, 1990.Google Scholar
  14. 104.
    Nikolay Pelov, Marc Denecker, and Maurice Bruynooghe. Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming, 7(3):301–353, 2007.MathSciNetCrossRefGoogle Scholar
  15. 106.
    Raymond Reiter. On closed word data bases. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 119–140. Plenum Press, New York, 1978.Google Scholar
  16. 113.
    Tran Cao Son and Enrico Pontelli. A constructive semnatic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming, 7:355–375, 2007.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at AustinAustinUSA

Personalised recommendations