No Cover Image

Book chapter 487 views

Cube-and-Conquer for Satisfiability / Marijn J. H. Heule, Oliver Kullmann, Armin Biere

Handbook of Parallel Constraint Reasoning, Pages: 31 - 59

Swansea University Author: Oliver Kullmann

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1007/978-3-319-63516-3_2

Abstract

The Cube-and-Conquer method is a novel paradigm for distributed SAT solving, combining the old and the new paradigms of SAT solving. Theory and applications are discussed in depth.

Published in: Handbook of Parallel Constraint Reasoning
ISBN: 978-3-319-63515-6 978-3-319-63516-3
Published: Springer 2018
Online Access: https://link.springer.com/chapter/10.1007/978-3-319-63516-3_2
URI: https://cronfa.swan.ac.uk/Record/cronfa36186
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: The Cube-and-Conquer method is a novel paradigm for distributed SAT solving, combining the old and the new paradigms of SAT solving. Theory and applications are discussed in depth.
Keywords: SAT solving, distributed computing
College: College of Science
Start Page: 31
End Page: 59