BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//GNB93V
BEGIN:VEVENT
UID:pretalx-juliacon2021-GNB93V@pretalx.com
DTSTART:20210728T131000Z
DTEND:20210728T132000Z
DESCRIPTION:Many discrete problems in mathematics and computer science can
be encoded into Boolean satisfiability (SAT) problems\, and then solved by
one of the many SAT "solvers" written in C or C++\, which are now capable
of solving problems with millions of variables. \n\nIn order to understan
d the algorithms and trade-offs involved\, we developed a simple SAT solve
r in pure Julia that is performant for small systems. We also have develop
ed simple tools to encode discrete problems like sudoku into SAT.
DTSTAMP:20231209T091951Z
LOCATION:Red
SUMMARY:Solving discrete problems via Boolean satisfiability with Julia - D
avid P. Sanders
URL:https://pretalx.com/juliacon2021/talk/GNB93V/
END:VEVENT
END:VCALENDAR