{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:06:51Z","timestamp":1749182811604,"version":"3.41.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1023\/a:1006170514174","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T00:53:09Z","timestamp":1040518389000},"page":"433-483","source":"Crossref","is-referenced-by-count":6,"title":["T-Resolution: Refinements and Model Elimination"],"prefix":"10.1007","volume":"22","author":[{"given":"Andrea","family":"Formisano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"185976_CR1","unstructured":"Baumgartner, P.: A model elimination calculus with built-in theories, in H. J. Ohlbach (ed.), Proceedings of the 16th German Conference on Artificial Intelligence, LNAI 671, Springer-Verlag, 1992."},{"key":"185976_CR2","unstructured":"Baumgartner, P.: An ordered theory resolution calculus, in Proceedings of the Conference on Logic Programming and Artificial Intelligence, LNAI 624, Springer-Verlag, 1992."},{"key":"185976_CR3","unstructured":"Baumgartner, P., Furbach, U. and Petermann, U.: A Unified Approach to Theory Reasoning, Technical Report 15\/92, University of Koblenz, 1992."},{"issue":"2","key":"185976_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1093\/logcom\/7.2.251","volume":"7","author":"J. F. A. K. van Benthem","year":"1996","unstructured":"van Benthem, J. F. A. K., D'Agostino, G., Montanari, A. and Policriti, A.: Modal deduction in second-order logic and set theory-I, J. Logic Comput.\n7(2) (1996), 251-265.","journal-title":"J. Logic Comput."},{"key":"185976_CR5","doi-asserted-by":"crossref","unstructured":"van Benthem, J. F. A. K., D'Agostino, G., Montanari, A. and Policriti, A.: Modal deduction in second-order logic and set theory-II, Notre Dame J. Formal Logic, 1997, to appear.","DOI":"10.1093\/logcom\/7.2.251"},{"key":"185976_CR6","volume-title":"Modal Logic and Classical Logic","author":"J. F. A. K. van Benthem","year":"1985","unstructured":"van Benthem, J. F. A. K.: Modal Logic and Classical Logic, Bibliopolis, Napoli and Atlantic Heights, NJ, 1985."},{"key":"185976_CR7","series-title":"International Series of Monographs on Computer Science","volume-title":"Computable Set Theory","author":"D. Cantone","year":"1989","unstructured":"Cantone, D., Ferro, A. and Omodeo, E. G.: Computable Set Theory, Vol. 1, International Series of Monographs on Computer Science, Clarendon Press, Oxford, 1989."},{"key":"185976_CR8","volume-title":"Lewis Carroll' Symbolic Logic","author":"L. Carroll","year":"1977","unstructured":"Carroll, L.: Lewis Carroll' Symbolic Logic, C. N. Potter, New York, 1977."},{"key":"185976_CR9","unstructured":"Chang, C. and Lee, R.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973."},{"key":"185976_CR10","unstructured":"Dovier, A., Formisano, A. and Policriti, A.: On T-logic programming, in J. Maluszynski (ed.), Proceedings of the International Logic Programming Symposium 1997. ILPS97, MIT Press."},{"issue":"3","key":"185976_CR11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00881803","volume":"15","author":"G. D'Agostino","year":"1995","unstructured":"D'Agostino, G., Montanari, A. and Policriti, A.: A set-theoretic translation method for polimodal logics, J. Automated Reasoning\n15(3) (1995), 317-337.","journal-title":"J. Automated Reasoning"},{"key":"185976_CR12","doi-asserted-by":"crossref","unstructured":"Fleisig, S., Loveland, D., Smiley III, A. K. and Yarmush, D. L.: An implementation of the model elimination proof procedure, J. ACM\n21(1) (1974).","DOI":"10.1145\/321796.321807"},{"issue":"1","key":"185976_CR13","first-page":"130","volume":"23","author":"S. Ferro","year":"1978","unstructured":"Ferro, S. and Omodeo, E. G.: An efficient validity test for formulae in extensional two-level syllogistic, Le Matematiche\n23(1) (1978), 130-137 (Catania, Italy).","journal-title":"Le Matematiche"},{"key":"185976_CR14","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/cpa.3160330503","volume":"33","author":"A. Ferro","year":"1980","unstructured":"Ferro, A., Omodeo, E. G. and Schwartz, J. T.: Decision procedures for elementary sublanguages of set theory I, Multilevel syllogistic and some extensions, Comm. Pure Appl. Math.\n33 (1980), 599-608.","journal-title":"Comm. Pure Appl. Math."},{"key":"185976_CR15","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E. and Ullman, J. D.: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"185976_CR16","unstructured":"Jaffar, J. and Lassez, J. L.: Constraint Logic Programming, Technical Report, Department of Computer Science, Monash University, June 1986."},{"key":"185976_CR17","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19-20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J. and Maher, M. J.: Constraint logic programming: A survey, J. Logic Programming\n19-20 (1994), 503-581.","journal-title":"J. Logic Programming"},{"key":"185976_CR18","unstructured":"Kowalsky, R. and Hayes, P. J.: Semantic Trees in Automatic Theorem-Proving, Machine Intelligence 4, Meltzer and Michie (eds.), Edinburgh University Press, 1969."},{"key":"185976_CR19","volume-title":"Automated Theorem Proving","author":"D. W. Loveland","year":"1978","unstructured":"Loveland, D. W.: Automated Theorem Proving, North-Holland, Amsterdam, 1978."},{"key":"185976_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BFb0012847","volume":"310","author":"R. Manthey","year":"1988","unstructured":"Manthey, R. and Bry, F.: Satchmo: A theorem prover implemented in Prolog, Lecture Notes in Comput. Sci.\n310 (1988), 415-434. CADE 9, 9th Conference on Automated Deduction.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"185976_CR21","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1979","unstructured":"Mendelson, E.: Introduction to Mathematical Logic, 2nd edn, D. Van Nostrand Company, New York, 1979.","edition":"2nd edn"},{"key":"185976_CR22","doi-asserted-by":"crossref","unstructured":"Petermann, U.: Towards a connection procedure with built-in theories, in European Workshop on Logic in AI, LNAI 478, Springer-Verlag, 1990.","DOI":"10.1007\/BFb0018458"},{"key":"185976_CR23","unstructured":"Petermann, U.: Completeness of the pool calculus with an open built-in theory, in G. Gottlob, A. Leitsch and A. Mundici (eds.), Computational Logic and Proof Theory. Proceedings of the 3rd K. G\n\u00f6\ndel Colloquium, LNCS 713, Springer-Verlag, 1993."},{"key":"185976_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/jsco.1995.1053","volume":"20","author":"A. Policriti","year":"1995","unstructured":"Policriti, A. and Schwartz, J. T.: T theorem proving I, J. Symbolic Comput.\n20 (1995), 315-342.","journal-title":"J. Symbolic Comput."},{"key":"185976_CR25","unstructured":"Policriti, A. and Tetali, P.: On the Satisfiability Problem for the Ground Case of First Order Theories, Technical Report 38, DIMACS center, 1992."},{"key":"185976_CR26","doi-asserted-by":"crossref","unstructured":"Schwartz, J. T., Dewar, R. K. B., Dubinsky, E. and Schonberg, E.: Programming with Sets: An Introduction to SETL, Texts and Monographs in Computer Science, Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4613-9575-1"},{"key":"185976_CR27","unstructured":"Stickel, M. E.: Theory resolution: Building in nonequational theories, in Proceedings of the AAAI-83, 1983, pp. 391-397."},{"issue":"4","key":"185976_CR28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","volume":"1","author":"M. E. Stickel","year":"1985","unstructured":"Stickel, M. E.: Automated deduction by theory resolution, J. Automated Reasoning\n1(4) (1985), 333-355.","journal-title":"J. Automated Reasoning"},{"key":"185976_CR29","unstructured":"Turchetti, D.: Sistemi di deduzione per logiche modali, Master' thesis, Universit\u00e0 di Udine, Dip. di Matematica e Informatica, 1996. ?"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006170514174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006170514174\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006170514174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:34:54Z","timestamp":1749123294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006170514174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["185976"],"URL":"https:\/\/doi.org\/10.1023\/a:1006170514174","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}