Filter your results
- 20
- 2
- 18
- 2
- 1
- 1
- 22
- 7
- 10
- 3
- 2
- 14
- 8
- 22
- 1
- 8
- 15
- 14
- 10
- 5
- 3
- 3
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
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
|
||
|
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
|
||
|
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
|
||
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
|
||
|
Explication de clauses et de formules dans Max-SATJFPC 2022, Jun 2022, Saint-Etienne, France
Conference papers
hal-03737733v1
|
||
|
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
|
||
|
Proofs and Certificates for Max-SATJournal of Artificial Intelligence Research, 2022, 75, pp.1373-1400. ⟨10.1613/jair.1.13811⟩
Journal articles
hal-03977496v1
|
||
|
Computing Max-SAT Refutations using SAT OraclesInternational Conference on Tools with Artificial Intelligence (ICTAI), Nov 2021, Visioconférence, France
Conference papers
hal-03737738v1
|
||
|
Des réfutations SAT aux réfutations Max-SAT *Journées Francophones de Programmation par Contraintes (JFPC 2021), 2021, Conférence virtuelle, France
Conference papers
hal-03343027v1
|
||
|
Un bandit manchot pour combiner CHB et VSIDSActes des 16èmes Journées Francophones de Programmation par Contraintes (JFPC), Jun 2021, Nice, France
Conference papers
hal-03270931v1
|
||
|
Understanding the power of Max-SAT resolution through UP-resilienceArtificial Intelligence, 2020, 289, pp.103397. ⟨10.1016/j.artint.2020.103397⟩
Journal articles
hal-02977156v1
|
||
|
Certificats d'optimalité pour Max-SATJFPC 2022, Jun 2022, Saint-Etienne, France
Conference papers
hal-03737729v1
|
||
|
Max-réfutations et oracles SATJFPC 2022, Jun 2022, Saint-Etienne, France
Conference papers
hal-03737731v1
|
||
|
On the Refinement of Conflict History Search Through Multi-Armed BanditIEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2020, Baltimore, United States. pp.264-271, ⟨10.1109/ICTAI50040.2020.00050⟩
Conference papers
hal-03132228v1
|
||
|
Inferring Clauses and Formulas in Max-SATThe 33rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2021, Vidéoconférence, France
Conference papers
hal-03737741v1
|
||
|
Reasoning and Inference for (Maximum) Satisfiability: New InsightsComputer Science [cs]. Aix-Marseille University, 2022. English. ⟨NNT : 2022AIXM0589⟩
Theses
tel-04088137v1
|
||
Computing Max-SAT Refutations using SAT Oracles2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2021, Washington, United States. pp.404-411, ⟨10.1109/ICTAI52525.2021.00066⟩
Conference papers
hal-03594992v1
|