Book ChapterDOI
Advances in WASP
Mario Alviano,Carmine Dodaro,Nicola Leone,Francesco Ricca +3 more
- Vol. 9345, pp 40-54
TLDR
An experimental analysis on publicly available benchmarks shows that the new version of wasp outperforms the previous one, and the algorithms and the design choices for addressing several reasoning tasks in ASP.Abstract:
ASP solvers address several reasoning tasks that go beyond the mere computation of answer sets. Among them are cautious reasoning, for modeling query entailment, and optimum answer set computation, for supporting numerical optimization. This paper reports on the recent improvements of the solver wasp, and details the algorithms and the design choices for addressing several reasoning tasks in ASP. An experimental analysis on publicly available benchmarks shows that the new version of wasp outperforms the previous one. Comparing with the state-of-the-art solver clasp, the performance of wasp is competitive in the overall for number of solved instances and average execution time.read more
Citations
More filters
Journal ArticleDOI
Multi-shot ASP solving with clingo
TL;DR: In this article, a new flexible paradigm of grounding and solving in ASP is introduced, referred to as multi-shot ASP solving, which is implemented in the ASP system clingo.
Book ChapterDOI
The ASP System DLV2
Mario Alviano,Francesco Calimeri,Carmine Dodaro,Davide Fuscà,Nicola Leone,Simona Perri,Francesco Ricca,Pierfrancesco Veltri,Jessica Zangari +8 more
TL;DR: A new Answer Set Programming (ASP) system that combines Open image in new window , a fully-compliant ASP-Core-2 grounder, with the well-assessed solver Open imageIn new window, which outperforms the old Open imagein new window system and is close to the state-of-the-art ASP system.
Journal ArticleDOI
The Sixth Answer Set Programming Competition
TL;DR: This edition of the Sixth ASP Competition maintained some of the design decisions introduced in 2014, but 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.
Journal ArticleDOI
I-DLV: The new intelligent grounder of DLV
Journal ArticleDOI
Grounding and Solving in Answer Set Programming
TL;DR: Key issues in grounding are focused here on how to systematically replace object variables by ground terms in a effective way, and solving, or how to compute the answer sets of a propositional logic program obtained by grounding.
References
More filters
Journal ArticleDOI
Classical negation in logic programs and disjunctive databases
TL;DR: It is shown that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.
Journal ArticleDOI
GRASP: a search algorithm for propositional satisfiability
TL;DR: Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Journal ArticleDOI
The DLV system for knowledge representation and reasoning
Nicola Leone,Gerald Pfeifer,Wolfgang Faber,Thomas Eiter,Georg Gottlob,Simona Perri,Francesco Scarcello +6 more
TL;DR: The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.
Journal ArticleDOI
Extending and implementing the stable model semantics
TL;DR: A novel logic program like language, weight constraint rules, is developed for answer set programming purposes which offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation.
Book ChapterDOI
Effective preprocessing in SAT through variable and clause elimination
Niklas Een,Armin Biere +1 more
TL;DR: This work combines variable elimination with subsumption and self-subsuming resolution, and shows that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT problems.