Filter your results
- 32
- 16
- 33
- 9
- 5
- 1
- 3
- 48
- 2
- 1
- 1
- 2
- 3
- 5
- 5
- 2
- 5
- 12
- 4
- 5
- 1
- 31
- 16
- 1
- 48
- 8
- 5
- 4
- 3
- 48
- 24
- 21
- 12
- 11
- 8
- 7
- 5
- 5
- 3
- 3
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
48 Results
|
|
sorted by
|
Solving E-SquarO through SAT-coding15th International Conference on Tools with Artificial Intelligence (ICTAI'13), 2013, Washington DC, United States. pp.955-962
Conference papers
hal-00873261v1
|
|||
Sous-formules minimales insatisfaisablesLakhdar Saïs. Problème SAT : progrès et défis, Hermès, pp.221-242, 2008
Book sections
hal-00869999v1
|
|||
|
Une nouvelle méthode hybride pour calculer tous les MSS et tous les MUSTroisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), Jun 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France
Conference papers
inria-00151153v1
|
||
Tracking MUSes and Strict Inconsistent CoversNov 2006, pp.39-46
Conference papers
hal-00118614v1
|
|||
Boosting a Complete Technique to Find MSS and MUS thanks to a Local Search OracleInternational Joint Conference on Artificial Intelligence(IJCAI'07), Jan 2007, Hyderabad, India. pp.2300-2305
Conference papers
hal-00261272v1
|
|||
|
On Finding Minimally Unsatisfiable Cores of CSPsInternational Journal on Artificial Intelligence Tools (IJAIT), 2008, 17 (4), pp.745-763
Journal articles
hal-00747173v1
|
||
A New Heuristic-based albeit Complete Method to Extract MUCs from Unsatisfiable CSPsSep 2006, pp.325-329
Conference papers
hal-00121129v1
|
|||
|
Deterministic Parallel (DP)2LL2011
Reports
hal-00872792v1
|
||
Redondance dans les CNF : laissons le solveur agirJournées Nationales de l'Intelligence Artificielle Fondamentale (IAF'08), 2008, Paris, France
Conference papers
hal-00873276v1
|
|||
Génération d'arguments et contre-arguments par calcul de MUS10ièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA'11), 2011, Chambéry, France. pp.827-840
Conference papers
hal-00869856v1
|
|||
Ludii and XCSP: Playing and Solving Logic PuzzlesIEEE Conferences on Games (COG'19), 2019, Londres (UK), Unknown Region
Conference papers
hal-03301117v1
|
|||
|
Deterministic Parallel DPLLJournal on Satisfiability, Boolean Modeling and Computation, 2011, 7 (4), pp.127-132
Journal articles
hal-00868187v1
|
||
MUST et couvertures de MUST pour l'explication et la réparation de CSPRevue I3 - Information Interaction Intelligence, 2008, 8 (2), pp.181-202
Journal articles
hal-00869772v1
|
|||
Concilier Parallélisme et Déterminisme dans la Résolution de SAT7ièmes Journées Francophones de la Programmation par Contraintes (JFPC'11), 2011, France. pp.162-172
Conference papers
hal-00869896v1
|
|||
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
|
|||
Extracting MUSesAug 2006, pp.387-391
Conference papers
hal-00110099v1
|
|||
MUST: Provide a Finer-Grained Explanation of Unsatisfiability13th International Conference on Principles and Practice of Constraint Programming(CP'07), Sep 2007, Providence, United States. pp.317-331
Conference papers
hal-00193856v1
|
|||
|
Résolution parallèle de SAT : mieux collaborer pour aller plus loin8ièmes Journées Francophones de Programmation par Contraintes (JFPC'12), 2012, France. pp.35-44
Conference papers
hal-00869905v1
|
||
|
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses20th International Conference on Tools with Artificial Intelligence (ICTAI'08), 2008, Dayton, United States. pp.74-83
Conference papers
hal-00865300v1
|
||
|
Let the Solver Deal with Redundancy20th International Conference on Tools with Artificial Intelligence (ICTAI'08), 2008, Dayton, United States. pp.67-73
Conference papers
hal-00865304v1
|
||
|
Efficient Combination of Decision Procedure for MUS Computation7th International Symposium on Frontiers of Combining Systems (FroCos'09), 2009, Trento, Italy. pp.335-349
Conference papers
hal-00865334v1
|
||
Ordering Intervals: From Qualitative Temporal Constraint Problems to Preference Representation10th Workshop on Preferences and Soft Constraints (SOFT'10), 2010, St Andrews, United Kingdom
Conference papers
hal-00870886v1
|
|||
|
Revisiting Clause Exchange in Parallel SAT Solving15th International Conference on Theory and Applications of Satisfiability Testing (SAT'12), 2012, Trento, Italy. pp.200-213
Conference papers
hal-00865596v1
|
||
Local-Search Extraction of MUSesConstraints Journal, Special issue on Local Search in Constraint Satisfaction, 2007, 12 (3), pp.325-344
Journal articles
hal-00191085v1
|
|||
A new local search algorithm to compute inconsistent kernels6th International Meta-heuristics International Conference (MIC'05), Aug 2005, Vienne, Austria
Conference papers
hal-00456080v1
|
|||
|
PeneLoPe, a Parallel Clause-Freezer SolverSAT Challenge 2012: Solver and Benchmarks Descriptions, 2012, France. pp.43-44
Conference papers
hal-00865592v1
|
||
|
preSAT: SAT Solver Description2008
Reports
hal-00872842v1
|
||
Extraction d'ensembles minimaux conflictuels basée sur la recherche localeRevue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, 2008, 22 (2), pp.161-181
Journal articles
hal-00800650v1
|
|||
|
Résolution parallèle de SAT: mieux collaborer pour aller plus loinJFPC 2012, 2012, Toulouse, France
Conference papers
hal-00818239v1
|
||
MUS-Based Generation of Arguments and Counter-arguments11th IEEE International Conference on Information Reuse and Integration (IEEE IRI'10), 2010, Las Vegas, United States. pp.239-244
Conference papers
hal-00873095v1
|
- 1
- 2