Filtrer vos résultats
- 58
- 39
- 79
- 8
- 7
- 2
- 1
- 3
- 1
- 96
- 1
- 9
- 8
- 4
- 4
- 1
- 1
- 1
- 2
- 7
- 8
- 7
- 1
- 5
- 5
- 5
- 5
- 3
- 3
- 4
- 2
- 5
- 3
- 3
- 1
- 71
- 25
- 1
- 95
- 12
- 8
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 97
- 35
- 18
- 15
- 13
- 12
- 11
- 11
- 10
- 9
- 8
- 8
- 8
- 8
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
97 résultats
|
Proceedings of the 2022 XCSP3 CompetitionArxiv. 2022
Rapport
hal-03937145v1
|
||
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions18th Conference on Automated Deduction (CADE'18), 2002, Oxford, United Kingdom. pp.195-210
Communication dans un congrès
hal-03299489v1
|
|||
Glucose 2.1: Aggressive - but Reactive - Clause Database Management, Dynamic RestartsInternational Workshop of Pragmatics of SAT (Affiliated to SAT), Jun 2012, Trento, Italy
Communication dans un congrès
hal-00845494v1
|
|||
|
Pourquoi les solveurs SAT modernes se piquent-ils contre des cactus ?Cinquièmes Journées Francophones de Programmation par Contraintes, Jun 2009, Orléans, France. pp.245-255
Communication dans un congrès
hal-00390919v1
|
||
|
Computing Abductive Explanations for Boosted Trees26th International Conference on Artificial Intelligence and Statistics (AISTATS 2023), Apr 2023, Valencia, Spain
Communication dans un congrès
hal-04148629v1
|
||
|
On the Explanatory Power of Boolean Decision TreesData and Knowledge Engineering, 2022, 142, pp.102088. ⟨10.1016/j.datak.2022.102088⟩
Article dans une revue
hal-03939107v1
|
||
|
A hybrid CP/MOLS approach for multi-objective imbalanced classificationGECCO '21: Genetic and Evolutionary Computation Conference, Jul 2021, Lille, France. pp.723-731, ⟨10.1145/3449639.3459310⟩
Communication dans un congrès
hal-03281930v1
|
||
Just-In-Time Compilation of Knowledge Bases23th International Joint Conference on Artificial Intelligence (IJCAI'13), 2013, China. pp.447-453
Communication dans un congrès
hal-00845501v2
|
|||
Bounded Model Checking for Timed Systems22nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'02), 2002, Houston, United States. pp.243-259
Communication dans un congrès
hal-03299487v1
|
|||
Extreme Cases in SAT Problems19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16), 2016, Bordeaux, France. pp.87-103
Communication dans un congrès
hal-03299479v1
|
|||
|
PyXAI : calculer en Python des explications pour des modèles d'apprentissage superviséExtraction et Gestion des Connaissances, EGC, Jan 2023, Lyon, France
Communication dans un congrès
hal-04148656v1
|
||
|
On freezeing and reactivating learnt clauses14th International Conference on Theory and Applications of Satisfiability Testing (SAT'11), 2011, Ann Arbor, United States. pp.188-200
Communication dans un congrès
hal-00865529v1
|
||
Sur la génération des groupes finis non isomorphesActes des sixièmes Journées Nationales des problèmes NP complets (JNPC 00), 2000, Marseille, France. pp.57-66
Communication dans un congrès
hal-03299521v1
|
|||
pFactory: A generic library for designing parallel solversInternational Conference on Applied Computing (AC), 2019, Cagliari, Italy
Communication dans un congrès
hal-03299476v1
|
|||
Integrating boolean and mathematical solving : fondations, basic algorithms and requirementsProceedings on the 10th Symposium on the Integration of symbolic Computation and Mechanized Reasoning (CALCULEMUS 2002) LNCS 2385, 2002, Marseille, France. pp.231-245
Communication dans un congrès
hal-03299488v1
|
|||
A Symbolic Search Based Approach for Quantified Boolean Formulas2005, pp.16
Communication dans un congrès
hal-00014621v1
|
|||
|
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems[Technical Report] ArXiv. 2021
Rapport
hal-03701208v1
|
||
|
PeneLoPe, a Parallel Clause-Freezer SolverSAT Challenge 2012: Solver and Benchmarks Descriptions, 2012, France. pp.43-44
Communication dans un congrès
hal-00865592v1
|
||
|
Résolution parallèle de SAT: mieux collaborer pour aller plus loinJFPC 2012, 2012, Toulouse, France
Communication dans un congrès
hal-00818239v1
|
||
OpenSAT: une plateforme SAT Open SourceJNPC'03, 2003, Amiens, France
Communication dans un congrès
hal-03299519v1
|
|||
|
Approche hybride pour SAT17ième Congrès Francophone sur la Reconnaissance des Formes et Intelligence Artificielle (RFIA'10), 2010, Caen, France. pp.279-286
Communication dans un congrès
hal-00869833v1
|
||
|
Proceedings of the 2023 XCSP3 Competition2024
Pré-publication, Document de travail
hal-04484388v1
|
||
|
Deriving Explanations for Decision Trees: The Impact of Domain Theories2023
Pré-publication, Document de travail
hal-04176274v1
|
||
Predecting and detecting symmetry in Finite Model Search[Rapport de recherche] LSIS.RR.2004.003, LSIS. 2004
Rapport
hal-01488871v1
|
|||
Scoring-based Neighborhood Dominance for the Subgraph isomorphism Problem20th International Conference on Principles and Practice of Constraint Programming (CP'14), 2014, Lyon, France. pp.125--141
Communication dans un congrès
hal-03299480v1
|
|||
Verifying Industrial Hybrid Systems with MathSATElectronic Notes in Theoretical Computer Science, 2005, 119 (2), pp.17-32
Article dans une revue
hal-00396426v1
|
|||
Impact of Community Structure on SAT Solver Performance17th International Conference on Theory and Applications of Satisfiability Testing, Jul 2014, Austria. To appear
Communication dans un congrès
hal-00994301v1
|
|||
|
Experimenting a Conflict-Driven Clause Learning Algorithm14th International Conference on Principles and Practice of Constraint Programming (CP'08), 2008, Sydney, Australia. pp.630-634
Communication dans un congrès
hal-00865295v1
|
||
Une restriction de la résolution étendue pour les démonstrateurs SAT modernesJFPC, Jun 2010, Orléans, France
Communication dans un congrès
inria-00543640v1
|
|||
GUNSAT : a greedy local search algorithm for unsatisfiabilityInternational Joint Conference on Artificial Intelligence(IJCAI'07), Jan 2007, Hyderabad, India. pp.2256--2261
Communication dans un congrès
hal-00438054v1
|