An ASP approach for the valves positioning optimization in a water distribution system

Gavanelli, Marco; Nonato, Maddalena; Peano, Andrea

doi:10.1093/logcom/ext065

Cited by 15 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Crossing Minimization (Gange, Stuckey, & Marriott, 2010) aims at optimized layouts of hierarchical network diagrams in graph drawing. The hydroinformatics problem Valves Location (Gavanelli, Nonato, & Peano, 2015) is concerned with designing water distribution systems such that the isolation in case of damages is minimized. In contrast to objective functions considered in the Optimization sub-track (#3), the Complex Optimization domain addresses subsetminimization in the contexts of biological network repair (Gebser, Guziolowski, Ivanchev, Schaub, Siegel, Thiele, & Veber, 2010) and minimal unsatisfiable core membership (Janota & MarquesSilva, 2011).…”

Section: Previous Domainsmentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning. This edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the topperforming systems are given more time for solving hard benchmarks.

show abstract

Section: Previous Domainsmentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

View full text Add to dashboard Cite

show abstract

“…ASP features an expressive language that can be used to model computational problems of comparatively high complexity (Eiter et al 1997) often in a rather compact way. The availability of high-performance implementations (Gebser et al 2015;Lierler et al 2016;Calimeri et al 2016;Gebser et al 2016) made ASP a valuable tool for developing complex applications in several research areas (Erdem et al 2016), including Artificial Intelligence (Balduccini et al 2001;Aschinger et al 2011;Abseher et al 2016;Dodaro et al 2016), Hydroinformatics (Gavanelli et al 2015), Nurse Scheduling (Alviano et al 2017), and Bioinformatics (Erdem and Öztok 2015;Koponen et al 2015;, to mention a few. Especially the development of real-world applications outlined the advantages of ASP from a software engineering viewpoint.…”

Section: Introductionmentioning

confidence: 99%

Debugging Non-ground ASP Programs: Technique and Graphical Tools

Dodaro¹,

Gasteiger²,

Reale³

et al. 2019

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Answer set programming (ASP) is one of the major declarative programming paradigms in the area of logic programming and non-monotonic reasoning. Despite that ASP features a simple syntax and an intuitive semantics, errors are common during the development of ASP programs. In this paper we propose a novel debugging approach allowing for interactive localization of bugs in non-ground programs. The new approach points the user directly to a set of non-ground rules involved in the bug, which might be refined (up to the point in which the bug is easily identified) by asking the programmer a sequence of questions on an expected answer set. The approach has been implemented on top of the ASP solver wasp. The resulting debugger has been complemented by a user-friendly graphical interface, and integrated in aspide, a rich integrated development environment (IDE) for answer set programs. In addition, an empirical analysis shows that the new debugger is not affected by the grounding blowup limiting the application of previous approaches based on meta-programming.

show abstract

“…Answer set programming (ASP) is a declarative formalism for knowledge representation and reasoning based on stable model semantics (Gelfond and Lifschitz 1991;Brewka et al 2011). ASP has been applied for solving complex problems in several areas, including artificial intelligence (Balduccini et al 2001;Garro et al 2006;Dodaro et al 2015), bioinformatics (Erdem andÖztok 2015;Koponen et al 2015), hydroinformatics (Gavanelli et al 2015), databases (Marileo and Bertossi 2010;Manna et al 2015;Manna et al 2013), and scheduling Abseher et al 2016;Dodaro and Maratea 2017), to mention a few; see Erdem et al (2016) for a detailed survey on ASP applications. The success of ASP is due to the combination of its high knowledgemodeling power and robust solving technology Maratea et al 2012;Alviano et al 2015;Lierler et al 2016;Gebser et al 2017;.…”

Section: Introductionmentioning

confidence: 99%

The External Interface for Extending WASP

Dodaro

Ricca

2018

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the Conflict-Driven Clause Learning (CDCL) backtracking search algorithm. Recent work suggested that the performance of CDCL-based implementations can be considerably improved on specific benchmarks by extending their solving capabilities with custom heuristics and propagators. However, embedding such algorithms into existing systems requires expert knowledge of the internals of ASP implementations. The development of effective solver extensions can be made easier by providing suitable programming interfaces. In this paper, we present the interface for extending the CDCL-based ASP solver WASP. The interface is both general, i.e. it can be used for providing either new branching heuristics and propagators, and external, i.e. the implementation of new algorithms requires no internal modifications of WASP. Moreover, we review the applications of the interface witnessing it can be successfully used to extend WASP for solving effectively hard instances of both real-world and synthetic problems. Under consideration in Theory and Practice of Logic Programming (TPLP).

show abstract

An ASP approach for the valves positioning optimization in a water distribution system

Cited by 15 publications

References 26 publications

The Sixth Answer Set Programming Competition

The Sixth Answer Set Programming Competition

Debugging Non-ground ASP Programs: Technique and Graphical Tools

The External Interface for Extending WASP

Contact Info

Product

Resources

About