{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:40:11Z","timestamp":1737078011569,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441274"},{"type":"electronic","value":"9783540461487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46148-5_23","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:31:45Z","timestamp":1181183505000},"page":"223-232","source":"Crossref","is-referenced-by-count":1,"title":["Restricted \u0394-Trees in Multiple-Valued Logics"],"prefix":"10.1007","author":[{"given":"I.P.","family":"de Guzm\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ojeda-Aciego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Valverde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"issue":"1\/2","key":"23_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"},{"key":"23_CR2","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"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S1383-7621(00)00039-4","volume":"47","author":"S. Grugiel","year":"1997","unstructured":"S. Grugiel and M. Perkowski. Labeled rough partitions\u2014a new general purpose representation for multiple-valued functions and relations. Journal of Systems Architecture, 47(1):29\u201359, 1997.","journal-title":"Journal of Systems Architecture"},{"key":"23_CR4","doi-asserted-by":"crossref","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, 2002. Accepted.","DOI":"10.1023\/A:1020530109551"},{"key":"23_CR5","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"},{"issue":"6","key":"23_CR6","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1093\/logcom\/4.6.905","volume":"4","author":"R. H\u00e4hnle","year":"1994","unstructured":"R. H\u00e4hnle. Short conjunctive normal forms in finitely valued logics. Journal of Logic and Computation, 4(6):905\u2013927, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"23_CR7","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":"23_CR8","unstructured":"M. Ojeda-Aciego, I.P. de Guzm\u00e1n, and A. Valverde. Multiple-Valued Tableaux with \u0394-reductions. In Proceedings of IC-AI\u201999, pages 177\u2013183, Las Vegas, Nevada, USA, 1999."},{"issue":"4","key":"23_CR9","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":"23_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"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"A. Srinivasan, T. Karn, S. Malik, and R.E. Brayton. Algorithms for discrete function manipulation. In Proc. Intl. Conf. on CAD, pages 92\u201395, 1990.","DOI":"10.1109\/ICCAD.1990.129849"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46148-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:19:15Z","timestamp":1737076755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46148-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441274","9783540461487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46148-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}