Solve dynamic programming problems on tree decompositions using databases
Branch normalize_cli is required by dpdb (currently not included in htd's master)
- Python 3
- psycopg2
- future-fstrings (for compatibility with older versions)
pip install -r requirements.txt
Basic configuration (database connection, htd path, ...) are configured in config.json
python dpdb.py [GENERAL-OPTIONS] -f <INPUT-FILE> <PROBLEM> [PROBLEM-SPECIFIC-OPTIONS]
- SAT
- #SAT
- Minimum Vertex Cover
For additional help use
python dpdb.py --help
or
python dpdb.py <PROBLEM> --help
for problem specific help/options
Currently no indices are created. It is an open problem to investigate whether good indices can be determined just by the structure of the problem.
Oracle's Bitmap Indices also seem worth a try (Oracle Enterprise Feature)
Re-construct input from database to be able to run the same instance again (without needing a seed for htd) or to resume previously unfinished jobs.