Abstract gringo

DOI10.1017/S1471068415000150zbMATH Open1379.68031arXiv1507.06576MaRDI QIDQ4592989FDOQ4592989

Torsten Schaub, Roland Kaminski, Martin Gebser, Amelia Harrison, Vladimir Lifschitz

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1507.06576

Recommendations

• Program completion in the input language of GRINGO
• Relating two dialects of answer set programming
• ASP-Core-2 input language format
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• Clingo goes linear constraints over reals and integers

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Cites Work

• Nested expressions in logic programs
• Weight constraints as nested expressions
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs
• Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz

Cited In (30)

• Towards Verifying Logic Programs in the Input Language of clingo
• A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
• Intelligent Instantiation and Supersafe Rules
• Stable-unstable semantics: Beyond NP with normal logic programs
• ASP-Core-2 Input Language Format
• Proving infinitary formulas
• Verifying Tight Logic Programs with anthem and vampire
• Train Scheduling with Hybrid Answer Set Programming
• Achievements in answer set programming
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• Answer set programming made easy
• Here and There with Arithmetic
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Abstract Radices
• Gringo
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Multi-shot ASP solving with clingo
• Transforming gringo rules into formulas in a natural way
• Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
• Relating Two Dialects of Answer Set Programming
• Strong Equivalence of Logic Programs with Counting
• Arguing correctness of ASP programs with aggregates
• Program completion in the input language of GRINGO
• Gelfond-Zhang aggregates as propositional formulas
• What is answer set programming to propositional satisfiability
• Automated reasoning with restricted intensional sets
• Shared aggregate sets in answer set programming
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
• Stable models for infinitary formulas with extensional atoms
• Infinitary equilibrium logic and strongly equivalent logic programs

This page was built for publication: Abstract gringo

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592989)