[en] This paper reports our communication done at the 8th Benelux Workshop on Logic Programming in Louvain-la-Neuve, 9 September 1996. We present a constraint formulation in finite domains of the kernel construction on simple digraphs and give some comments on implementation in CHIP. Application to fuzzy choice procedures will illustrate the theoretical developments.
Research center :
- Centre de Recherche Public Gabriel Lippmann
Disciplines :
Computer science
Author, co-author :
Bisdorff, Raymond ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
no
Language :
English
Title :
On computing kernels on fuzzy simple graphs by combinatorial enumeration using a CPL(FD) system
