This is the DALI extension that allows to use Answer Set Programming solvers in order to make the best effort to have solutions of NP-hard problems in a reasonable time, under the bounded rationality principle.
A case study applied to the Knight's Tour Problem has been presented at DCAI 2015, in Salamanca, Spain, 3 June 2015.
If you user this code, please cite us in your work:
- Costantini S., De Gasperis G, Nazzicone G. Exploration of Unknown Territory via DALI Agents and ASP Modules. Distributed Computing and Artificial Intelligence, 12th International Conference, pp 285-292, 3-4 June 2015, Salamanca, ES, Springer
Note: all of the third parties opensource libraries used on the web interface have to be installed separately.