STIT based deontic logics for the miners puzzle

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we first develop two new STIT based deontic logics capable of solving the miners puzzle. The key idea is to use pessimistic lifting to lift the preference over worlds into the preference over sets of worlds. Then we also discuss a more general version of the miners puzzle in which plausibility is involved. In order to deal with the more general puzzle we add a modal operator representing plausibility to our logic. Lastly we present a sound and complete axiomatization.

Cite

CITATION STYLE

APA

Sun, X., & Baniasadi, Z. (2015). STIT based deontic logics for the miners puzzle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8953, pp. 236–251). Springer Verlag. https://doi.org/10.1007/978-3-319-17130-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free