- -

A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS

Show simple item record

Files in this item

dc.contributor.author Arangú Lobig, Marlene Alicia es_ES
dc.contributor.author Salido, Miguel A. es_ES
dc.contributor.author Barber Sanchís, Federico es_ES
dc.date.accessioned 2018-07-16T06:49:15Z
dc.date.available 2018-07-16T06:49:15Z
dc.date.issued 2012 es_ES
dc.identifier.issn 1349-4198 es_ES
dc.identifier.uri http://hdl.handle.net/10251/105823
dc.description.abstract [EN] Arc-Consistency algorithms are the most commonly used ltering techniques to prune the search space in Constraint Satisfaction Problems (CSPs). 2-consistency is a similar technique that guarantees that any instantiation of a value to a variable can be consistently extended to any second variable. Thus, 2-consistency can be stronger than arc-consistency in binary CSPs. In this work we present a new algorithm to achieve 2- consistency called 2-C4. This algorithm is a reformulation of AC4 algorithm that is able to reduce unnecessary checking and prune more search space than AC4. The experimental results show that 2-C4 was able to prune more search space than arc-consistency algo- rithms in non-normalized instances. Furthermore, 2-C4 was more efficient than other 2-consistency algorithms presented in the literature. es_ES
dc.description.sponsorship This work has been partially supported by the research project TIN2010- 20976-C02-01 (Min. de Educacion y Ciencia, Spain-FEDER). es_ES
dc.language Inglés es_ES
dc.publisher ICIC International es_ES
dc.relation info:eu-repo/grantAgreement/MICINN//TIN2010-20976-C02-01/ES/TECNICAS PARA LA EVALUACION Y OBTENCION DE SOLUCIONES ESTABLES Y ROBUSTAS EN PROBLEMAS DE OPTIMIZACION Y SATISFACCION DE RESTRICCIONES/ es_ES
dc.relation.ispartof International Journal of Innovative Computing Information and Control es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Constraint satisfaction problems es_ES
dc.subject Consistency techniques es_ES
dc.subject 2-consistency es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS es_ES
dc.type Artículo es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation Arangú Lobig, MA.; Salido, MA.; Barber Sanchís, F. (2012). A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS. International Journal of Innovative Computing Information and Control. 8(6):3891-3906. http://hdl.handle.net/10251/105823 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://www.ijicic.org/ijicic-11-02011.pdf es_ES
dc.description.upvformatpinicio 3891 es_ES
dc.description.upvformatpfin 3906 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 8 es_ES
dc.description.issue 6 es_ES
dc.relation.pasarela S\235709 es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES


This item appears in the following Collection(s)

Show simple item record