{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:28Z","timestamp":1761610348708,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3619,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s1571-0661(04)80847-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The Universe of Approximations"],"prefix":"10.1016","volume":"84","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[]},{"given":"Renata","family":"Wassermann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1975","series-title":"Entailment: The Logic of Relevance and Necessity, Vol. 1","author":"Anderson","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB2","unstructured":"K. Broda and M. Finger. KE-tableaux for a fragment of linear logic. In Proceedings of the 4th International Workshop on Analytic Tableaux and Related Methods, Koblenz, May 1995"},{"issue":"3","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1093\/jigpal\/7.3.283","article-title":"Labelled natural deduction for substructural logics","volume":"7","author":"Broda","year":"1999","journal-title":"Logic Journal of the IGPL"},{"issue":"1","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02136173","article-title":"The complexity of entailment in propositional multivalued logics","volume":"18","author":"Cadoli","year":"1996","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"6","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB5","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1093\/jigpal\/9.6.755","article-title":"Approximate belief revision","volume":"9","author":"Chopra","year":"2001","journal-title":"Logic Journal of the IGPL"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00881958","article-title":"A Generalization of Analytic Deduction via Labelled Tableaux, part I: Basic Substructural Logics","volume":"13","author":"D'Agostino","year":"1994","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF00156916","article-title":"Are tableaux an improvement on truth-tables?\u2014cut-free proofs and bivalence","volume":"1","author":"D'Agostino","year":"1992","journal-title":"Journal of Logic, Language and Information"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB8","unstructured":"Wagner Dias. Tableaux implementation for approximate reasoning (in portuguese). Master's thesis, Dept. of Computer Science, University of S\u00e3o Paulo, 2002."},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB9","first-page":"77","article-title":"Approximate reasoning and paraconsistency","author":"Finger","year":"2001","journal-title":"8th Workshop on Logic, Language, Information and Computation (WoLLIC'2001)"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB10","series-title":"IJCAI-2001 Workshop on Inconsistency in Data and Knowledge","first-page":"71","article-title":"Tableaux for approximate reasoning","author":"Finger","year":"2001"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB11","unstructured":"Marcelo Finger and Renata Wassermann. Expressivity and control in limited reasoning. In Frank van Harmelen, editor, 15th European Conference on Artificial Intelligence (ECA102), pages 272-276, Lyon, France, 2002. IOS Press."},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB12","unstructured":"Hector Levesque. A logic of implicit and explicit belief. In Proceedings of AAAI-84, 1984."},{"issue":"2","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB13","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","article-title":"Tractable reasoning via approximation","volume":"74","author":"Schaerf","year":"1995","journal-title":"Artificial Intelligence"},{"year":"1968","series-title":"First-Order Logic","author":"Smullyan","key":"10.1016\/S1571-0661(04)80847-8_NEWBIB14"},{"key":"10.1016\/S1571-0661(04)80847-8_NEWBIB15","unstructured":"Annette ten Teije and Frank van Harmelen. Computing approximate diagnoses by using approximate entailment. In Proceedings of KR'96, 1996."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:28Z","timestamp":1761609988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104808478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"alternative-id":["S1571066104808478"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80847-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Universe of Approximations","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80847-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}