资源分类
》 资源 》论文》Modelling Satisfiability Problems Theory and Practice

Modelling Satisfiability Problems Theory and Practice

2019-11-25 | |  41 |   42 |   0
Abstract Boolean Satisfiability (SAT) solvers are a mature technology to solve hard combinatorial problems. The input to a SAT solver is the problem translated to propositional logic in conjunctive normal form (CNF). This thesis studies such translations and aims to make SAT solvers more accessible to non-encoding experts.

上一篇：Learning Robust Representations for Data Analytics

下一篇：Solving Hard Subgraph Problems in Parallel

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...