Automated Reasoning over Deontic Action Logics with Finite Vocabularies


In this paper we investigate further the tableaux system for a deontic action logic we presented in previous work. This tableaux system uses atoms (of a given boolean algebra of action terms) as labels of formulae. This allows us to embrace parallel execution of actions and action complement, two action operators that may present difficulties in their… (More)
DOI: 10.4204/EPTCS.139.2

4 Figures and Tables


  • Presentations referencing similar topics