{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:08Z","timestamp":1720624928498},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81005-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"40-57","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On the Relative Complexity of Labelled Modal Tableaux"],"prefix":"10.1016","volume":"78","author":[{"given":"Guido","family":"Governatori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB1","series-title":"Advances in Modal Logic. Volume 1","first-page":"1","article-title":"Shakespearian modal logic: A labelled treatment of Modal identity","author":"Artosi","year":"1998"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB2","series-title":"TABLEAUX'98, number 1397 in LNCS","first-page":"25","article-title":"Comparison of theorem provers for modal logics - introduction and summary","author":"Balsiger","year":"1998"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1013886427723","article-title":"Free variable tableaux for propositional modal logics","volume":"69","author":"Beckert","year":"2001","journal-title":"Studia Logica"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/jigpal\/8.3.265","article-title":"Resolution-based methods for modal logics","volume":"8","author":"de Nivelle","year":"2000","journal-title":"Logic Journal of IGPL"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB6","first-page":"152","article-title":"Tree proofs in modal logic","volume":"31","author":"Fitch","year":"1966","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB7","series-title":"\u201cProof Methods for Modal and Intuitionistic Logics,\u201d","author":"Fitting","year":"1983"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB8","series-title":"\u201cLabelled Deductive System,\u201d","author":"Gabbay","year":"1996"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB9","series-title":"Labelled Deduction, Applied Logic Series 17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-94-011-4040-9_7","article-title":"Fibred modal tableaux","author":"Gabbay","year":"2000"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB10","unstructured":"Governatori G., \u201cUn modello formale per il ragionamento giuridico,\u201d Ph.D. thesis, CIRFID, University of Bologan, Bologna (1997). URL www.itee.uq.edu.au\/~guido\/Papers\/_KEM\/tese.pdf"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB11","series-title":"AI\u2217IA 99: Advances in Artificial Intelligence, LNAI 1792","first-page":"119","article-title":"Labelled tableaux for non-normal modal logics","author":"Governatori","year":"2000"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1093\/jigpal\/8.3.293","article-title":"An analysis of empirical testing for modal decision procedures","volume":"8","author":"Horrocks","year":"2000","journal-title":"Logic Journal of IGPL"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB13","unstructured":"Hustadt U. and R. Schmidt, On evaluating decision procedures for modal logic, in: Proc. of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), 1997, pp. 202\u2013207."},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB14","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1145\/153724.153773","article-title":"Modal non-monotonic logics: Ranges, characterization, computation","volume":"40","author":"Marek","year":"1993","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB15","series-title":"CADE-12, number 814 in LNAI","first-page":"723","article-title":"Strongly analytic tableaux for normal modal logic","author":"Massacci","year":"1994"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB16","series-title":"TABLEAUX'99, number 1617 in LNCS","first-page":"14","article-title":"Design and results of the tableaux-99 non-clssical (modal) systems comparison","author":"Massacci","year":"1999"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1006155811656","article-title":"Single step tableaux for modal logic","volume":"24","author":"Massacci","year":"2000","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB18","series-title":"TABLEAUX 2000, number 1847 in LNCS","first-page":"52","article-title":"Design and results of tancs-2000 non-clasical (modal) sustems comparison","author":"Massacci","year":"2000"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB19","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1093\/logcom\/1.5.691","article-title":"Semantic based translation methods for modal logics","volume":"1","author":"Ohlbach","year":"1991","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB20","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/malq.19890350612","article-title":"Logic for reasoning about knowledge","volume":"35","author":"Orlowska","year":"1989","journal-title":"Zeitschrift f\u00fcr mathematiske Logik und grundlagen der Mathematik"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(84)90010-0","article-title":"Representastion of nondeterministic information","volume":"29","author":"Orlowska","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB22","series-title":"\u201cFirst-Order Logic,\u201d","author":"Smullyan","year":"1968"},{"key":"10.1016\/S1571-0661(04)81005-3_NEWBIB23","series-title":"\u201cAutomated Deduction in Nonclssical Logics,\u201d","author":"Wallen","year":"1990"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:55Z","timestamp":1549191235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":23,"alternative-id":["S1571066104810053"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81005-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}