Graph Coloring Domain
More details about this benchmark can be found in the web page: BENCHMARK PROBLEMS FOR ANSWER SET PROGRAMMING SYSTEMS.
A graph pmen means that this graph has m vertices n edges. In particular,
p100e570, p300e1760, p600e3554, p1000e5950, p3000e13525, p6000e35946
are the same as
p100, p300, p600, p1000, p3000, and p6000 repectively, which appeared
in references about Smodels. The graphs with 10000 atoms were generalized randomly.
color.lp( Own to Niemela 1999).