English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160964
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 | DATACITE
Exportar a otros formatos:


On forward checking for non-binary constraint satisfaction

AuthorsBessiere, Christian; Meseguer, Pedro ; Freuder, Eugene; Larrosa, Javier
KeywordsConstraint satisfaction
Forward checking
Non-binary constraints
Issue Date2002
CitationArtificial Intelligence 141: 205- 224 (2002)
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.
Identifiersdoi: 10.1016/S0004-3702(02)00263-1
issn: 0004-3702
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
AI(2002)_141(1-2)205-24.pdf236,96 kBAdobe PDFThumbnail
Show full item record
Review this work

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