Filter your results
- 59
- 28
- 73
- 7
- 6
- 1
- 85
- 1
- 6
- 4
- 4
- 1
- 1
- 1
- 2
- 7
- 8
- 7
- 1
- 5
- 5
- 6
- 5
- 3
- 3
- 4
- 2
- 5
- 3
- 3
- 1
- 62
- 24
- 1
- 85
- 12
- 8
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 87
- 28
- 16
- 16
- 12
- 11
- 10
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 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
87 Results
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
Conference papers
hal-03299521v1
|
|||
pFactory: A generic library for designing parallel solversInternational Conference on Applied Computing (AC), 2019, Cagliari, Italy
Conference papers
hal-03299476v1
|
|||
Extreme Cases in SAT Problems19th International Conference on Theory and Applications of Satisfiability Testing (SAT'16), 2016, Bordeaux, France. pp.87-103
Conference papers
hal-03299479v1
|
|||
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
Conference papers
hal-03299487v1
|
|||
|
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
Conference papers
hal-00865529v1
|
||
Just-In-Time Compilation of Knowledge Bases23th International Joint Conference on Artificial Intelligence (IJCAI'13), 2013, China. pp.447-453
Conference papers
hal-00845501v2
|
|||
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
Conference papers
hal-03299489v1
|
|||
|
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
Conference papers
hal-00390919v1
|
||
Glucose 2.1: Aggressive - but Reactive - Clause Database Management, Dynamic RestartsInternational Workshop of Pragmatics of SAT (Affiliated to SAT), Jun 2012, Trento, Italy
Conference papers
hal-00845494v1
|
|||
Predecting and detecting symmetry in Finite Model Search[Rapport de recherche] LSIS.RR.2004.003, LSIS. 2004
Reports
hal-01488871v1
|
|||
|
Approche hybride pour SAT17ième Congrès Francophone sur la Reconnaissance des Formes et Intelligence Artificielle (RFIA'10), 2010, Caen, France. pp.279-286
Conference papers
hal-00869833v1
|
||
|
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems[Technical Report] ArXiv. 2021
Reports
hal-03701208v1
|
||
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
Conference papers
hal-03299488v1
|
|||
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
Conference papers
hal-03299480v1
|
|||
OpenSAT: une plateforme SAT Open SourceJNPC'03, 2003, Amiens, France
Conference papers
hal-03299519v1
|
|||
A Symbolic Search Based Approach for Quantified Boolean Formulas2005, pp.16
Conference papers
hal-00014621v1
|
|||
|
Résolution parallèle de SAT: mieux collaborer pour aller plus loinJFPC 2012, 2012, Toulouse, France
Conference papers
hal-00818239v1
|
||
|
PeneLoPe, a Parallel Clause-Freezer SolverSAT Challenge 2012: Solver and Benchmarks Descriptions, 2012, France. pp.43-44
Conference papers
hal-00865592v1
|
||
|
Un cadre général pour l'analyse des conflits4ièmes Journées Francophones de Programmation par Contraintes (JFPC'08), 2008, Nantes, France. pp.267-376
Conference papers
hal-00869816v1
|
||
Un nouveau cadre diviser pour régner pour SAT distribué9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, Francia. pp.51-58
Conference papers
hal-00869916v1
|
|||
Améliorer SAT dans le cadre incrémentalRevue d'intelligence artificielle (RIA), 2014, 28 (5), pp.593-614
Journal articles
hal-03299516v1
|
|||
Dominance au voisinage pour le probleme d'isomorphisme de sous-graphe8èmes Journées Nationales de l'Intelligence Artificielle Fondamentale (IAF'14), 2014, Angers, France
Conference papers
hal-03299517v1
|
|||
AVAL: an Enumerative Method for SATInternational Conference on Computational Logic (CL'00), 2000, Londres, United Kingdom. pp.373-383
Conference papers
hal-03299491v1
|
|||
GLUCOSE 2.1: Aggressive, but Reactive, Clause Database Management, Dynamic Restarts (System Description)Pragmatics of SAT 2012 (POS'12), 2012, Trento, Italy
Conference papers
hal-03299482v1
|
|||
SAT Based BDD Solver for Quantified Boolean Formulas16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004, Boca Raton, United States. pp.82 - 89
Conference papers
hal-03299484v1
|
|||
Reasoning by symmetry and function ordering in Finite model generation18th Conference on Automated Deduction (CADE'18), 2002, Copenhagen, Denmark. pp.226-240
Conference papers
hal-03299486v1
|
|||
|
Exploitation des symétries dans les formules booléennes quantifiéesDeuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France
Conference papers
inria-00085795v1
|
||
Efficient Symmetry Breaking Predicates for Quantified Boolean FormulaeWorkshop on Symmetry and Constraint Satisfaction Problems - Affiliated to CP(SymCon), Sep 2007, United States. pp.14-21
Conference papers
hal-00385814v1
|
|||
Integrating Conflict Driven Clause Learning to Local Search6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS'09), 2009, Lisbonne, Portugal
Conference papers
hal-00870858v1
|
|||
|
RCL: Reduce learnt clauses2013
Reports
hal-00872811v1
|