A SAT Encoding for the n-Fractions Problem

07/02/2018
by   Michael Codish, et al.
0

This note describes a SAT encoding for the n-fractions puzzle which is problem 041 of the CSPLib. Using a SAT solver we obtain a solution for two of the six remaining open instances of this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2013

Extending Modern SAT Solvers for Enumerating All Models

In this paper, we address the problem of enumerating all models of a Boo...
research
05/07/2011

Solving Rubik's Cube Using SAT Solvers

Rubik's Cube is an easily-understood puzzle, which is originally called ...
research
07/01/2011

Simple Algorithm Portfolio for SAT

The importance of algorithm portfolio techniques for SAT has long been n...
research
09/04/2019

Verifying the DPLL Algorithm in Dafny

Modern high-performance SAT solvers quickly solve large satisfiability i...
research
10/27/2018

A comparison of encodings for cardinality constraints in a SAT solver

Cardinality constraints are important in many Sat problems; previous stu...
research
05/12/2020

Yet Another Comparison of SAT Encodings for the At-Most-K Constraint

The at-most-k constraint is ubiquitous in combinatorial problems, and nu...
research
04/13/2016

HordeQBF: A Modular and Massively Parallel QBF Solver

The recently developed massively parallel satisfiability (SAT) solver Ho...

Please sign up or login with your details

Forgot password? Click here to reset