Reference : On computing kernels on fuzzy simple graphs by combinatorial enumeration using a CPL(...
Scientific congresses, symposiums and conference proceedings : Unpublished conference
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/46933
On computing kernels on fuzzy simple graphs by combinatorial enumeration using a CPL(FD) system
English
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
9-Sep-1996
11
Yes
8th Benelux Workshop on Logic Programming
9 September 1996
Université catholique de Louvain
Louvain-la-Neuve
Belgium
[en] Algorithmic Decision Theory ; Kernels in digraphs ; Combinatorial Enumeration ; CLP(FD) system ; Logic Proframming
[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.
Centre de Recherche Public Gabriel Lippmann
CRP
Researchers
http://hdl.handle.net/10993/46933

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
benelog1996.pdfAuthor preprint228.77 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.