{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:28:06Z","timestamp":1747157286847},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705246"},{"type":"electronic","value":"9783540705253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70525-3_4","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T12:17:57Z","timestamp":1215951477000},"page":"34-48","source":"Crossref","is-referenced-by-count":10,"title":["A Tableaux System for Deontic Action Logic"],"prefix":"10.1007","author":[{"given":"Pablo F.","family":"Castro","sequence":"first","affiliation":[]},{"given":"T. S. E.","family":"Maibaum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"5th IEEE International Conference on Software Engineering and Formal Methods","author":"P. Castro","year":"2007","unstructured":"Castro, P., Maibaum, T.: An ought-to-do deontic logic for reasoning about fault-tolerance: The diarrheic philosophers. In: 5th IEEE International Conference on Software Engineering and Formal Methods. IEEE, Los Alamitos (2007)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-75292-9_8","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"P. Castro","year":"2007","unstructured":"Castro, P., Maibaum, T.: A complete and compact deontic action logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol.\u00a04711, pp. 109\u2013123. Springer, Heidelberg (2007)"},{"key":"4_CR3","unstructured":"Kent, S., Quirk, B., Maibaum, T.: Specifying deontic behavior in modal action logic. Technical report, Forest Research Project (1991)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Meyer, J.: A different approach to deontic logic: Deontic logic viewed as variant of dynamic logic. Notre Dame Journal of Formal Logic\u00a029 (1988)","DOI":"10.1305\/ndjfl\/1093637776"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01212304","volume":"4","author":"J. Fiadeiro","year":"1992","unstructured":"Fiadeiro, J., Maibaum, T.: Temporal theories as modularization units for concurrent system specification. Formal Aspects of Computing\u00a04, 239\u2013272 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"4_CR6","unstructured":"Broersen, J.: Modal Action Logics for Reasoning about Reactive Systems. PhD thesis, Vrije University (2003)"},{"key":"4_CR7","unstructured":"Castro, P., Maibaum, T.: Reasoning about system-degradation and fault-recovery with deontic logic. In: Workshop on Methods, Models and Tools for Fault-Tolerance (2007)"},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R. Smullyian","year":"1968","unstructured":"Smullyian, R.: First-Order Logic. Springer, New York (1968)"},{"key":"4_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","volume-title":"First-Order Logic and Automated Theorem Proving","author":"M. Fitting","year":"1990","unstructured":"Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, Heidelberg (1990)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Pratt, V.: A Practical Decision Method for Propositional Dynamic Logic. In: ACM Symposium on Theory of Computing (1978)","DOI":"10.1145\/800133.804362"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fitting, M.: Tableau methods of proof for modal logics. Notre Dame Journal of Formal Logic XIII (April 1972)","DOI":"10.1305\/ndjfl\/1093894722"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Giacomo, G., Massacci, F.: Tableaux and algorithms for propositional dynamic logic with converse. In: Conference on Automated Deduction (1996)","DOI":"10.1007\/3-540-61511-3_117"},{"key":"4_CR13","unstructured":"Maibaum, T.: Temporal reasoning over deontic specifications. In: Sons, J.W. (ed.) Deontic Logic in Computer Science (1993)"},{"key":"4_CR14","unstructured":"Meyer, J., Wieringa, R., Dignum, F.: The paradoxes of deontic logic revisited: A computer science perspective. Technical Report UU-CS-1994-38, Utrecht University (1994)"},{"key":"4_CR15","volume-title":"Temporal Logic in Computation","author":"S. Khosla","year":"1985","unstructured":"Khosla, S., Maibaum, T.: The prescription and description of state-based systems. In: Banieqnal, B., Pnueli, H.A. (eds.) Temporal Logic in Computation. Springer, Heidelberg (1985)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Gargov, G., Passy, S.: A note on boolean logic. In: Petkov, P.P. (ed.) Proceedings of the Heyting Summerschool. Plenum Press (1990)","DOI":"10.1007\/978-1-4613-0609-2_21"},{"key":"4_CR17","unstructured":"Fitch, F.B.: Tree proofs in modal logics. Journal of Symbolic Logic (1966)"},{"key":"4_CR18","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9452-5","volume-title":"Mathematical Logic","author":"J. Monk","year":"1976","unstructured":"Monk, J.: Mathematical Logic. Graduate Texts in Mathematics. Springer, Heidelberg (1976)"},{"key":"4_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1: Equations and Initial Semantics","author":"H. Ehrig","year":"1985","unstructured":"Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer, Heidelberg (1985)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Belzer, M.: Legal reasoning in 3-d. In: ICAIL, pp. 155\u2013163 (1987)","DOI":"10.1145\/41735.41753"},{"key":"4_CR21","unstructured":"Artosi, A., Governatori, G.: A tableau methodology for deontic conditional. In: DEON 1998, International Workshop on Deontic Logic in Computer Science, pp. 65\u201381 (1998)"},{"key":"4_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-540-24581-0_29","volume-title":"AI 2003: Advances in Artificial Intelligence","author":"G. Governatori","year":"2003","unstructured":"Governatori, G., Lomuscio, A., Sergot, M.J.: A tableaux system for deontic interpreted systems. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol.\u00a02903, pp. 339\u2013351. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Deontic Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70525-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T16:49:01Z","timestamp":1557679741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70525-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705246","9783540705253"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70525-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}