{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:32:19Z","timestamp":1725496339913},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001973"},{"type":"electronic","value":"9783540361879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36187-1_71","type":"book-chapter","created":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T01:17:37Z","timestamp":1196212657000},"page":"723-723","source":"Crossref","is-referenced-by-count":2,"title":["A Defeasible Logic of Policy-Based Intention (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Guido","family":"Governatori","sequence":"first","affiliation":[]},{"given":"Vineet","family":"Padmanabhan","sequence":"additional","affiliation":[]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"71_CR1","unstructured":"Antoniou G., D. Billington, G. Governatori, and M. J. Maher. A flexible framework for defeasible logics. In (AAAI-2000), pages 401\u2013405. AAAI\/MIT Press, 2000."},{"issue":"2","key":"71_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/371316.371517","volume":"2","author":"G. Antoniou","year":"2001","unstructured":"Antoniou G., D. Billington, G. Governatori, and M. J. Maher. Representation results for defeasible logic. ACM Transactions on Computational Logic, 2(2):255\u2013287, 2001.","journal-title":"ACM Transactions on Computational Logic"},{"key":"71_CR3","volume-title":"Intentions, Plans and Practical Reason","author":"M. E. Bratman","year":"1987","unstructured":"Bratman M. E. Intentions, Plans and Practical Reason. Harvard University Press, Cambridge, MA, 1987."},{"issue":"6","key":"71_CR4","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1017\/S1471068401001168","volume":"1","author":"M. J. Maher","year":"2001","unstructured":"Michael J. Maher. Propositional defeasible logic has linear complexity. Theory and Practice ofL ogic Programming, 1(6):691\u2013711, 2001.","journal-title":"Theory and Practice ofL ogic Programming"}],"container-title":["Lecture Notes in Computer Science","AI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36187-1_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T23:18:21Z","timestamp":1551136701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36187-1_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001973","9783540361879"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-36187-1_71","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}