Abstract
Action description languages, such as \(\mathcal{A}\) and \(\mathcal{B}\) [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of \(\cal B\), using Constraint Logic Programming over Finite Domains. The approach is then generalized to lift the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed.KeywordsPlanning ProblemLogic ProgrammingAction LanguageAction DescriptionConstraint Logic ProgrammingThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
