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. © 2011 Springer-Verlag Berlin Heidelberg.