English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160964
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

DC FieldValueLanguage
dc.contributor.authorBessiere, Christian-
dc.contributor.authorMeseguer, Pedro-
dc.contributor.authorFreuder, Eugene-
dc.contributor.authorLarrosa, Javier-
dc.date.accessioned2018-02-19T17:00:57Z-
dc.date.available2018-02-19T17:00:57Z-
dc.date.issued2002-
dc.identifierdoi: 10.1016/S0004-3702(02)00263-1-
dc.identifierissn: 0004-3702-
dc.identifier.citationArtificial Intelligence 141: 205- 224 (2002)-
dc.identifier.urihttp://hdl.handle.net/10261/160964-
dc.description.abstractSolving non-binary constraint satisfaction problems, a crucial challenge today, can be tackled in two different ways: translating the non-binary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option raises some issues when we want to extend definitions written for the binary case. This paper focuses on the well-known forward checking algorithm, and shows that it can be generalized to several non-binary versions, all fitting its binary definition. The classical non-binary version, proposed by Van Hentenryck, is only one of these generalizations. © 2002 Elsevier Science B.V. All rights reserved.-
dc.description.sponsorshipThis work was supported by an Integrated Action financed by the Generalitat de Catalunya and by the Spanish CICYT project TAP99-1086-C03 (P. Meseguer and J. Larrosa), by an “action incitative CNRS/NSF” under Grant no. 0690 (C. Bessière), and by the National Science Foundation under Grant No. IRI-9504316 (E.C. Freuder). E.C. Freuder contributed to this work while at the University of New Hampshire Computer Science Department; he is currently supported by a Science Foundation Ireland Principal Investigator Award. * Corresponding author. E-mail addresses: bessiere@lirmm.fr (C. Bessière), pedro@iiia.csic.es (P. Meseguer), e.freuder@4c.ucc.ie (E.C. Freuder), larrosa@lsi.upc.es (J. Larrosa). 1 Member of the COCONUT group (http://www.lirmm.fr/~bessiere/COCONUT/). -
dc.publisherElsevier-
dc.relation.isversionofPostprint-
dc.rightsopenAccess-
dc.subjectConstraint satisfaction-
dc.subjectForward checking-
dc.subjectNon-binary constraints-
dc.titleOn forward checking for non-binary constraint satisfaction-
dc.typeartículo-
dc.date.updated2018-02-19T17:00:57Z-
dc.description.versionPeer Reviewed-
dc.language.rfc3066eng-
dc.contributor.funderScience Foundation Ireland-
dc.contributor.funderComisión Interministerial de Ciencia y Tecnología, CICYT (España)-
dc.contributor.funderGeneralitat de Catalunya-
dc.contributor.funderUniversity of New Hampshire-
dc.relation.csic-
dc.identifier.funderhttp://dx.doi.org/10.13039/501100002809es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/501100007273es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/501100001602es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/100008284es_ES
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
AI(2002)_141(1-2)205-24.pdf236,96 kBAdobe PDFThumbnail
View/Open
Show simple item record
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.