  In this work, we investigate the use of Dynamic Preference Logic to encode
BDI mental attitudes. Further, exploring this codification and the
representation of preferences over possible worlds by preferences over
propositional formulas, here called priority graphs, we comment on how to
interpret BDI agent programs in this logic. Also, using the connection between
dynamic operations defined over preference models and their encoding as
transformations on priority graphs, we show how our logic can be used not only
to reason about agent programs, but as a tool to specify reasoning mechanisms
to guarantee certain properties in the theory of rationality for the
programming language.
