Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Carbonnel, Clement"'
Autor:
Bessiere, Christian, Carbonnel, Clement, Dries, Anton, Hebrard, Emmanuel, Katsirelos, George, Lazaar, Nadjib, Narodytska, Nina, Quimper, Claude-Guy, Stergiou, Kostas, Tsouros, Dimosthenis C., Walsh, Toby
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the user partial queries. That is, we ask the user to classify assignments t
Externí odkaz:
http://arxiv.org/abs/2003.06649
Publikováno v:
ACM Transactions on Algorithms 16(4) Article no. 54 (2020)
The complexity of (unbounded-arity) Max-CSPs under structural restrictions is poorly understood. The two most general hypergraph properties known to ensure tractability of Max-CSPs, $\beta$-acyclicity and bounded (incidence) MIM-width, are incomparab
Externí odkaz:
http://arxiv.org/abs/1904.07388
Autor:
Bessiere, Christian, Carbonnel, Clément, Dries, Anton, Hebrard, Emmanuel, Katsirelos, George, Lazaar, Nadjib, Narodytska, Nina, Quimper, Claude-Guy, Stergiou, Kostas, Tsouros, Dimosthenis C., Walsh, Toby
Publikováno v:
In Artificial Intelligence June 2023 319
Publikováno v:
SIAM Journal on Computing 51(1) (2022) 19-69
The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaitis, and Vardi [CP'02], Grohe [FOCS'03/JACM'07], and Atserias, Bulatov,
Externí odkaz:
http://arxiv.org/abs/1710.03148
Publikováno v:
Algorithmica 81(4) 1699-1727 (2019)
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a
Externí odkaz:
http://arxiv.org/abs/1704.06215
Autor:
Carbonnel, Clément, Hébrard, Emmanuel
Publikováno v:
Michel Rueher. The 22nd International Conference on Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. Lecture Notes in Computer Science, 9892, pp.147 - 156, 2016, Principles and Practice of Constraint Programming
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method also provide
Externí odkaz:
http://arxiv.org/abs/1702.02470
Autor:
Carbonnel, Clément
Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative CSP: for
Externí odkaz:
http://arxiv.org/abs/1604.07063
In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides
Externí odkaz:
http://arxiv.org/abs/1404.3675
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bessiere, Christian, Carbonnel, Clément, Dries, Anton, Hebrard, Emmanuel, Katsirelos, George, Lazaar, Nadjib, Narodytska, Nina, Quimper, Claude-Guy, Stergiou, Kostas, Tsouros, Dimosthenis C., Walsh, Toby
Publikováno v:
In Artificial Intelligence March 2024 328