No label defined (Q3144061)
Jump to navigation
Jump to search
Project Q3144061 in Spain
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No label defined |
Project Q3144061 in Spain |
Statements
155,727.0 Euro
0 references
311,454.0 Euro
0 references
50.0 percent
0 references
1 January 2014
0 references
30 June 2017
0 references
UNIVERSIDAD DE LERIDA
0 references
41°36'53.14"N, 0°37'36.41"E
0 references
25120
0 references
ESTE PROYECTO GIRA ENTORNO A LOS PROBLEMAS DE LA SATISFACTIBILIDAD Y OPTIMIZACION DE RESTRICCIONES, TANTO EN LOGICA PROPOSICIONAL (SAT) COMO EN LENGUAJES DE RESTRICCIONES MAS EXPRESIVOS (CSP). NOS PROPONEMOS REALIZAR INVESTIGACION_x000D_ PUNTERA EN ESTA AREA APROVECHANDO LA EXPERIENCIA DE LOS CUATRO GRUPOS QUE COMPONEN EL PROYECTO. TASSAT 2 ES LA CONTINUACION DEL PROYECTO QUE LO ENGENDRA, TASSAT, QUE YA HA DEMOSTRADO SU VIABILIDAD Y RECORRIDO. POR ELLO, LOS_x000D_ OBJETIVOS GENERALES QUE NOS PROPONEMOS SON POR UNA PARTE CONTINUISTAS Y POR OTRA INNOVADORES, CON LOS SIGUIENTES OBJETIVOS CONCRETOS EN PARTICULAR:_x000D_ POR UNA PARTE, EN SAT SEGUIREMOS ESTUDIANDO LA ESTRUCTURA DE LAS INSTANCIAS PROVENIENTES DEL MUNDO INDUSTRIAL Y APLICAR ESTE CONOCIMIENTO AL DESARROLLO DE SOLVERS, TANTO DE SAT COMO DE MAXSAT, MAS EFICIENTES. EN CSP SEGUIREMOS_x000D_ CONTRIBUYENDO AL PROBLEMA DE LA CLASIFICACION DE LAS CLASES DE RESTRICCIONES TRATABLES. TAMBIEN ESTUDIAREMOS ALGORITMOS PARA INSTANCIAS GEOMETRICAS DE MAXCSP Y PROBLEMAS COMBINATORIOS, DE INTERES PARA LA TEORIA DE LA COMPLEJIDAD_x000D_ COMPUTACIONAL. UNA NOVEDAD IMPORTANTE DEL PRESENTE PROYECTO ES SU MAYOR ENFASIS EN LA IMPLEMENTACION DE SOLVERS PRACTICOS, INCLUYENDO NUEVOS ALGORITMOS DE BRANCH-AND-BOUND PARA MAXSAT, SOFT LEARNING PARA MAXSAT, TECNICAS_x000D_ MEJORADAS PARA LA SELECCION DE VARIABLES, PORTAFOLIOS, ETC. QUEREMOS EXPANDIR NUESTRA PRESENCIA EN COMPETICIONES DE SOLVERS Y PARTICIPAR EN LA SOLUCION DE PROBLEMAS INDUSTRIALES. OTRA NOVEDAD SIGNIFICATIVA EN LOS OBJETIVOS ES QUE SE_x000D_ AMPLIARA EL MARCO DE APLICACION DE LOS METODOS GEOMETRICOS PARA INCLUIR PROBLEMAS DE ISOMORFISMO DE GRAFOS Y OTRAS ESTRUCTURAS DE INTERES EN COMBINATORIA Y OTRAS AREAS DE LA CIENCIA. ESTE NUEVO OBJETIVO SE DERIVA DE LOS RESULTADOS OBTENIDOS EN EL PROYECTO ANTERIOR QUE YA HAN TENIDO UN NOTABLE IMPACTO INTERNACIONAL._x000D_ _x000D_ LA PALABRA CLAVE EFFICIENCY APARECE EN LAS ACTIVIDADES RELACIONADAS CON ICT DEL PROGRAMA EUROPEO H2020 (VEASE SC4 Y SC5 EN "SOCIETAL CHALLENGES"). ESTO PUEDE REFERIRSE A DISTRIBUCION DE ENERGIA, APLICACIONES LOGISTICAS, ETC. SOLVERS DE_x000D_ SAT Y MAXSAT SON TECNOLOGIAS RELATIVAMENTE NUEVAS PARA PROBLEMAS DE OPTIMIZACION QUE PUEDEN APLICARSE A ESTAS AREAS. UNO DE NUESTROS OBJETIVOS ES CONSOLIDAR UNA RED DE GRUPOS DE INVESTIGACION EN EL AREA PARA PODER COMPETIR EN LA SOLICITUD DE PROYECTOS EUROPEOS. (Spanish)
0 references
THIS PROJECT REVOLVES AROUND THE PROBLEMS OF SATISFACTION AND OPTIMISATION OF RESTRICTIONS, BOTH IN LOGIC PROPOSITIONAL (SAT) AND IN MORE EXPRESSIVE RESTRICTION LANGUAGES (CSP). We PROPOSES TO REQUEST INVESTIGATION_x000D_ POINTER IN THIS AREA PROVIDED THE EXPERIENCE OF THE FOUR GROUPS COMPONING THE PROJECT. TASSAT 2 IS THE CONTINUATION OF THE PROJECT THAT ENGENDERS IT, TASSAT, WHICH HAS ALREADY DEMONSTRATED ITS VIABILITY AND ROUTE. For THEY, THE_x000D_ GENERAL OBJECTIVES THAT WE PROPONE US FOR A Continuous PART AND BY OTHER INNOVATIONS, WITH THE NEXTIVE OBJECTIVES IN PARTICULAR:_x000D_ BY A PARTY, in SAT we continue to study the structuring of the developing institutions of the industrial world and to apply this knowledge to the development of SOLVERS, as well as as a result of MAXSAT’s most effective development. In CSP SEGUIREMOS_x000D_ CONTRIBUTION TO THE PROBLEM OF THE CLASSIFICATION OF Treatable RESTRITION CLASSES. We will also study ALGORITMOS FOR GEOMETRIC INSTANCES OF MAXCSP AND Combinatory PROBLEMS, OF INTERESTS FOR THE THEORY OF COMPLEJITY_x000D_ COMPUTATIONAL. An IMPORTANT NEW PROJECT OF THE PRESENT PROJECT IMPLEMENTATION IN THE IMPLEMENTATION OF PRACTICAL SOLVERS, INCLUDING NEW BRANCH-AND-BOUND ALGORITMOS FOR MAXSAT, SOFT LEARNING FOR MAXSAT, TECNICAS_x000D_ Improved FOR VARIABLE Selection, portfolios, ETC. WE WANT TO EXPAND OUR PRESENCE IN SOLVERS COMPETITIONS AND PARTICIPATE IN THE SOLUTION OF INDUSTRIAL PROBLEMS. Another SIGNIFICATIVE NEWS IN OBJECTIVES IS THE SE_x000D_ to extend the framework for the application of GEOMETRIC METODS to include isomorphism proBLEMS OF GRAFOS AND Other STRUCTURES OF INTERESTS IN COMBINATORY AND OTHER SCIENCE AREAS. This NEW OBJECTIVE is set out in the first draft that has an international notice._x000D__x000D__x000D__x000D__x000D__x000D___x000D__x000D__x000D__x000D__x000D___x000D__x000D__x000D__x000D___x000D___x000D___x000D__x000D__x000D__x000D__x000D__x000D___x000D__x000D___x000D__x000D___x000D__x000D__x000D__x005 F_x000D__x000D___x000D__x000D__x000D__x005 F_x000D___x000D__x000D___x000D___x000D___x000D__x000D___x000D_ This may refer to ENERGY DISTRIBUTION, LOGISTIC APPLICATIONS, ETC. SOLVERS DE_x000D_ SAT AND MAXSAT ARE TECHNOLOGIES RELATIVELY NEW FOR OPTIMISATION PROBLEMS that may be applied to these areas. ONE OF OUR OBJECTIVES IS TO CONSOLIDATE A NETWORK OF RESEARCH GROUPS IN THE AREA IN ORDER TO COMPETE IN THE APPLICATION FOR EUROPEAN PROJECTS. (English)
12 October 2021
0 references
Lleida
0 references
Identifiers
TIN2013-48031-C4-4-P
0 references