17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Hong Kong, China November 14-November 16 ISBN: 0-7695-2488-5
In this paper, we approach a derivation of the fifth challenge presented on IJCAI 1997 [4], that is to detect inconsistency by means of incomplete methods. Whereas this problem is of considerable interest, no significant contribution have emerged since 1997. In order to treat this matter, we review [3] that showed how to detect unsatisfiable CSP instances by coloring a graph. We observe that this approach doesn?t seem to offer the expected prospects. Anyway, we exploit a similar process that permits to prove graph uncolorability by a CSP consistency check.
Citation:
Jean-Nicolas Bès, Philippe Jégou, "Proving Graph Un-Colorability with a Consistency Check of CSP," ictai, pp.693-694, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb