GitHub - LukasKinder/THEIA: A labeling based backtracking solver for Abstract Argumentation, Bachelor Project

LukasKinder / THEIA Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A labeling based backtracking solver for Abstract Argumentation, Bachelor Project

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
.vscode		.vscode
README.txt		README.txt
dictionary.c		dictionary.c
dictionary.h		dictionary.h
example_ICCMA2019.tgf		example_ICCMA2019.tgf
graph.c		graph.c
graph.h		graph.h
heuristic.c		heuristic.c
heuristic.h		heuristic.h
main.c		main.c
propagateLabels.c		propagateLabels.c
propagateLabels.h		propagateLabels.h
solver.c		solver.c
solver.h		solver.h
theia		theia

Repository files navigation

complie with gcc *.c -lm -o theia

run with "./theia -f <path>" with <path> being the path to some argumentation frame in trivial graph format.

the -v flag may be used to print the search tree

the -p flag may be used as well but the only valid argument is EE-CO (finding all complete sets).

the -h flag may be used to specify an heurist. Possible arguments are "min", "sum", "exp" and "adp" (default). 

Example:
./theia -p EE-CO  -f  example_ICCMA2019.tgf -h sum
or
./theia -f example_ICCMA2019.tgf -v