Normal Forms for Priority Graphs Johan van Benthem, Davide Grossi Abstract: This brief note compares a few ways of deriving pre-orders over sets of objects from strict partial orders over properties of those objects —so-called priority graphs that have recently been used by logicians as a rich explicit model of preference merge, belief revision, norm change, and other aspects of agency. Our note establishes equivalence results between three popular formats for priority graphs, and defines a normal form for them.