{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:31Z","timestamp":1725455851979},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055887X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023435","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:47:37Z","timestamp":1132397257000},"page":"304-318","source":"Crossref","is-referenced-by-count":0,"title":["An ordered resolution and paramodulation calculus for finite many-valued logics"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Zabel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Michael Dummett. A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24(2):97\u2013106, June 1959.","journal-title":"Journal of Symbolic Logic"},{"key":"18_CR2","unstructured":"Jean H. Gallier. Logic for Computer Science. Harper & Row, 1986."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, second, extended edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"18_CR4","unstructured":"Donald W. Loveland. Automatic Theorem Proving: a logical basis, volume 6 of Fundamental Studies in Computer Science. North Holland, 1978."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/malq.19740202508","volume":"20","author":"C. Morgan","year":"1974","unstructured":"Charles Morgan. A theory of equality for a class of many valued predicate calculi. Zeitschrift, f\u00fcr mathematische Logik und Grundlagen der Mathematik, 20:427\u2013432, 1974.","journal-title":"Zeitschrift, f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"18_CR6","unstructured":"Charles Morgan. Similarity as a theory of graded equality for a class of many-valued predicate calculi. In Proceedings of the IEEE Symposium of many-valued logics, pages 436\u2013449, Bloomington, Long Beach, 1975."},{"key":"18_CR7","first-page":"311","volume":"74\u201376","author":"C. Morgan","year":"1976","unstructured":"Charles Morgan. A resolution principle for a. class of many valued logics. Logique et Analyse, 74\u201376:311\u2013339. 1976.","journal-title":"Logique et Analyse"},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1978-2102","volume":"II","author":"E. Orlowska","year":"1978","unstructured":"Ewa Orlowska. The resolution principle for \u03c9 +-valued logic. Fundamenta Informaticae, II(1):1\u201315, 1978.","journal-title":"Fundamenta Informaticae"},{"key":"18_CR9","first-page":"235","volume":"III","author":"O. Ewa","year":"1979","unstructured":"Ewa Orlowska. The resolution systems and their applications I. Fundamenta Informaticae, III:235\u2013268, 1979.","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"18_CR10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FI-1980-3306","volume":"III","author":"E. Orlowska","year":"1980","unstructured":"Ewa Orlowska. The resolution systems and their applications II. Fundamenta Informaticae, III(3):333\u2013362, 1980.","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(08)80130-7","volume":"11","author":"J. Pais","year":"1991","unstructured":"John Pais and Gerald E. Peterson. Using forcing to prove completeness of resolution and paramodalution. Journal of Symbolic Computation, 11(1 & 2):3\u201319, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"18_CR12","unstructured":"G. A. Robinson and L. Wos. Paramodulation and theorem proving in first order theories with equality. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 4, pages 135\u2013150. Edinburgh University Press, 1968."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"James A. Robinson. A machine oriented logic based resolution principle. Journal of the Association for Computing Machinery, 12:23\u201341, 1965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"18_CR14","unstructured":"J. Barkley Rosser and Atwell R. Turquette. Many-valued Logics. North Holland, 1952."},{"key":"18_CR15","unstructured":"Micha\u00ebl Rusinowitch. D\u00e9monstration automatique par des techniques de r\u00e9\u00e9criture. PhD thesis, Nancy-1 France, November 1987. Th\u00e8se d' Etat-also available as textbook (Inter Editions, Paris 1989)."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0049-237X(08)71542-8","volume-title":"Truth, syntax and modality \u2014 proceedings of the Temple University conference on alternative semantics","author":"D. S. Scott","year":"1973","unstructured":"Dana S. Scott. Background to formalization. In Hugues Leblanc, editor, Truth, syntax and modality \u2014 proceedings of the Temple University conference on alternative semantics, pages 244\u2013273, Philadelphia, Pa, 29\u201330.12.70, 1973. North Holland."},{"issue":"4","key":"18_CR17","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321420.321428","volume":"14","author":"J. R. Slagle","year":"1967","unstructured":"James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, 14(4):687\u2013697, October 1967.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FI-1990-13307","volume":"XIII","author":"Z. Stachniak","year":"1990","unstructured":"Zbigniew Stachniak and Peter O'Hearn. Resolution in the domain of strongly finite logics. Fundamenta Infonmaticae, XIII:333\u2013351, 1990.","journal-title":"Fundamenta Infonmaticae"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023435.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T02:21:18Z","timestamp":1626747678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055887X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0023435","relation":{},"subject":[]}}