Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Kostas Stergiou"'
Autor:
Anastasia Paparrizou, Kostas Stergiou
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:535-541
Table constraints are very important in constraint programming as they are present in many real problems from areas such as configuration and databases. As a result, numerous specialized algorithms that achieve generalized arc consistency (GAC) on ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2ec8b690599350a5bd4f99c7c644dba
https://doi.org/10.1609/aaai.v26i1.8135
https://doi.org/10.1609/aaai.v26i1.8135
Autor:
Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh
Publikováno v:
Artificial Intelligence
Artificial Intelligence, In press, pp.#103896. ⟨10.1016/j.artint.2023.103896⟩
Artificial Intelligence, In press, pp.#103896. ⟨10.1016/j.artint.2023.103896⟩
International audience; 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 t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ec4a749059ec06846191ee01c993b53
https://doi.org/10.1016/j.artint.2023.103896
https://doi.org/10.1016/j.artint.2023.103896
Autor:
Kostas Stergiou
Publikováno v:
Artificial Intelligence Review. 54:5055-5093
Several methods for dynamically adapting the local consistency property applied by a CP solver during search have been put forward in recent and older literature. We propose the classification of such methods in three categories depending on the leve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f22f8177b691a4a3b0c1b0d5e405a63
https://doi.org/10.1007/s10462-021-10012-4
https://doi.org/10.1007/s10462-021-10012-4
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783030948214
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71720bd5c133728f27d4a3e41c13fa09
https://doi.org/10.1007/978-3-030-94822-1_56
https://doi.org/10.1007/978-3-030-94822-1_56
Constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example, the former focuses on one const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f814530c78cb44370012d2b07d51384d
Publikováno v:
International Conference on Principles and Practice of Constraint Programming (CP)
International Conference on Principles and Practice of Constraint Programming (CP), Sep 2020, Louvain-la-Neuve, Belgium. pp.935-951, ⟨10.1007/978-3-030-58475-7_54⟩
Lecture Notes in Computer Science ISBN: 9783030584740
CP
International Conference on Principles and Practice of Constraint Programming (CP), Sep 2020, Louvain-la-Neuve, Belgium. pp.935-951, ⟨10.1007/978-3-030-58475-7_54⟩
Lecture Notes in Computer Science ISBN: 9783030584740
CP
International audience; Interactive constraint acquisition is a special case of query-directed learning, also known as "exact" learning. It is used to assist non-expert users in modeling a constraint problem automatically by posting examples to the u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eab8d08c2132cff134af2f3a42bad2f8
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03036103/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03036103/document
Autor:
Kostas Stergiou
Publikováno v:
Constraints. 24:94-131
CP solvers predominantly use arc consistency (AC) as the default propagation method for binary constraints. Many stronger consistencies, such as triangle consistencies (e.g. RPC and maxRPC) exist, but their use is limited despite results showing that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a64521db0c7955ac1f7f72f1b578d03
https://doi.org/10.1007/s10601-018-9298-1
https://doi.org/10.1007/s10601-018-9298-1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030300470
CP
CP
MQuAcq is an algorithm for active constraint acquisition that has been shown to outperform previous algorithms such as QuAcq and MultiAcq. In this paper, we exhibit two important drawbacks of MQuAcq. First, for each negative example, the number of re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::529607e42a9a5303a74d84d6fb8edaab
https://doi.org/10.1007/978-3-030-30048-7_41
https://doi.org/10.1007/978-3-030-30048-7_41
Autor:
Louis-Martin Rousseau, Kostas Stergiou
This book constitutes the proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019, held in Thessaloniki, Greece, in June 2019.The 34 full papers presente
Autor:
Kostas Stergiou
Publikováno v:
Constraints. 22:377-402
Restricted path consistency (RPC) is a strong local consistency for binary constraints that was proposed 20 years ago and was identified as a promising alternative to arc consistency (AC) in an early experimental study of local consistencies for bina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13235689ab6cc3eddf58fe53fa4c0d41
https://doi.org/10.1007/s10601-016-9255-9
https://doi.org/10.1007/s10601-016-9255-9