Programming with Boolean Satisfaction

Michael Codish

doi:10.1007/978-3-642-29822-6_1

Programming with Boolean Satisfaction

Michael Codish

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding them into SAT.

Original language	English
Title of host publication	Functional and Logic Programming
Subtitle of host publication	11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings
Publisher	Springer Berlin Heidelberg
Pages	1
Number of pages	1
ISBN (Electronic)	9783642298226
ISBN (Print)	9783642298219
DOIs	https://doi.org/10.1007/978-3-642-29822-6_1
State	Published - May 2012

Access to Document

10.1007/978-3-642-29822-6_1

Cite this

@inproceedings{235a55448eb04f0097eaa74176983c20,

title = "Programming with Boolean Satisfaction",

abstract = "In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding them into SAT.",

author = "Michael Codish",

year = "2012",

month = may,

doi = "10.1007/978-3-642-29822-6\_1",

language = "English",

isbn = "9783642298219",

pages = "1",

booktitle = "Functional and Logic Programming",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Programming with Boolean Satisfaction

AU - Codish, Michael

PY - 2012/5

Y1 - 2012/5

N2 - In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding them into SAT.

AB - In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding them into SAT.

U2 - 10.1007/978-3-642-29822-6_1

DO - 10.1007/978-3-642-29822-6_1

M3 - Conference contribution

SN - 9783642298219

SP - 1

BT - Functional and Logic Programming

PB - Springer Berlin Heidelberg

ER -

Programming with Boolean Satisfaction

Abstract

Access to Document

Fingerprint

Cite this