Pasar al contenido principal

TASSAT: TEORIA, APLICACIONES Y SINERGIA EN SAT, CSP Y FDL

TIN2010-20967-C04-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

The Fractal Dimension of SAT Formulas

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit the underlying structure of industrial instances. However, there is not a precise definition of the notion of structure. Recently, there have been some attempts to analyze this structure in terms of complex networks, with the long-term aim of explaining the success of SAT solving techniques, and possibly improving them. We study the fractal dimension of SAT instances with the aim of complementing the model that describes the structure of industrial instances. We show that many industrial families of formulas are self-similar, with a small fractal dimension. We also show how this dimension is affected by the addition of learnt clauses during the execution of SAT solvers., This research has been partially founded by the MINECO research project TASSAT (TIN2010-20967).
Repositori Obert UdL
Publicación Contribución de congreso (ConferenceOutput)

Generating Hard Satisfiable Scheduling Instances

  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Cabiscol i Teixidó, Alba
  • Fernàndez Camon, César
  • Manyà Serres, Felip
  • Gomes, Carla
We present a random generator of partially complete round robin timetables that produces exclusively satisfiable instances, and provide experimental evidence that there is an easy-hard-easy pattern in the computational difficulty of completing partially complete timetables as the ratio of the number of removed entries to the total number of entries of the timetable is varied. Timetables in the hard region provide a suitable test-bed for evaluating and fine-tuning local search algorithms, Research partially funded by the Generalitat de Catalunya under grant AGAUR 2009-SGR-1434, the Ministerio de EconomÍa y Competividad research projects AT CONSOLIDER CSD2007-0022, INGENIO 2010, ARINF TIN2009-14704-C03-01, TASSAT TIN2010- 20967-C04-01/03, and Newmatica INNPACTO IPT-2011-1496-310000 (funded by the Ministerio de Ciencia y Tecnología until 2011).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Generating Hard Satisfiable Scheduling Instances

  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Cabiscol i Teixidó, Alba
  • Fernàndez Camon, César
  • Manyà Serres, Felip
  • Gomes, Carla
We present a random generator of partially complete round robin timetables that produces exclusively satisfiable instances, and provide experimental evidence that there is an easy-hard-easy pattern in the computational difficulty of completing partially complete timetables as the ratio of the number of removed entries to the total number of entries of the timetable is varied. Timetables in the hard region provide a suitable test-bed for evaluating and fine-tuning local search algorithms, Research partially funded by the Generalitat de Catalunya under grant AGAUR 2009-SGR-1434, the Ministerio de EconomÍa y Competividad research projects AT CONSOLIDER CSD2007-0022, INGENIO 2010, ARINF TIN2009-14704-C03-01, TASSAT TIN2010- 20967-C04-01/03, and Newmatica INNPACTO IPT-2011-1496-310000 (funded by the Ministerio de Ciencia y Tecnología until 2011).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The Fractal Dimension of SAT Formulas

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit the underlying structure of industrial instances. However, there is not a precise definition of the notion of structure. Recently, there have been some attempts to analyze this structure in terms of complex networks, with the long-term aim of explaining the success of SAT solving techniques, and possibly improving them. We study the fractal dimension of SAT instances with the aim of complementing the model that describes the structure of industrial instances. We show that many industrial families of formulas are self-similar, with a small fractal dimension. We also show how this dimension is affected by the addition of learnt clauses during the execution of SAT solvers., This research has been partially founded by the MINECO research project TASSAT (TIN2010-20967).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Anti-Unification for Unranked Terms and Hedges

  • Kutsia, Temur
  • Levy, Jordi
  • Villaret i Ausellé, Mateu
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges S1 and S2 is concerned with finding their generalization, a hedge ǭ such that both S1 and S2 are instances of ǭ under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with different top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations. Then, we improve the efficiency of the algorithm by restrictingpossible alternatives permitted in the generalizations. The restrictions are imposed with the help of a rigidity function that is a parameter in the improved algorithm and selects certain common subsequences from the hedges to be generalized. Finally, we indicate a possible application of the algorithm in software engineering, This research has been partially supported by the Spanish Ministerio de Economa y Competitividad under the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the EC FP6 for Integrated Infrastructures Initiatives under the project SCIEnce (contract No. 026133), by the Austrian Science Fund (FWF) under the project SToUT (P 24087-N18), and by the Generalitat de Catalunya under the grant AGAUR 2009-SGR-1434
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Anti-unification for unranked terms and hedges

  • Kutsia, Temur
  • Levy, Jordi
  • Villaret i Ausellé, Mateu
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges -1 and -2 is concerned with finding their generalization, a hedge q such that both -1 and -2 are instances of q under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with different top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations. Then, we improve the efficiency of the algorithm by restricting possible alternatives permitted in the generalizations. The restrictions are imposed with the help of a rigidity function, which is a parameter in the improved algorithm and selects certain common subsequences from the hedges to be generalized. The obtained rigid anti-unification algorithm is further made more precise by permitting combination of hedge and term variables in generalizations. Finally, we indicate a possible application of the algorithm in software engineering, This research has been partially supported by the Spanish Ministerio de Economía y Competitividad under the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the EC FP6 for Integrated Infrastructures Initiatives under the project SCIEnce (contract No. 026133), by the Austrian Science Fund (FWF) under the project SToUT (P 24087-N18), and by the Generalitat de Catalunya under the grant AGAUR 2009-SGR-1434