Skip to main content

TASSAT 3: TEORIA Y APLICACIONES EN SATISFACTIBILIDAD Y OPTIMIZACION DE RESTRICCIONES.

TIN2016-76573-C2-1-P

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POMPEU FABRA CCT

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Robust algorithms with polynomial loss for near-unanimity CSPs

  • Dalmau, Víctor
  • Kozik, Marcin
  • Krokhin, Andrei
  • Makarychev, Konstantin
  • Makarychev, Yury
  • Opršal, Jakub
An instance of the constraint satisfaction problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints. An approximation algorithm for a CSP is called robust if it outputs an assignment satisfying an (1 - g(ϵ))-fraction of constraints on any (1 ϵ)- satisfiable instance, where the loss function g is such that g(ϵ) → 0 as ϵ → 0. We study how the robust approximability of CSPs depends on the set of constraint relations allowed in instances, the so-called constraint language. All constraint languages admitting a robust polynomial-time algorithm (with some g) have been characterized by Barto and Kozik, with the general bound on the loss g being doubly exponential, specifically g(ϵ) = O((log log(1/ϵ))/ log(1/ϵ)). It is natural to ask when a better loss can be achieved, in particular polynomial loss g(ϵ) = O(ϵ1/k) for some constant k. In this paper, we consider CSPs with a constraint language having a near-unanimity polymorphism. This general condition almost matches a known necessary condition for having a robust algorithm with polynomial loss. We give two randomized robust algorithms with polynomial loss for such CSPs: one works for any near-unanimity polymorphism and the parameter k in the loss depends on the size of the domain and the arity of the relations in Γ, while the other works for a special ternary near-unanimity operation called the dual discriminator with k = 2 for any domain size. In the latter case, the CSP is a common generalization of Unique Games with a fixed domain and 2-Sat. In the former case, we use the algebraic approach to the CSP. Both cases use the standard semidefinite programming relaxation for the CSP., The first author's research was partially supported by MINECO under grant TIN2016-76573-C2-1-P and Maria de Maeztu Units of Excellence programme MDM-2015-0502. The fifth author's research was partially supported by NSF awards CAREER CCF-1150062 and IIS-1302662. The sixth author's research was supported by the European Research Council (grant agreement 681988, CSP-Infinity). The research of the second and sixth authors was partially supported by the National Science Centre Poland under grant UMO-2014/13/B/ST6/01812.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Dismantlability, connectedness, and mixing in relational structures

  • Briceño, Raimundo
  • Bulatov, Andrei A.
  • Dalmau, Víctor
  • Larose, Benoit
The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have been shown to play a crucial role in many of those applications. For instance, in the decision CSPs, structural properties of the relational structures involved—like, for example, dismantlability—and their logical characterizations have been instrumental for determining the complexity and other properties of the problem. Topological properties of the solution set such as connectedness are related to the hardness of CSPs over random structures. Additionally, in approximate counting and statistical physics, where CSPs emerge in the form of spin systems, mixing properties and the uniqueness of Gibbs measures have been heavily exploited for approximating partition functions and free energy. In spite of the great diversity of those features, there are some eerie similarities between them. These were observed and made more precise in the case of graph homomorphisms by Brightwell and Winkler, who showed that dismantlability of the target graph, connectedness of the set of homomorphisms, and good mixing properties of the corresponding spin system are all equivalent. In this paper we go a step further and demonstrate similar connections for arbitrary CSPs. This requires much deeper understanding of dismantling and the structure of the solution space in the case of relational structures, and new refined concepts of mixing introduced by Briceño. In addition, we develop properties related to the study of valid extensions of a given partially defined homomorphism, an approach that turns out to be novel even in the graph case. We also add to the mix the combinatorial property of finite duality and its logic counterpart, FO-definability, studied by Larose, Loten, and Tardif., The first author was supported by CONICYT/FONDECYT Postdoctorado 3190191 and ERC Starting Grants 678520 and 676970. The second author was supported by an NSERC Discovery grant. The third author was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22, and Maria de Maeztu Unit of Excellence Programme MDM-2015-0502. The fourth author was supported by an NSERC Discovery grant and FRQNT.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Conjunctive queries: unique characterizations and exact learnability

  • ten Cate, Balder
  • Dalmau, Víctor
Comunicació presentada a: ICDT 2021 celebrat del 23 a 26 de març de 2021 a Nicòsia, Xipre., We answer the question of which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning algorithm for a class of conjunctive queries. At the core of our contributions lie two new polynomial-time algorithms for constructing frontiers in the homomorphism lattice of finite structures. We also discuss implications for the unique characterizability and learnability of schema mappings and of description logic concepts., Victor Dalmau was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

The complexity of the distributed constraint satisfaction problem

  • Butti, Silvia
  • Dalmau, Víctor
Comunicació presentada a: STACS 2021 celebrat del 16 a 19 de març de 2021 a Saarbrücken, Alemanya., We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each other by sending messages through fixed communication channels. Our results endorse the well-known fact from classical CSPs that the complexity of fixed-template computational problems depends on the template’s invariance under certain operations. Specifically, we show that DCSP(Γ) is polynomial-time tractable if and only if Γ is invariant under symmetric polymorphisms of all arities. Otherwise, there are no algorithms that solve DCSP(Γ) in finite time. We also show that the same condition holds for the search variant of DCSP. Collaterally, our results unveil a feature of the processes’ neighbourhood in a distributed network, its iterated degree, which plays a major role in the analysis. We explore this notion establishing a tight connection with the basic linear programming relaxation of a CSP., The project that gave rise to these results received the support of a fellowship from “la Caixa” Foundation (ID 100010434). The fellowship code is LCF/BQ/DI18/11660056. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 713673. Victor Dalmau was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Optimality of syntactic dependency distances

  • Ferrer-i-Cancho, Ramon
  • Gómez-Rodríguez, Carlos
  • Esteban, Juan Luis
  • Alemany-Puig, Lluís
[Abstract]: It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score have been scarce and focused mostly on English. Here we recast the problem of the optimality of the word order of a sentence as an optimization problem on a spatial network where the vertices are words, arcs indicate syntactic dependencies, and the space is defined by the linear order of the words in the sentence. We introduce a score to quantify the cognitive pressure to reduce the distance between linked words in a sentence. The analysis of sentences from 93 languages representing 19 linguistic families reveals that half of languages are optimized to a 70 % or more. The score indicates that distances are not significantly reduced in a few languages and confirms two theoretical predictions: that longer sentences are more optimized and that distances are more likely to be longer than expected by chance in short sentences. We present a hierarchical ranking of languages by their degree of optimization. The score has implications for various fields of language research (dependency linguistics, typology, historical linguistics, clinical linguistics, and cognitive science). Finally, the principles behind the design of the score have implications for network science., We are grateful to C. Bentz, N. Català, M. H. Christiansen, M. Gustison, and A. Hernández-Fernández for helpful comments. R.F.C. and L.A.P. are supported by Grant No. TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). R.F.C. is also supported by the recognition No. 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). L.A.P. is also supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. C.G.R. is supported by the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation program (FASTPARSE, Grant No. 714150), the ANSWER-ASAP project (No. TIN2017-85160-C2-1-R) and SCANNER-UDC project (No. PID2020-113230RB-C21) from ERDF/MICINN-AEI, and Xunta de Galicia (ED431C 2020/11 and an Oportunius program grant to complement ERC grants); the CITIC research center is funded by ERDF and Xunta de Galicia (ERDFGalicia 2014-2020 program, Grant No. ED431G 2019/01). J.L.E. is funded by Grants No. TIN2016-76573-C2-1-P and No. PID2019-109137GB-C22 from MINECO. R.F.C. designed the research; R.F.C and C.G.R. wrote the paper; C.G.R. collected and preprocessed data; C.G.R. and R.F.C. analyzed the data; R.F.C, C.G.R., and J.L.E developed the mathematical arguments; C.G.R., J.L.E., and L.A.P. wrote the core code; all authors verified the mathematical arguments., Xunta de Galicia; ED431C 2020/11, Xunta de Galicia; ED431G 2019/01, Agència de Gestió d'Ajuts Universitaris i de Recerca; 2017SGR-856
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

The complexity of the distributed constraint satisfaction problem

  • Butti, Silvia
  • Dalmau, Víctor
Comunicació presentada a: STACS 2021 celebrat del 16 a 19 de març de 2021 a Saarbrücken, Alemanya., We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each other by sending messages through fixed communication channels. Our results endorse the well-known fact from classical CSPs that the complexity of fixed-template computational problems depends on the template’s invariance under certain operations. Specifically, we show that DCSP(Γ) is polynomial-time tractable if and only if Γ is invariant under symmetric polymorphisms of all arities. Otherwise, there are no algorithms that solve DCSP(Γ) in finite time. We also show that the same condition holds for the search variant of DCSP. Collaterally, our results unveil a feature of the processes’ neighbourhood in a distributed network, its iterated degree, which plays a major role in the analysis. We explore this notion establishing a tight connection with the basic linear programming relaxation of a CSP., The project that gave rise to these results received the support of a fellowship from “la Caixa” Foundation (ID 100010434). The fellowship code is LCF/BQ/DI18/11660056. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 713673. Victor Dalmau was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Robust algorithms with polynomial loss for near-unanimity CSPs

  • Dalmau, Víctor
  • Kozik, Marcin
  • Krokhin, Andrei
  • Makarychev, Konstantin
  • Makarychev, Yury
  • Opršal, Jakub
An instance of the constraint satisfaction problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints. An approximation algorithm for a CSP is called robust if it outputs an assignment satisfying an (1 - g(ϵ))-fraction of constraints on any (1 ϵ)- satisfiable instance, where the loss function g is such that g(ϵ) → 0 as ϵ → 0. We study how the robust approximability of CSPs depends on the set of constraint relations allowed in instances, the so-called constraint language. All constraint languages admitting a robust polynomial-time algorithm (with some g) have been characterized by Barto and Kozik, with the general bound on the loss g being doubly exponential, specifically g(ϵ) = O((log log(1/ϵ))/ log(1/ϵ)). It is natural to ask when a better loss can be achieved, in particular polynomial loss g(ϵ) = O(ϵ1/k) for some constant k. In this paper, we consider CSPs with a constraint language having a near-unanimity polymorphism. This general condition almost matches a known necessary condition for having a robust algorithm with polynomial loss. We give two randomized robust algorithms with polynomial loss for such CSPs: one works for any near-unanimity polymorphism and the parameter k in the loss depends on the size of the domain and the arity of the relations in Γ, while the other works for a special ternary near-unanimity operation called the dual discriminator with k = 2 for any domain size. In the latter case, the CSP is a common generalization of Unique Games with a fixed domain and 2-Sat. In the former case, we use the algebraic approach to the CSP. Both cases use the standard semidefinite programming relaxation for the CSP., The first author's research was partially supported by MINECO under grant TIN2016-76573-C2-1-P and Maria de Maeztu Units of Excellence programme MDM-2015-0502. The fifth author's research was partially supported by NSF awards CAREER CCF-1150062 and IIS-1302662. The sixth author's research was supported by the European Research Council (grant agreement 681988, CSP-Infinity). The research of the second and sixth authors was partially supported by the National Science Centre Poland under grant UMO-2014/13/B/ST6/01812.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Dismantlability, connectedness, and mixing in relational structures

  • Briceño, Raimundo
  • Bulatov, Andrei A.
  • Dalmau, Víctor
  • Larose, Benoit
The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have been shown to play a crucial role in many of those applications. For instance, in the decision CSPs, structural properties of the relational structures involved—like, for example, dismantlability—and their logical characterizations have been instrumental for determining the complexity and other properties of the problem. Topological properties of the solution set such as connectedness are related to the hardness of CSPs over random structures. Additionally, in approximate counting and statistical physics, where CSPs emerge in the form of spin systems, mixing properties and the uniqueness of Gibbs measures have been heavily exploited for approximating partition functions and free energy. In spite of the great diversity of those features, there are some eerie similarities between them. These were observed and made more precise in the case of graph homomorphisms by Brightwell and Winkler, who showed that dismantlability of the target graph, connectedness of the set of homomorphisms, and good mixing properties of the corresponding spin system are all equivalent. In this paper we go a step further and demonstrate similar connections for arbitrary CSPs. This requires much deeper understanding of dismantling and the structure of the solution space in the case of relational structures, and new refined concepts of mixing introduced by Briceño. In addition, we develop properties related to the study of valid extensions of a given partially defined homomorphism, an approach that turns out to be novel even in the graph case. We also add to the mix the combinatorial property of finite duality and its logic counterpart, FO-definability, studied by Larose, Loten, and Tardif., The first author was supported by CONICYT/FONDECYT Postdoctorado 3190191 and ERC Starting Grants 678520 and 676970. The second author was supported by an NSERC Discovery grant. The third author was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22, and Maria de Maeztu Unit of Excellence Programme MDM-2015-0502. The fourth author was supported by an NSERC Discovery grant and FRQNT.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Conjunctive queries: unique characterizations and exact learnability

  • ten Cate, Balder
  • Dalmau, Víctor
Comunicació presentada a: ICDT 2021 celebrat del 23 a 26 de març de 2021 a Nicòsia, Xipre., We answer the question of which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning algorithm for a class of conjunctive queries. At the core of our contributions lie two new polynomial-time algorithms for constructing frontiers in the homomorphism lattice of finite structures. We also discuss implications for the unique characterizability and learnability of schema mappings and of description logic concepts., Victor Dalmau was supported by MICCIN grants TIN2016-76573-C2-1P and PID2019-109137GB-C22.