Citation Context

...ion A distinguishing feature of Answer Set Programming (ASP; [1]) is its highly declarative modeling language along with its domain-independent grounding systems, like lparse [2], dlv [3], and gringo =-=[4]-=-. This paper is dedicated to the features of the new major release of gringo, starting with version 3. Most notably, this series only stipulates rules to be safe (cf. [5]) rather than λ-restricted [6]...

Citation Context

...15, 16] or, in more generality, in the field of SAT modulo theories. In what follows, we expect the reader to be familiar with ASP (cf. [2]) as well as the input language of lparse [17, 18] or gringo =-=[19, 20]-=-. ⋆ Affiliated with the School of Computing Science at Simon Fraser University, Burnaby, Canada, and the Institute for Integrated and Intelligent Systems at Griffith University, Brisbane, Australia.2...

Citation Context

... the library BioASP, written in Python. It provides functionalities for parsing biological inputs in several formats and transforming them into ASP facts, and it encapsulates the grounder gringo [8], =-=[9]-=- as well as the solvers clasp and claspD. In particular, encapsulating objects can be fed with logic programs describing different tasks, be launched with dedicated parameter settings, and pass on res...

Citation Context

... two approaches are compared on the basis how well they can catch such faults. 2 Background We deal with a class of logic programs that corresponds to the ground fragment of the Gringo input language =-=[5, 6]-=-, which extends normal programs by aggregate atoms. The semantics of this class is defined in terms of answer sets (also known as stable models) [7]. We denote the collection of all answer sets of a p...

Citation Context

... can be simplified by strongly equivalent transformations using its monotonicity properties. In (Gebser et al. 2015), we show how these formulas can be further simplified under the assumption that intervals do not occur in some parts of the aggregate expression. 6 A Summary of Future Work Another application of this work would be to prove the correctness of the computational methods used in gringo and in the ASP solvers that use this grounder as their front end. Currently, those solvers employ a number of “intelligent instantiation” algorithms which allow the grounder to function efficiently (Gebser et al. 2009). Using our semantics we will work with the designers of gringo to prove that these algorithms are correct. As previously mentioned, a semantics for Gringo takes us a long way in the direction of a semantics for most ASP languages. Exploring how these languages compare and contrast is yet another direction of future work. An example of one such language is the ASP Core language (Calimeri et al. 2012). Finally, there are a number of theoretical questions regarding the infinitary sysFormal Methods for Answer Set Programming 7 tem from (Harrison et al. 2014a) which we would like to investigate. F...

Citation Context

...er Set Solving Collection” [8]. It is a grounder that combines and extends techniques from dlv [9]. It uses an extended version of the lparse language as input and produces a compatible output format =-=[10]-=-. As a result all programs that understand lparse output also understand gringo output. gringo’s grounding times were tested separately and the results will be presented in 4. Gringo automatically det...

Citation Context

...ay selectively investigate critical parts of biological networks and/or measurements. In what follows, we provide logic program representations of repair in the input language of ASP grounder gringo (=-=Gebser et al. 2009-=-). After describing the format of instances, repair operations, and our repair encoding, we consider minimal repairs. Finally, we explain the usage of minimal repairs for prediction (under inconsisten...

Citation Context

...variables at the schematic level also provides more direct access than an implicit clause compilation. In fact, given the expressiveness of modeling languages supported by off-the-shelf ASP grounders =-=[12, 19]-=-, we expect that declarative specifications are easier to develop and maintain than their procedural counterparts. For one, it is possible to separate domain descriptions from logical axioms, which en...