English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/160964
COMPARTIR / IMPACTO:
Estadísticas
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:
Título

On forward checking for non-binary constraint satisfaction

AutorBessiere, Christian; Meseguer, Pedro ; Freuder, Eugene; Larrosa, Javier
Palabras claveConstraint satisfaction
Forward checking
Non-binary constraints
Fecha de publicación2002
EditorElsevier
CitaciónArtificial Intelligence 141: 205- 224 (2002)
ResumenSolving 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.
URIhttp://hdl.handle.net/10261/160964
Identificadoresdoi: 10.1016/S0004-3702(02)00263-1
issn: 0004-3702
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
AI(2002)_141(1-2)205-24.pdf236,96 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.