dct-planning

As of now, this tool provides a way of expressing NP problems in the high level language of second-order logic, and of translating them into a fragment of STRIPS. The software is grounded in Descriptive Complexity Theory, which relates the expressivity of logics to computational complexity. There are many planners able to solve the translated problems. Part of this work was presented at the 21st International Conference on Automated Planning and Scheduling, ICAPS "11 (http://icaps11.icaps-conference.org/).

so-reductions
results.py
bounds.txt
setup
problems
chromatic
solutions
solve_all.pyc
planners
domains
tool
solve_folder.py
solve_folder_4cores.py
get_problem_directories.pyc
solve_all.py
README
create_problems.py
generators
clean_all.sh
get_problem_directories.py
bash_results.sh