ICAIL '87 Proceedings of the 1st international conference on Artificial intelligence and law
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Temporal reasoning over deontic specifications
Deontic logic in computer science
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
A complete and compact propositional deontic logic
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Towards metalogical systematisation of deontic action logics based on Boolean algebra
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
Characterizing locality (encapsulation) with bisimulation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A logical framework to deal with variability
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Encapsulating deontic and branching time specifications
Theoretical Computer Science
Model checking propositional deontic temporal logic via a μ-calculus characterization
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
| Hi-index | 0.00 |
In [1] and [2] we have introduced a novel deontic action logic for reasoning about fault-tolerance. In this paper we present a tableaux method for this logic; this proof system is sound and complete, and because the logic has the usual boolean operators on actions, it also allows us to deal successfully with action complement and parallel execution of actions. Finally, we describe an example of application of this proof system which shows how the tableaux system can be used to obtain (counter-) models of specifications.