Filter your results
- 5
- 3
- 7
- 1
- 8
- 1
- 4
- 2
- 1
- 5
- 3
- 8
- 2
- 1
- 1
- 1
- 7
- 7
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Une approche SAT incrémentale pour raisonner efficacement sur les réseaux de contraintes qualitatives JFPC 2019 - Actes des 15es Journées Francophones de Programmation par Contraintes, Jun 2019, Albi, France
Conference papers
hal-02271390v1
|
||
An Incremental SAT-Based Approach for Graph Colouring ProblemThe 25th International Conference on Principles and Practice of Constraint Programming, Sep 2019, Stamford, CT, United States
Conference papers
hal-02271397v1
|
|||
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks24th International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. pp.160-178, ⟨10.1007/978-3-319-98334-9_11⟩
Conference papers
hal-02067915v1
|
|||
Combinaison de nogoods extraits au redémarrage13è Journées Francophone de Programmation par Contraintes (JFPC'17), 2017, Montreuil-sur-mer, France. pp.55--64
Conference papers
hal-03300251v1
|
|||
|
NACRE - A Nogood And Clause Reasoning Engine23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'23), 2020, Alicante, Spain. pp.249-259
Conference papers
hal-03300774v1
|
||
pFactory: A generic library for designing parallel solversInternational Conference on Applied Computing (AC), 2019, Cagliari, Italy
Conference papers
hal-03299476v1
|
|||
An Incremental SAT-Based Approach to Reason Efficiently On Qualitative Constraint Network24th International Conference on Principles and Practice of Constraint Programming (CP'18), 2018, Lille, France. pp.160--178
Conference papers
hal-03300778v1
|
|||
|
Hybridation de techniques d’apprentissage de clauses en programmation par contraintesInformatique [cs]. Université d'Artois, 2019. Français. ⟨NNT : ⟩
Theses
tel-02971371v1
|