Hostname: page-component-7dd5485656-hw7sx Total loading time: 0 Render date: 2025-10-29T18:17:47.671Z Has data issue: false hasContentIssue false
  • English
  • Français

Abstract gringo

Published online by Cambridge University Press:  03 September 2015

MARTIN GEBSER ,
AMELIA HARRISON ,
ROLAND KAMINSKI ,
VLADIMIR LIFSCHITZ  and
TORSTEN SCHAUB
MARTIN GEBSER
Affiliation:
Aalto University, HIIT, Finland University of Potsdam, Germany (e-mail: gebser@cs.uni-potsdam.de)
AMELIA HARRISON
Affiliation:
Univeristy of Texas at Austin, USA (e-mail: ameliaj@cs.utexas.edu)
ROLAND KAMINSKI
Affiliation:
University of Potsdam, Germany (e-mail: kaminski@cs.uni-potsdam.de)
VLADIMIR LIFSCHITZ
Affiliation:
Univeristy of Texas at Austin, USA (e-mail: vl@cs.utexas.edu)
TORSTEN SCHAUB
Affiliation:
University of Potsdam, Germany INRIA Rennes, France (e-mail: torsten@cs.uni-potsdam.de)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper defines the syntax and semantics of the input language of the ASP grounder gringo. The definition covers several constructs that were not discussed in earlier work on the semantics of that language, including intervals, pools, division of integers, aggregates with non-numeric values, and lparse-style aggregate expressions. The definition is abstract in the sense that it disregards some details related to representing programs by strings of ASCII characters. It serves as a specification for gringo from Version 4.5 on.

Information

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 15 , Special Issue 4-5: 31st International Conference on Logic Programming , July 2015 , pp. 449 - 463
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F. and Schaub, T. 2012. ASP-Core-2: Input language format. Available at https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.0.pdf.Google Scholar
Ferraris, P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 119–131.CrossRefGoogle Scholar
Ferraris, P. and Lifschitz, V. 2005. Weight constraints as nested expressions. Theory and Practice of Logic Programming 5, 1–2, 45–74.CrossRefGoogle Scholar
Gebser, M., Kaminski, R., Kaufmann, B. and Schaub, T. 2011. Challenges in answer set solving. In Logic programming, knowledge representation, and nonmonotonic reasoning. Springer, 74–90.CrossRefGoogle Scholar
Harrison, A., Lifschitz, V., Pearce, D. and Valverde, A. 2015. Infinitary equilibrium logic and strong equivalence. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). http://www.cs.utexas.edu/users/vl/papers/iel_lpnmr.pdf; to appear.CrossRefGoogle Scholar
Harrison, A., Lifschitz, V. and Yang, F. 2014. The semantics of Gringo and infinitary propositional formulas. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR).Google Scholar
Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541.CrossRefGoogle Scholar
Lifschitz, V., Tang, L. R. and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369–389.CrossRefGoogle Scholar
Truszczynski, M. 2012. Connecting first-order ASP and the logic FO(ID) through reducts. In Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz, Erdem, E., Lee, J., Lierler, Y., and Pearce, D., Eds. Springer, 543–559.CrossRefGoogle Scholar
Supplementary material: PDF

Gebser supplementary material

Online Appendix

Download Gebser supplementary material(PDF)
PDF 207.7 KB