Advances in WASP

M Alviano, C Dodaro, N Leone, F Ricca - Logic Programming and …, 2015 - Springer
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 stable model search: algorithms and implementation

M Alviano, C Dodaro, J Marques-Silva… - Journal of Logic and …, 2020 - academic.oup.com
Abstract Answer Set Programming (ASP) is a well-known declarative problem solving
paradigm developed in the field of nonmonotonic reasoning and logic programming. The …

Shift design with answer set programming

M Abseher, M Gebser, N Musliu… - Fundamenta …, 2016 - content.iospress.com
Abstract Answer Set Programming (ASP) is a powerful declarative programming paradigm
that has been successfully applied to many different domains. Recently, ASP has also …

Core-guided and core-boosted search for CP

G Gange, J Berg, E Demirović, PJ Stuckey - Integration of Constraint …, 2020 - Springer
Core-guided search has proven to be the state-of-the-art in finding optimal solutions for
maximum Boolean satisfiability and these techniques have recently been successfully …

Exploiting subproblem optimization in SAT-based MaxSAT algorithms

C Ansótegui, J Gabàs, J Levy - Journal of Heuristics, 2016 - Springer
Abstract The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the
Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated …

Study of fine-grained nested parallelism in CDCL SAT solvers

J Edwards, U Vishkin - ACM Transactions on Parallel Computing, 2021 - dl.acm.org
Boolean satisfiability (SAT) is an important performance-hungry problem with applications in
many problem domains. However, most work on parallelizing SAT solvers has focused on …

Preprocessing in incomplete maxsat solving

M Leivo, J Berg, M Järvisalo - ECAI 2020, 2020 - ebooks.iospress.nl
Motivated by the success of preprocessing in Boolean satisfiability (SAT) solving,
development and analysis of preprocessing in maximum satisfiability (MaxSAT)—the …

[PDF][PDF] On the Implementation of Weak Constraints in WASP: Preliminary Report

M Alviano, C Dodaro… - Proceedings of the …, 2014 - w2.cs.uni-saarland.de
Optimization problems in Answer Set Programming (ASP) are usually modeled by means of
programs with weak constraints. These programs can be handled by algorithms for solving …

Study of Fine-Grained, Irregular Parallel Applications on a Many-Core Processor

JA Edwards - 2020 - search.proquest.com
This dissertation demonstrates the possibility of obtaining strong speedups for a variety of
parallel applications versus the best serial and parallel implementations on commodity …

Computational tasks in answer set programming: algorithms and implementation

C Dodaro, N Leone, F Ricca - 2014 - dspace.unical.it
L'Answer Set Programming (ASP) è un paradigma di programmazione dichiarativa basato
sulla semantica dei modelli stabili. L'idea alla base di ASP è di codificare un problema …