Abstract Answer Set Programming (ASP) is a well-known declarative problem solving paradigm developed in the field of nonmonotonic reasoning and logic programming. The …
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 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 …
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 …
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 …
Motivated by the success of preprocessing in Boolean satisfiability (SAT) solving, development and analysis of preprocessing in maximum satisfiability (MaxSAT)—the …
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 …
This dissertation demonstrates the possibility of obtaining strong speedups for a variety of parallel applications versus the best serial and parallel implementations on commodity …
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 …