Informes técnicos de investigación DSIC-IA-PS

Permanent URI for this collection

https://riunet.upv.es/handle/10251/8355

Colección de documentos de trabajo, informes técnicos y otro material de investigación realizado por los investigadores del Departamento de Sistemas Informáticos y Computación (DSIC). Grupo: Inteligencia Artificial, Planificacion y Scheduling de la Universitat Politècnica de València en el desarrollo de sus investigaciones.

El grupo "Inteligencia Artificial, Planificación y Scheduling" (IA-GPS) es un Grupo de Investigación registrado en la Base de Datos Tecnológica (CARTA G-9015-2006) de la Universidad Politecnica de Valencia (UPV) e integrado en el Instituto de Automática e Informática Industrial de la UPV .

Browse

Recent Submissions

Now showing 1 - 2 of 2
  • Thumbnail Image
    Publication
    Robustness, Stability, Recoverability and Reliability in CSP
    (Universitat Politècnica de València, 2013-05-17) Barber Sanchís, Federico; Salido Gregorio, Miguel Angel; Departamento de Sistemas Informáticos y Computación; Escuela Técnica Superior de Ingeniería Aeroespacial y Diseño Industrial; Instituto Universitario de Automática e Informática Industrial
    Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world scenarios the problem is partially known, imprecise, and dynamic such that some effects of actions are undesired and/or several un-foreseen incidences or changes can occur. Whereas expressivity, efficiency, and optimality have been the typical goals in the area, there are several issues regarding robustness that have a clear relevance in dynamic Constraint Satisfaction Problems (CSP). However, there is still no clear and common definition of robustness-related concepts in CSPs. In this paper, we propose two clearly differentiated definitions for robustness and stability in CSP solutions. We also introduce the concepts of recoverability and reliability, which arise in temporal CSPs. All these definitions are based on related well-known concepts, that are addressed in engineering and other related areas.
  • Thumbnail Image
    Publication
    Robustness, Stability, Recoverability and Reliability in Dynamic Constraint Satisfaction Problems
    (Universitat Politècnica de València, 2011-04-11) Barber Sanchís, Federico; Salido Gregorio, Miguel Angel; Departamento de Sistemas Informáticos y Computación; Escuela Técnica Superior de Ingeniería Aeroespacial y Diseño Industrial; Instituto Universitario de Automática e Informática Industrial
    Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world scenarios the problem is partially known, imprecise and dynamic, so that some effects of actions are undesired and/or several un-foreseen incidences or changes can occur. Whereas expressivity, efficiency, and optimality have been the typical goals in the area, several is-sues regarding robustness appear with a clear relevance in dynamic constraint satisfaction problems (DCSPs). However, there is still no a clear and common definition of robustness-related concepts in CSPs. In this paper, we propose two clearly differentiated definitions for robustness and stability in CSP solutions. We also introduce the concepts of recoverability and reliability which arise in temporal DCSPs. All these definitions are based on related well-known concepts addressed in engineering and other related areas.