{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:50:05Z","timestamp":1725537005462},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043871"},{"type":"electronic","value":"9783642043888"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04388-8_19","type":"book-chapter","created":{"date-parts":[[2009,8,29]],"date-time":"2009-08-29T02:48:38Z","timestamp":1251514118000},"page":"240-254","source":"Crossref","is-referenced-by-count":4,"title":["Finite Satisfiability in Infinite-Valued \u0141ukasiewicz Logic"],"prefix":"10.1007","author":[{"given":"Steven","family":"Schockaert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"Janssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Vermeir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"De Cock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ijar.2006.02.003","volume":"43","author":"S. Aguzzoli","year":"2006","unstructured":"Aguzzoli, S.: An asymptotically tight bound on countermodels for \u0142ukasiewicz logic. International Journal of Approximate Reasoning\u00a043, 76\u201389 (2006)","journal-title":"International Journal of Approximate Reasoning"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008311022292","volume":"9","author":"S. Aguzzoli","year":"2000","unstructured":"Aguzzoli, S., Ciabattoni, A.: Finiteness in infinite-valued \u0141ukasiewicz logic. Journal of Logic, Language, and Information\u00a09, 5\u201329 (2000)","journal-title":"Journal of Logic, Language, and Information"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001530100118","volume":"41","author":"S. Aguzzoli","year":"2002","unstructured":"Aguzzoli, S., Gerla, B.: Finite-valued reductions of infinite-valued logics. Archive for Mathematical Logic\u00a041, 361\u2013399 (2002)","journal-title":"Archive for Mathematical Logic"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bobillo, F., Straccia, U.: Fuzzy description logics with general t-norms and datatypes. Fuzzy Sets and Systems (in press) doi:doi:10.1016\/j.fss.2009.03.006","DOI":"10.1016\/j.fss.2009.03.006"},{"key":"19_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, Heidelberg (1998)"},{"key":"19_CR6","unstructured":"Ernst, M., Millstein, T., Weld, D.: Automatic SAT-compilation of planning problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1169\u20131176 (1997)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-54487-9_62","volume-title":"Selected Papers from Computer Science Logic","author":"R. H\u00e4hnle","year":"1991","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M., Sch\u00f6nfeld, W. (eds.) Selected Papers from Computer Science Logic, pp. 248\u2013260. Springer, Heidelberg (1991)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01530787","volume":"12","author":"R. H\u00e4hnle","year":"1994","unstructured":"H\u00e4hnle, R.: Many-valued logic and mixed integer programming. Annals of Mathematics and Artificial Intelligence\u00a012, 231\u2013264 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"19_CR9","first-page":"69","volume":"4","author":"R. H\u00e4hnle","year":"1997","unstructured":"H\u00e4hnle, R., Escalada-Imaz, G.: Deduction in multivalued logics: a survey. Mathware & Soft Computing\u00a04(2), 69\u201397 (1997)","journal-title":"Mathware & Soft Computing"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Janssen, J., Heymans, S., Vermeir, D., De Cock, M.: Compiling fuzzy answer set programs to fuzzy propositional theories. In: Proceedings of the 24th International Conference on Logic Programming, pp. 362\u2013376 (2008)","DOI":"10.1007\/978-3-540-89982-2_34"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00453-007-9064-z","volume":"52","author":"T. Kavitha","year":"2008","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: An o(m\n                2\n                n) algorithm for minimum cycle basis of graphs. Algorithmica\u00a052, 333\u2013349 (2008)","journal-title":"Algorithmica"},{"issue":"1-2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2268660","volume":"16","author":"R. McNaughton","year":"1951","unstructured":"McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic\u00a016, 1\u201313 (1951)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science\u00a052, 145\u2013153 (1987)","journal-title":"Theoretical Computer Science"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0304-3975(98)00012-7","volume":"200","author":"D. Mundici","year":"1998","unstructured":"Mundici, D., Olivetti, N.: Resolution and model building in the infinite-valued calculus of \u0141ukasiewicz. Theoretical Computer Science\u00a0200, 335\u2013366 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1022989323091","volume":"73","author":"N. Olivetti","year":"2003","unstructured":"Olivetti, N.: Tableaux for \u0141ukasiewicz infinite-valued logic. Studia Logica\u00a073(1), 81\u2013111 (2003)","journal-title":"Studia Logica"},{"issue":"15","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1016\/j.artint.2008.06.003","volume":"172","author":"D. Pham","year":"2008","unstructured":"Pham, D., Thornton, J., Sattar, A.: Modelling and solving temporal reasoning as propositional satisfiability. Artificial Intelligence\u00a0172(15), 1752\u20131782 (2008)","journal-title":"Artificial Intelligence"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.artint.2008.10.009","volume":"173","author":"S. Schockaert","year":"2009","unstructured":"Schockaert, S., De Cock, M., Kerre, E.: Spatial reasoning in a fuzzy region connection calculus. Artificial Intelligence\u00a0173, 258\u2013298 (2009)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"19_CR19","first-page":"247","volume":"14","author":"U. Straccia","year":"2007","unstructured":"Straccia, U., Bobillo, F.: Mixed integer programming, general concept inclusions and fuzzy description logics. Mathware & Soft Computing\u00a014(3), 247\u2013259 (2007)","journal-title":"Mathware & Soft Computing"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/11889205_42","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"N. Tamura","year":"2006","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 590\u2013603. Springer, Heidelberg (2006)"},{"key":"19_CR21","unstructured":"Wagner, H.: A new resolution calculus for the infinite-valued propositional logic of \u0141ukasiewicz. In: Proceedings of the International Workshop on First order Theorem Proving, pp. 234\u2013243 (1998)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 641\u2013653. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04388-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T15:54:44Z","timestamp":1552146884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04388-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043871","9783642043888"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04388-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}