Filtrer vos résultats
- 4
- 3
- 2
- 2
- 2
- 1
- 2
- 5
- 2
- 2
- 1
- 1
- 2
- 1
- 7
- 4
- 4
- 3
- 3
- 1
- 7
- 4
- 2
- 1
7 résultats
|
|
triés par
|
|
DPLL with restarts linearly simulates CDCL[Research Report] Université de Bourgogne. 2019
Rapport
hal-01985327v1
|
||
|
Constraint ReductionsCP anniversary Volume, 2019
Autre publication scientifique
hal-02735275v1
|
||
A Translation of Pseudo-Boolean Constraints to SATJournal on Satisfiability, Boolean Modeling and Computation, 2006, 2, pp.191-200
Article dans une revue
hal-00159880v1
|
|||
|
Attempts to produce minimal Resolution refutations[Research Report] Université de Bourgogne; UFR Sciences et Techniques. 2018
Rapport
hal-01877804v1
|
||
New Encodings of Pseudo-Boolean Constraints into CNFTheory and Applications of Satisfiability Testing - SAT 2009, Jun 2009, Swansea, United Kingdom. pp.181-194
Communication dans un congrès
hal-00415126v1
|
|||
Some Computational Aspects of DISTANCE-SATJournal of Automated Reasoning (JAR), 2006, 37 (4), pp.231-260
Article dans une revue
hal-03300950v1
|
|||
Full CNF Encoding: The Counting Constraints CaseThe Seventh International Conference on Theory and Applications of Satisfiability Testing, May 2004, Vancouver, Canada
Communication dans un congrès
hal-00159899v1
|