Summary: Proof Search in an Authorization Logic
Published on April 14, 2009
Revised on September 20, 2009
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
We consider the problem of proof search in an expressive authorization logic that contains
a "says" modality and an ordering on principals. After a description of the proof system for
the logic, we identify two fragments that admit complete goal-directed and saturating proof
search strategies. A smaller fragment is then presented, which supports both goal-directed
and saturating search, and has a sound and complete translation to first-order logic. We
conclude with a brief description of our implementation of goal-directed search.
This work was supported partially by the iCAST project sponsored by the National Science Council,
Taiwan, under grant no. NSC97-2745-P-001-001, and partially by the Air Force Research Laboratory under
grant no. FA87500720028.
Keywords: Access control, Logic Programming, Proof search