Filtrer vos résultats
- 65
- 10
- 48
- 21
- 3
- 3
- 75
- 8
- 1
- 1
- 8
- 4
- 5
- 9
- 8
- 3
- 3
- 8
- 10
- 6
- 4
- 3
- 1
- 2
- 1
- 65
- 10
- 71
- 8
- 7
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 75
- 16
- 12
- 11
- 11
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
75 résultats
|
Tractability of explaining classifier decisionsArtificial Intelligence, 2023, 316, pp.103841. ⟨10.1016/j.artint.2022.103841⟩
Article dans une revue
hal-04311250v1
|
||
|
Abductive Explanations of Classifiers under Constraints: Complexity and Properties26th European Conference on Artificial Intelligence (ECAI 2023), European Association for Artificial Intelligence (EurAI); Polish Artificial Intelligence Society (PSSI), Sep 2023, Krakow, Poland. pp.469 - 476, ⟨10.3233/FAIA230305⟩
Communication dans un congrès
hal-04210428v2
|
||
|
Tractable Explanations for d-DNNF Classifiers36th AAAI Conference on Artificial Intelligence (AAAI 2022), AAAI: American Association for Artificial Intelligence, Feb 2022, Seattle (virtual), United States. pp.5719-5728, ⟨10.1609/aaai.v36i5.20514⟩
Communication dans un congrès
hal-03873826v1
|
||
|
Monotone Temporal Planning : tractability, extensions and applications (Extended abstract)20th International Conference on Principles and Practice of Constraint Programming (CP), Sep 2014, Lyon, France. pp. 928-932
Communication dans un congrès
hal-01153605v1
|
||
|
Caractérisation de la complexité des classes de CSP définies par des motifs interdits à deux contraintes.JFPC - Journées Francophones de Programmation par Contraintes - 2012, May 2012, Toulouse, France
Communication dans un congrès
hal-00811871v1
|
||
|
Variable Elimination in Binary CSPs (Extended Abstract)Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jul 2020, Yokohama, France. pp.5035-5039, ⟨10.24963/ijcai.2020/702⟩
Communication dans un congrès
hal-02897892v1
|
||
|
On the Tractability of Explaining Decisions of Classifiers27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Oct 2021, Montpellier (en ligne), France. pp.21:1-21:18, ⟨10.4230/LIPIcs.CP.2021.21⟩
Communication dans un congrès
hal-03523350v1
|
||
|
Une famille de classes polynomiales de CSP basée sur la microstructure11eme Journees Francophones de Programmation par Contraintes (JFPC 2015), Jun 2015, Bordeaux, France. pp. 59-68
Communication dans un congrès
hal-01375398v1
|
||
|
Complexity of Minimum-Size Arc-Inconsistency ExplanationsCP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. pp.9:1 - 9:14, ⟨10.4230/LIPIcs.CP.2022.9⟩
Communication dans un congrès
lirmm-03833388v1
|
||
|
Domain Reduction for Valued Constraints by Generalising Methods from CSP24th International Conference on Principles and Practice of Constraint Programming (CP 2018), Aug 2018, Lille, France. pp.64-80
Communication dans un congrès
hal-02283157v1
|
||
|
Optimal soft arc consistency20th International Joint Conference on Artificial Intelligence - IJCAI 2007, Jan 2007, Hyderabad, India. pp.6
Communication dans un congrès
hal-02754114v1
|
||
|
Variable elimination in binary CSPs2019
Pré-publication, Document de travail
hal-02142769v1
|
||
|
Binary constraint satisfaction problems defined by excluded topological minorsInformation and Computation, 2019, 264, pp.12-31. ⟨10.1016/j.ic.2018.09.013⟩
Article dans une revue
hal-03311390v1
|
||
|
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay2020
Pré-publication, Document de travail
hal-02950823v1
|
||
|
On Singleton Arc Consistency for CSPs Defined by Monotone PatternsInternational Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. pp.19 - 20, ⟨10.4230/LIPIcs.STACS.2018.19⟩
Communication dans un congrès
hal-02930099v1
|
||
|
Efficient Explanations for Knowledge Compilation Languages2021
Pré-publication, Document de travail
hal-03311518v1
|
||
|
An Algebraic Theory of Complexity for Discrete OptimizationSIAM Journal on Computing, 2013, vol. 42 (n° 5), pp. 1915-1939. ⟨10.1137/130906398⟩
Article dans une revue
hal-01122748v1
|
||
|
Extending Broken Triangles and Enhanced Value-Merging22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), Sep 2016, Toulouse, France. pp. 173-188
Communication dans un congrès
hal-01475026v1
|
||
Réseaux de contraintes valuésPanorama de l'intelligence artificielle : Vol 2 : Algorithmes pour l'intelligence artificielle, Cepaduès Editions, 364 p., 2014, 9782364930421
Chapitre d'ouvrage
hal-02795963v1
|
|||
|
On Broken Triangles (IJCAI 2016)Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), International Joint Conferences on Artificial Intelligence (IJCAI); Association for the Advancement of Artificial Intelligence, Jul 2016, New York City, United States. pp.4135-4139
Communication dans un congrès
hal-01356058v1
|
||
|
Tractability in Constraint Satisfaction Problems: A SurveyConstraints, 2016, 21 (2), pp.115-144. ⟨10.1007/s10601-015-9198-6⟩
Article dans une revue
hal-01230685v1
|
||
|
Cohérence d'arc virtuelle pour les CSP pondérésJFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, LINA - Université de Nantes - Ecole des Mines de Nantes, Jun 2008, Nantes, France. pp.237-246
Communication dans un congrès
inria-00292640v1
|
||
|
Compilation d'un langage de planification temporelle de haut niveau en PDDL2.1RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. pp.978-2-9539515-2-3
Communication dans un congrès
hal-00656490v1
|
||
|
Temporal Epistemic Gossip Problems16th European Conference on Multi-Agent Systems (EUMAS 2018), Dec 2018, Bergen, Norway. pp.1-14
Communication dans un congrès
hal-02378391v1
|
||
|
Complexity of minimum-size arc-inconsistency explanationsConstraints, 2023, 28, pp.427-449. ⟨10.1007/s10601-023-09360-5⟩
Article dans une revue
hal-04275512v1
|
||
|
The power of arc consistency for CSPs defined by partially-ordered forbidden patternsLogical Methods in Computer Science, 2017, 13 (4:26), pp.1-32. ⟨10.23638/LMCS-13(4:26)2017⟩
Article dans une revue
hal-02640799v1
|
||
|
Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden PatternsJournal of Computer and System Sciences, 2015, 81 (7), pp.1127-1143. ⟨10.1016/j.jcss.2015.02.001⟩
Article dans une revue
hal-01280349v1
|
||
|
Autour des Triangles Cassés11es Journées Francophones de Programmation par Contraintes (JFPC 2015), Jun 2015, Bordeaux, France. pp.57-58
Communication dans un congrès
hal-01356093v1
|
||
|
Broken Triangles Revisited21st International Conference on Principles and Practice of Constraint Programming (CP 2015), Aug 2015, Cork, Ireland. pp. 58-73
Communication dans un congrès
hal-01343049v1
|
||
|
Isomorphismes entre instances et sous-instances STRIPSJournées Francophones de Programmation par Contraintes, Association Française pour l’Intelligence Artificielle (AFIA), Jun 2022, Saint-Etienne, France. pp.35-42
Communication dans un congrès
hal-03819065v1
|