Refining Constraint Weighting

Autor: Christophe Lecoutre, Hugues Wattez, Anastasia Paparrizou, Sébastien Tabary

Publikováno v: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence, Nov 2019, Portland, United States. ⟨10.1109/ICTAI.2019.00019⟩
ICTAI

International audience; Backtracking search is a complete approach that is traditionally used to solve instances modeled as constraint satisfaction problems. The space explored during search depends dramatically on the order that variables are instan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::900e45c842e84f4d8e239bfa280fe285
https://hal.archives-ouvertes.fr/hal-02414832

Constraint-Based Symmetry Detection in General Game Playing

Autor: Éric Piette, Frédéric Koriche, Sylvain Lagrue, Sébastien Tabary

Publikováno v: The International Joint Conference on Artificial Intelligence: (IJCAI'17)
The International Joint Conference on Artificial Intelligence
Twenty-Sixth International Joint Conference on Artificial Intelligence
Twenty-Sixth International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. pp.280-287, ⟨10.24963/ijcai.2017/40⟩
IJCAI

Symmetry detection is a promising approach for reducing the search tree of games. In General Game Playing (GGP), where any game is compactly represented by a set of rules in the Game Description Language (GDL), the state-of-the-art methods for symmet

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d46daafca5d043f69dbf525062eb47a7
https://cris.maastrichtuniversity.nl/en/publications/0c4150a8-f590-4359-9179-f6304e4f9709

An Adaptive Parallel SAT Solver

Autor: Jean-Marie Lagniez, Sébastien Tabary, Nicolas Szczepanski, Gilles Audemard

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319449524
CP

We present and evaluate AmPharoS, a new parallel SAT solver based on the divide and conquer paradigm. This solver, designed to work on a great number of cores, runs workers on sub-formulas restricted to cubes. In addition to classical clause sharing,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::25c988f6e66f9412142e80ceaf5097ee
https://doi.org/10.1007/978-3-319-44953-1_3

Recording and Minimizing Nogoods from Restarts

Autor: Sébastien Tabary, Christophe Lecoutre, Lakhdar Sais, Vincent Vidal

Publikováno v: Journal on Satisfiability, Boolean Modeling and Computation(JSAT)
Journal on Satisfiability, Boolean Modeling and Computation(JSAT), 2007, 1, pp.147-167

In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next ones. More precisely, nogoods are recorded when the current cutoff valu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d87d6e2deefb2412901dc7d2c0b059ad
https://doi.org/10.3233/sat190009

Lightweight Detection of Variable Symmetries for Constraint Satisfaction

Autor: Christophe Lecoutre, Sébastien Tabary

Publikováno v: 21st International Conference on Tools with Artificial Intelligence (ICTAI'09)
21st International Conference on Tools with Artificial Intelligence (ICTAI'09), 2009, Newark, United States. pp.193-197
ICTAI

International audience; In this paper, we propose to automatically detect vari- able symmetries of CSP instances by computing for each constraint scope a partition exhibiting locally symmetric variables. From this local information obtained in polyno

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d1f4fb418c87ca6a65c7ecdfdb95cdc
https://hal.archives-ouvertes.fr/hal-00865351