Publications associées à Problème 2-SAT

Decomposition and tractability in qualitative spatial and temporal reasoning

Constraint networks in qualitative spatial and temporal reasoning (QSTR) typically feature variables defined on infinite domains. Mainstream algorithms for deciding network consistency are based on searching for network refinements whose consistency is kno ...

Elsevier2013

CafeSat: a Modern SAT Solver for Scala

Régis William Blanc

We present CafeSat, a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state-of-the-art techniques and heuristics. It uses two-watched literals for Boolean constraint propagation, conflict-dr ...

ACM Press2013

Bromate catalytic reduction in continuous mode using metal catalysts supported on monoliths coated with carbon nanofibers

Lioubov Kiwi

Nitrogen-doped and un-doped carbon nanofibers layers, denoted as N-CNFs and CNFs respectively, coating the walls of cordierite monoliths have been used as support for Pd and Ru catalyst. They have been tested in bromate reduction in batch and continuous op ...

Elsevier2013