Abstract gringo
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(41)- Gringo
- What is answer set programming to propositional satisfiability
- Transforming gringo rules into formulas in a natural way
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Infinitary equilibrium logic and strongly equivalent logic programs
- Automated reasoning with restricted intensional sets
- Arguing correctness of ASP programs with aggregates
- Abstract Radices
- Shared aggregate sets in answer set programming
- A trajectory calculus for qualitative spatial reasoning using answer set programming
- Program completion in the input language of GRINGO
- Achievements in answer set programming
- Stable-unstable semantics: Beyond NP with normal logic programs
- Stable models for infinitary formulas with extensional atoms
- Proving infinitary formulas
- ASP-Core-2 input language format
- Train scheduling with hybrid answer set programming
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Strong Equivalence of Logic Programs with Counting
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Towards Verifying Logic Programs in the Input Language of clingo
- Relating two dialects of answer set programming
- Verifying Tight Logic Programs with anthem and vampire
- Multi-shot ASP solving with clingo
- Intelligent Instantiation and Supersafe Rules
- Gelfond-Zhang aggregates as propositional formulas
- Here and There with Arithmetic
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Answer set programming made easy
- Answer set programming for pattern generation in logical analysis of data
- From felicitous models to answer set programming
- Argumentative reasoning in ASPIC^+ under incomplete information
- Decomposition strategies and multi-shot ASP solving for job-shop scheduling
- On the foundations of grounding in answer set programming
- External behavior of a logic program and verification of refactoring
- On program completion, with an application to the sum and product puzzle
- Aggregate semantics for propositional answer set programs
- How to build your own ASP-based system?!
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
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)