# GPU-based parallelism for ASP-solving

arXiv: https://arxiv.org/abs/1909.01786 · HTML: https://mlsanity.com/paper/1909.01786/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Sep 2019.

## Built on by (most cited first, 3 of 3)

- [Parallel Logic Programming: A Sequel](https://mlsanity.com/paper/2111.11218/) (2021)
- [XAI-LAW: A Logic Programming Tool for Modeling, Explaining, and Learning Legal Decisions](https://mlsanity.com/paper/2601.03844/) (2026)
- [Explaining Weather Bulletins via ILP](https://mlsanity.com/paper/2607.21184/) (2026)

## Abstract (arXiv)

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.