Filter your results
- 30
- 17
- 35
- 8
- 2
- 1
- 1
- 2
- 47
- 2
- 1
- 8
- 13
- 3
- 4
- 1
- 2
- 2
- 1
- 2
- 1
- 2
- 2
- 2
- 2
- 1
- 31
- 16
- 33
- 16
- 6
- 5
- 3
- 1
- 1
- 17
- 20
- 13
- 10
- 8
- 8
- 8
- 7
- 6
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
Cooperative Approach for the Satisfiability Problem17th Triennial Conference of the International Federation of Operational Research Societies IFORS, Jul 2005, Honolulu Hawaï, United States
Conference papers
hal-00354776v1
|
|||
|
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers32th International Joint Conferences on Artificial Intelligence (IJCAI 2023), Aug 2023, Macao, Macau SAR China
Conference papers
hal-04145361v1
|
||
|
Explication de clauses et de formules dans Max-SATJFPC 2022, Jun 2022, Saint-Etienne, France
Conference papers
hal-03737733v1
|
||
Boosting branch-and-bound MaxSAT solvers with clause learningAI Communications, 2021, pp.1-21. ⟨10.3233/AIC-210178⟩
Journal articles
hal-03594950v1
|
|||
|
Conflict History Based Branching Heuristic for CSP SolvingProceedings of the 8th International Workshop on Combinations of Intelligent Methods and Applications (CIMA), Nov 2018, Volos, Greece
Conference papers
hal-02090610v1
|
||
|
Voisinage consistant pour le problème de satisfaisabilitéTroisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), Jun 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France
Conference papers
inria-00151061v1
|
||
|
Apprentissage de clauses nobetters dans les solveurs séparation et évaluation pour Max-SATActes des Treizièmes Journées Francophones de Programmation par Contraintes (JFPC 2017)), Jun 2017, Montreuil-sur-Mer, France
Conference papers
hal-01786548v1
|
||
Relevant Clause Analysis in Modern SAT Solvers[Rapport de recherche] LSIS UMR 7296. 2012
Reports
hal-01488792v1
|
|||
|
Une heuristique basée sur l'historique des conflits pour les problèmes de satisfaction de contraintesActes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), Jun 2019, Albi, France. pp.153-154
Conference papers
hal-02162856v1
|
||
|
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI 2022), Jul 2022, Vienne, Austria
Conference papers
hal-03775319v1
|
||
|
Towards the Characterization of Max-Resolution Transformations of UCSs by UP-ResilienceThe 25th International Conference on Principles and Practice of Constraint Programming (CP 2019), pp. 91-107, Sep 2019, Stamford, United States
Conference papers
hal-02295154v1
|
||
|
Sur l'UP-résilience des k-UCSs binairesActes des 15èmes Journées Francophones de Programmation par Contraintes (JFPC), pp. 177-180, Jun 2019, Albi, France
Conference papers
hal-02295161v1
|
||
|
Towards Bridging the Gap Between SAT and Max-SAT Refutations32th International Conference on Tools with Artificial Intelligence, Nov 2020, Baltimore, United States
Conference papers
hal-03134416v2
|
||
|
A Proof Builder for Max-SAT24th International Conference on Theory and Applications of Satisfiability Testing (SAT 2021), 2021, Barcelone, Spain. ⟨10.1007/978-3-030-80223-3_33⟩
Conference papers
hal-03343022v1
|
||
Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2016, San Jose, United States. pp.452-459, ⟨10.1109/ICTAI.2016.0075⟩
Conference papers
hal-03595003v1
|
|||
|
From Crossing-Free Resolution to Max-SAT Resolution28th International Conference on Principles and Practice of Constraint Programming (CP 2022), Jul 2022, Haifa, Israel. ⟨10.4230/LIPIcs.CP.2022.12⟩
Conference papers
hal-03979371v1
|
||
Bounding the Optimum for the Problem of Scheduling the Photographs of an Agile Earth Observing SatelliteComputational Optimization and Applications, 2010, 47 (2), ⟨10.1007/s10589-008-9220-7⟩
Journal articles
istex
hal-00353797v1
|
|||
|
Une approche basée sur la décomposition arborescente pour la résolution d'instances SAT structuréesCinquièmes Journées Francophones de Programmation par Contraintes, Orléans, juin 2009, Jun 2009, France. pp.85-95
Conference papers
hal-00387823v1
|
||
Improving Local Search for Satisfiability Problem by Integrating Structural Properties2007 IEEE International Conference on Research, Innovation and Vision for the Future, Mar 2007, Hanoï, Vietnam. pp.50-57, ⟨10.1109/RIVF.2007.369135⟩
Conference papers
hal-00354465v1
|
|||
|
Une recherche locale dirigée par l'analyse de conflits pour la satisfiabilitéJFPC 2012, May 2012, Toulouse, France
Conference papers
hal-00818035v1
|
||
|
Combining Clause Learning and Branch and Bound for MaxSAT27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 2021, Montpellier (Online), Best Paper Award, France. ⟨10.4230/LIPIcs.CP.2021.38⟩
Conference papers
hal-03409895v1
|
||
|
Understanding the power of Max-SAT resolution through UP-resilienceThirtieth International Joint Conference on Artificial Intelligence (IJCAI-21), Aug 2021, Montreal-themed Virtual Reality, Canada
Conference poster
hal-03334479v1
|
||
|
Conflict History based Search for Constraint Satisfaction ProblemProceedings of the 34th ACM/SIGAPP Symposium On Applied Computing (SAC), Apr 2019, Limassol, Cyprus. ⟨10.1145/3297280.3297389⟩
Conference papers
hal-02090618v1
|
||
A Hybrid Approach for SATCP 2002 : principles and practice of constraint programming, 2002, Ithaca NY, United States. pp.172-184
Conference papers
hal-00359416v1
|
|||
Inferring Clauses and Formulas in Max-SAT2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2021, Washington, United States. pp.632-639, ⟨10.1109/ICTAI52525.2021.00101⟩
Conference papers
hal-03594994v1
|
|||
|
Raffiner l'heuristique CHS à l'aide de banditsActes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), Jun 2021, Nice, France
Conference papers
hal-03270911v1
|
||
|
Combining VSIDS and CHB Using Restarts in SAT27th International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.20⟩
Conference papers
hal-03402696v1
|
||
|
De la résolution à la max-résolutionJournées Francophones de Programmation par Contraintes (JFPC), Jun 2022, Saint-Étienne, France
Conference papers
hal-03714732v1
|
||
De la résilience de la propagation unitaire aux transformations par max-résolutionDouzièmes Journées Francophones de Programmation par Contraintes (JFPC 2016), 2016, Unknown, Région indéterminée
Conference papers
hal-01490090v1
|
|||
|
Proofs and Certificates for Max-SATJournal of Artificial Intelligence Research, 2022, 75, pp.1373-1400. ⟨10.1613/jair.1.13811⟩
Journal articles
hal-03977496v1
|
- 1
- 2