A SAT Encoding for the n-Fractions Problem

Michael Codish

doi:10.48550/arXiv.1807.00507

A SAT Encoding for the n-Fractions Problem

Michael Codish

Research output: Working paper/Preprint › Preprint

40 Downloads (Pure)

Abstract

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.

Original language	English
DOIs	https://doi.org/10.48550/arXiv.1807.00507
State	Published - 2 Jul 2018

Keywords

cs.DM

Access to Document

10.48550/arXiv.1807.00507

Cite this

@techreport{1fa0c2705e514daea097dd10c93583e1,

title = "A SAT Encoding for the n-Fractions Problem",

abstract = "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. ",

keywords = "cs.DM",

author = "Michael Codish",

year = "2018",

month = jul,

day = "2",

doi = "10.48550/arXiv.1807.00507",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - A SAT Encoding for the n-Fractions Problem

AU - Codish, Michael

PY - 2018/7/2

Y1 - 2018/7/2

N2 - 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.

AB - 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.

KW - cs.DM

U2 - 10.48550/arXiv.1807.00507

DO - 10.48550/arXiv.1807.00507

M3 - Preprint

BT - A SAT Encoding for the n-Fractions Problem

ER -

A SAT Encoding for the n-Fractions Problem

Abstract

Keywords

Access to Document

Fingerprint

Cite this