Deontic logic (DL) is increasingly recognized as an indispensable tool in such application areas as formal representation of legal knowledge and reasoning, formal specification of computer systems and formal analysis of database integrity constraints. Despite this acknowledgement, there have been few attempts to provide computationally tractable inference mechanisms for DL. In this paper we shall be concerned with providing a computationally oriented proof method for standard DL (SDL), i.e., normal systems of modal logic with the usual possible-worlds semantics. Because of the natural and easily implementable style of proof construction it uses, this method seems particularly well-suited for applications in the AI and Law field, and though in the present version it works for SDL only, it forms an appropriate basis for developing efficient proof methods for more expressive and sophisticated extensions of SDL
