{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:04Z","timestamp":1725455644357},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022576","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"277-288","source":"Crossref","is-referenced-by-count":2,"title":["Completeness of the pool calculus with an open built-in theory"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Petermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/322248.322249","volume":"28","author":"P. Andrews","year":"1981","unstructured":"P. Andrews. Theorem Proving via General Matings. J. ACM, 28(2):193\u2013214, 1981.","journal-title":"J. ACM"},{"key":"30_CR2","unstructured":"P. Baumgartner. Theory Model Elimination. In H. J. Ohlbach, editor, Proc. GWAI 92, 1992. MP-I-Inf."},{"key":"30_CR3","unstructured":"P. Baumgartner, U. Furbach, and U. Petermann. A Unified Approach to Theory Reasoning. Forschungsbericht 15\/92, University of Koblenz, 1992."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"W. Bibel. Automated Theorem Proving. Vieweg, 1st edition, 1982.","DOI":"10.1007\/978-3-322-90100-2"},{"issue":"10","key":"30_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/MC.1983.1654200","volume":"16","author":"R. Brachmann","year":"1983","unstructured":"R. Brachmann, R. Fikes, and H. Levesque. KRYPTON: a functional approach to knowledge representation. IEEE Computer, 16(10):67\u201373, October 1983.","journal-title":"IEEE Computer"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"H. B\u00fcrckert. A Resolution Principle for Clauses with Constraints. In M. E. Stickel, editor, Proc CADE 10, pages 178\u2013192. Springer, 1990. LNCS\/LNAI 449.","DOI":"10.1007\/3-540-52885-7_87"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"F. Debart, P. Enjalbert, and M. Lescot. Multi modal logic programming using equational and order-sorted logic. In M. Okada and S. Kaplan, editors, Proc. 2nd Conf. on Conditional and Typed Rewriting Systems. Springer, 1990. LNCS.","DOI":"10.1007\/3-540-53162-9_30"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"A. M. Frisch. The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. Artificial Intelligence, 1991.","DOI":"10.1016\/0004-3702(91)90009-9"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"J. Gallier, P. Narendran, D. Plaisted, and W. Snyder. Theorem Proving with Equational Matings and Rigid E-unification. J. of ACM, 1992.","DOI":"10.1145\/128749.128754"},{"key":"30_CR10","unstructured":"D. Loveland. Automated Theorem Proving \u2014 A Logical Basis. North Holland, 1978."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0747-7171(87)80064-0","volume":"4","author":"N. Murray","year":"1987","unstructured":"N. Murray and E. Rosenthal. Theory Links: Applications to Automated Theorem Proving. J. of Symbolic Computation, (4):173\u2013190, 1987.","journal-title":"J. of Symbolic Computation"},{"key":"30_CR12","volume-title":"Technical report","author":"G. Neugebauer","year":"1992","unstructured":"G. Neugebauer. Compiling first order logic: A prolog implementation. Technical report, FG Intellektik, Technisch Hochschule Darmstadt., 1992."},{"key":"30_CR13","volume-title":"Technical Report AIDA-91-02","author":"G. Neugebauer","year":"1991","unstructured":"G. Neugebauer and T. Schaub. A pool-based connection calculus. Technical Report AIDA-91-02, FG Intellektik, Technische Hochschule Darmstadt., 1991."},{"key":"30_CR14","unstructured":"H. Ohlbach and J. Siekmann. The Markgraf Karl Refutation Procedure. In J. Lassez and G. Plotkin, editors, Computational Logic \u2014 Essays in Honor of Alan Robinson, pages 41\u2013112. MIT Press, 1991."},{"issue":"2","key":"30_CR15","first-page":"105","volume":"11","author":"U. Petermann","year":"1992","unstructured":"U. Petermann. How to build in an open theory into connection calculi. J. on Computer and Artificial Intelligence, 11(2):105\u2013142, 1992.","journal-title":"J. on Computer and Artificial Intelligence"},{"key":"30_CR16","unstructured":"U. Petermann. Pool calculus with built in constraint theories. Technical report, Inst.-f. Informatik, Univ. Leipzig, 1993."},{"key":"30_CR17","unstructured":"H. Rasiowa and R. Sikorski. The Mathematics of Metamathematics. Polish Scientific Publishers, 1970."},{"issue":"1","key":"30_CR18","first-page":"333","volume":"4","author":"M. Stickel","year":"1985","unstructured":"M. Stickel. Automated deduction by theory resolution. J. of Automated Reasoning, 4(1):333\u2013356, 1985.","journal-title":"J. of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022576.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:08Z","timestamp":1607550548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0022576","relation":{},"subject":[]}}