Programming with Boolean Satisfaction

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageAmerican English
Title of host publicationFunctional and Logic Programming
Subtitle of host publication11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings
Pages1
Number of pages1
ISBN (Electronic)9783642298226
DOIs
StatePublished - May 2012

Fingerprint

Dive into the research topics of 'Programming with Boolean Satisfaction'. Together they form a unique fingerprint.

Cite this