GPU-based parallelism for ASP-solving

09/04/2019
by   Agostino Dovier, et al.
0

Answer Set Programming (ASP) has become, the paradigm of choice in the field of logic programming and non-monotonic reasoning. Thanks to the availability of efficient solvers, ASP has been successfully employed in a large number of application domains. The term GPU-computing indicates a recent programming paradigm aimed at enabling the use of modern parallel Graphical Processing Units (GPUs) for general purpose computing. In this paper we describe an approach to ASP-solving that exploits GPU parallelism. The design of a GPU-based solver poses various challenges due to the peculiarities of GPUs' software and hardware architectures and to the intrinsic nature of the satisfiability problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2021

FOLASP: FO(.) as Input Language for Answer Ser Solvers

Over the past decades, Answer Set Programming (ASP) has emerged as an im...
research
07/18/2022

A Variant of Concurrent Constraint Programming on GPU

The number of cores on graphical computing units (GPUs) is reaching thou...
research
11/24/2022

MRHS multigrid solver for Wilson-clover fermions

We describe our implementation of a multigrid solver for Wilson-clover f...
research
11/22/2021

Parallel Logic Programming: A Sequel

Multi-core and highly-connected architectures have become ubiquitous, an...
research
04/29/2018

Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP

Conventional processor architectures are restricted in exploiting instru...
research
09/22/2020

An application of Answer Set Programming in Distributed Architectures: ASP Microservices

We propose an approach to the definition of microservices with an Answer...
research
10/16/2022

Using Answer Set Programming for HPC Dependency Solving

Modern scientific software stacks have become extremely complex, using m...

Please sign up or login with your details

Forgot password? Click here to reset