Synopsis:

  EXEC $(files) $(options)

 - EXEC is one of {dl.EB.hybrid.static, dl.NOEB.static, 
   dl.EB.full.static}, 
 - $(files) and $(opstions) are described below for each problem.

=========================================================================== 
 

Problem:	KNOWLEDGE-DISCOVERY 
Description:	A Problem of knowledge discovery used in EXEURA 
Options: 
Files:		program3.txt 17.dlv eel_2004_05_26.dlv 
===
Problem:	CONSTRAINT-3COL[N=30,E=40] 
Description:	3col - CSP like encoding - 30 nodes, 40 edges 
Options:	-instantiate 
Files:		constraint-3col graph3040 
===
Problem:	SCHEDULING 
Description:	scheduling 
Options:	-instantiate 
Files:		scheduling 
===
Problem:	SCHEDULING-ALTERNATE 
Description:	A modified version of scheduling 
Options:	-instantiate 
Files:		scheduling-alternate 
===
Problem:	CRISTAL 
Description:	"Deductive database use as done by Christoph Koch 
		in CERN" 
Options:	-N=85 -instantiate 
Files:		cristal_extract_viewpoint.dl 
		cristal_vp3_supermodule_subunits.dl 
===
Problem:	2QBF1 
Description:	2QBF, 1000 all-quantified, 
		20 existentially-quantified variables, 
		10000 clauses, 5CNF 
Options:	-FB -instantiate 
Files:		2qbf_1000x_20y_10000rules_5cnf.dl 
===
Problem:	ANCESTOR 
Description:	Double ancestor board of size 20x20 
Options: 
Files:		ancestor.double-board.20 
===
Problem:	3COL-SIMPLEX1 
Description:	3COL simplex graph, |edges| = 1980, |nodes| = 1035, 
		one model 
Options:	-instantiate 
Files:		simplex.44 3col 
===
Problem:	3COL-N-LADDER 
Description:	3COL ladder graph, propositional/Niemela style, 
		|nodes| = 12000, one model 
Options:	-instantiate 
Files:		3col-niemela-ladder.6000 
===
Problem:	3COL-RANDOM1 
Description:	3COL random graph, |edges| = 1100, |nodes| = 500, 
		one model 
Options:	-instantiate 
Files:		random_graph 500,1100,0,0,0,0,0,0,0,138 3col 
===
Problem:	HP-RANDOM1 
Description:	Hamiltonian Path on a random graph, |edges| = 700, 
		|nodes| = 85, one model generated with Stanford Graph 
		Base random_graph 85,700,0,0,0,0,0,1,1,33 undirected 
		graph, represented as a directed one 
Options:	-instantiate 
Files:		random_graph_85_700_0_0_0_0_0_1_1_33.d ham-path 
===
Problem:	DECOMP2 
Description:	query decomposition k=3 , one model 
Options:	-instantiate -pfilter=k_decomposable 
Files:		kdecomp.k3 kdecomp.decision 
===
Problem:	HANOI-Towers 
Description:	"Towers of Hanoi" with 3 stacks, 4 disks, and 15 steps. 
Options:	-FB -N=4322 -instantiate 
Files:		hanoi 
===
Problem:	RAMSEY 3,7 != 22 
Description:	"Ramsey 3,7 != 22" 
Options:	-N=22 -instantiate 
Files:		ramseyT37 
===
Problem:	21-QUEENS 
Description:	"N-Queens with 21 queens" 
Options:	-instantiate -n=1 
Files:		21queens 
===
Problem:	SCHOOL_TIMETABLING 
Description:	An instance of the high-school timetabling Problem 
Options:	-instantiate -N=1000 
Files:		timetablehard.dl timetable2.dl 

