2018
DOI: 10.1007/s13218-018-0533-0
|View full text |Cite
|
Sign up to set email alerts
|

The ASP System DLV: Advancements and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
19
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 5 publications
0
19
0
Order By: Relevance
“…In particular, the formula for computing the assortativity degree of a graph G is defined as (Newman 2002 The formulas above, especially the one for assortativity, show that the computation of graph metrics can be in general not easy to be carried out using only rules in an ASP program. As a consequence, we resort to recent extensions of ASP systems, such as I-DLV/DLV2 (Calimeri et al 2017b;Adrian et al 2018), DLVHEX Calimeri et al 2016;, which allow the integration of external computa- tion sources within the ASP program. In particular, the problem at hand requires to send a (possibly guessed) entire graph, that is, a set of edges, to an external source of computation.…”
Section: Specialization For Studying Graph Metricsmentioning
confidence: 99%
See 2 more Smart Citations
“…In particular, the formula for computing the assortativity degree of a graph G is defined as (Newman 2002 The formulas above, especially the one for assortativity, show that the computation of graph metrics can be in general not easy to be carried out using only rules in an ASP program. As a consequence, we resort to recent extensions of ASP systems, such as I-DLV/DLV2 (Calimeri et al 2017b;Adrian et al 2018), DLVHEX Calimeri et al 2016;, which allow the integration of external computa- tion sources within the ASP program. In particular, the problem at hand requires to send a (possibly guessed) entire graph, that is, a set of edges, to an external source of computation.…”
Section: Specialization For Studying Graph Metricsmentioning
confidence: 99%
“…In particular, the problem at hand requires to send a (possibly guessed) entire graph, that is, a set of edges, to an external source of computation. The ASP standardization group has not released standard language directives yet for such features; here, we make use of syntax and semantics of DLVHEX , while a slightly different formulation must be used to comply with I-DLV/DLV2 (Calimeri et al 2017b;Adrian et al 2018) or clingo ) syntax. Figure 6 shows the specialization of the Brain Evolution Simulation module for deriving the minimal changes to perform on a graph G i in order to obtain a decrease in the measure of a certain property (by 10% by edge removal in the example).…”
Section: Specialization For Studying Graph Metricsmentioning
confidence: 99%
See 1 more Smart Citation
“…Answer set programming (ASP) [8], based on the logic programming paradigm, is an elegant method to represent defaults, exceptions and preferences. There are comprehensive, well known, implementations of ASP such as CLINGO [7] and DLV [1]. But most of them are based on grounding the logic program and then using a SAT solver to compute a model.…”
Section: Introductionmentioning
confidence: 99%
“…The Answer Set Programming (ASP) language has become very popular in the last years thanks to the availability of more and more efficient solvers (e.g., Clingo [8] and DLV [1]). It is based on the stable model semantics from Gelfond and Lifschitz [9], introduced to resemble the human reasoning process; together with its simple syntax, this makes ASP a very intuitive language to be used.…”
Section: Introduction and Problem Descriptionmentioning
confidence: 99%