{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:06:01Z","timestamp":1737435961512,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001317"},{"type":"electronic","value":"9783540361312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36131-6_17","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:42:30Z","timestamp":1186897350000},"page":"161-171","source":"Crossref","is-referenced-by-count":1,"title":["Restricted \u0394-Trees and Reduction Theorems in Multiple-Valued Logics"],"prefix":"10.1007","author":[{"given":"Inma P.","family":"de Guzm\u00e1n","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Ojeda-Aciego","sequence":"additional","affiliation":[]},{"given":"Agust\u00edn","family":"Valverde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"issue":"1\/2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(00)00044-X","volume":"266","author":"G. Aguilera","year":"2001","unstructured":"G. Aguilera, I. P. de Guzm\u00e1n, M. Ojeda-Aciego, and A. Valverde. Reductions for non-clausal theorem proving. Theoretical Computer Science, 266(1\/2):81\u2013112, 2001.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008311022292","volume":"9","author":"S. Aguzzoli","year":"2000","unstructured":"S. Aguzzoli and A. Ciabattoni. Finiteness in infinite-valued Lukasiewicz logic. Journal of Logic, Language and Information, 9(1):5\u201329, 2000.","journal-title":"Journal of Logic, Language and Information"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"C. Files, R. Drechsler, and M. Perkowski. Functional decomposition of MVL functions using multi-valued decision diagrams. In Proc. ISMVL\u201997, pages 7\u201332, 1997.","DOI":"10.1109\/ISMVL.1997.601370"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1020530109551","volume":"72","author":"G. Guti\u00e9rrez","year":"2002","unstructured":"G. Guti\u00e9rrez, I. P. de Guzm\u00e1n, J. Mart\u00ednez, M. Ojeda-Aciego, and A. Valverde. Satisfiability testing for Boolean formulas using \u0394-trees. Studia Logica, 72:33\u201360, 2002.","journal-title":"Studia Logica"},{"issue":"4","key":"17_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s005000050048","volume":"2","author":"I. P. Guzm\u00e1n de","year":"1999","unstructured":"I. P. de Guzm\u00e1n, M. Ojeda-Aciego, and A. Valverde. Reducing signed propositional formulas. Soft Computing, 2(4):157\u2013166, 1999.","journal-title":"Soft Computing"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"I. P. de Guzm\u00e1n, M. Ojeda-Aciego, and A. Valverde. Restricted \u0394-trees in multiple-valued logics. In AI-Methodologies, Systems, Applications. AIMSA\u201902. Lect. Notes in Computer Science 2443, 2002.","DOI":"10.1007\/3-540-46148-5_23"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"R. H\u00e4hnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. Intl Symp on Multiple-Valued Logic, pages 238\u2013245. IEEE Press, 1991.","DOI":"10.1109\/ISMVL.1991.130736"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0304-3975(98)00012-7","volume":"200","author":"D. Mundici","year":"1998","unstructured":"D. Mundici and N. Olivetti. Resolution and model building in the infinite-valued calculus of Lukasiewicz. Theoretical Computer Science, 200:335\u2013366, 1998.","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"N. V. Murray and E. Rosenthal. Improving tableau deductions in multiple-valued logics. In Proc. 21st Intl Symp on Multiple-Valued Logic, pages 230\u2013237. IEEE Press, 1991.","DOI":"10.1109\/ISMVL.1991.130735"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"D. Pearce, I. P. de Guzm\u00e1n, and A. Valverde. Computing equilibrium models using signed formulas. In Proc. 1st Intl Conf on Computational Logic, CL\u20192000, Lect. Notes in Artificial Intelligence 1861, pages 688\u2013702, 2000.","DOI":"10.1007\/3-540-44957-4_46"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2014 IBERAMIA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36131-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:42:13Z","timestamp":1737362533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36131-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001317","9783540361312"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36131-6_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}