Fast planning through planning graph analysis
Artificial Intelligence
Proceedings of the 1999 international conference on Logic programming
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Reasoning about Actions with CHRs and Finite Domain Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Planning with preferences using logic programming
Theory and Practice of Logic Programming
Journal of Experimental & Theoretical Artificial Intelligence
Logic Programming for Multiagent Planning with Negotiation
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Representing Multi-agent Planning in CLP
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
An experimental comparison of constraint logic programming and answer set programming
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Describing additive fluents in action language C+
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Multivalued action languages with constraints in CLP(FD)
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic programming for finding models in the logics of knowledge and its applications: A case study
Theory and Practice of Logic Programming
An Investigation of Multi-Agent Planning in CLP
Fundamenta Informaticae - On the Italian Conference on Computational Logic: CILC 2009
A comparison of CLP(FD) and ASP solutions to NP-Complete problems
ICLP'05 Proceedings of the 21st international conference on Logic Programming
A Tabled Prolog Program for Solving Sokoban
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
Action languages have gained popularity as a means for declaratively describing planning domains. This paper overviews two action languages, the Boolean language B and its multi-valued counterpart BMV. The paper analyzes some of the issues in using two alternative logic programming approaches (Answer Set Programming and Constraint Logic Programming over Finite Domains) for planning with B and BMV specifications. In particular, the paper provides an experimental comparison between these alternative implementation approaches.