Communications of the ACM
SOKOBAN and other motion planning problems
Computational Geometry: Theory and Applications
Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Simplifying dynamic programming via mode-directed tabling
Software—Practice & Experience
Linear tabling strategies and optimizations
Theory and Practice of Logic Programming
Engineering an Incremental ASP Solver
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Journal of Experimental & Theoretical Artificial Intelligence
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Domain-independent construction of pattern database heuristics for cost-optimal planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Mode-Directed Tabling for Dynamic Programming, Machine Learning, and Constraint Solving
ICTAI '10 Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 02
Perspectives on logic-based approaches for reasoning about actions and change
Logic programming, knowledge representation, and nonmonotonic reasoning
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
An Investigation of Multi-Agent Planning in CLP
Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009
The language features and architecture of b-prolog
Theory and Practice of Logic Programming - Prolog Systems
| Hi-index | 0.00 |
This paper presents our program in B-Prolog submitted to the third ASP solver competition for the Sokoban problem. This program, based on dynamic programming, treats Sokoban as a generalized shortest path problem. It divides a problem into independent subproblems and uses mode-directed tabling to store subproblems and their answers. This program is very simple but quite efficient. Without use of any sophisticated domain knowledge, it easily solves 14 of the 15 instances used in the competition. We show that the approach can be easily applied to other optimization planning problems.