{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:25:43Z","timestamp":1648542343066},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1007\/bf00381143","type":"journal-article","created":{"date-parts":[[2004,11,7]],"date-time":"2004-11-07T05:08:14Z","timestamp":1099804094000},"page":"1-34","source":"Crossref","is-referenced-by-count":8,"title":["Link inheritance in abstract clause graphs"],"prefix":"10.1007","volume":"3","author":[{"given":"Hans J\ufffdrgen","family":"Ohlbach","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bruynooghe, M., The Inheritance of Links in a Connection Graph, Report CW2 (1975). Applied Mathematics and Programming Division, Katholieke Universiteit Leuven."},{"key":"CR2","unstructured":"Bl\u00e4sius, K. H., Equality Reasoning in Clause Graphs, Proc. of IJCAI-83, Karlsruhe (1983)."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Eisinger, N., Subsumption and Connection Graphs, Proc. of IJCAI-81, Vancouver (1981).","DOI":"10.1007\/978-3-662-02328-0_17"},{"key":"CR4","unstructured":"Herold, A., Some Basic Notions of First-Order Unification Theory, Interner Bericht 15\/83, Inst. f\u00fcr Informatik I, Univ. of Karlsruhe, (1983)."},{"key":"CR5","unstructured":"Karl Mark G. Raph, The Markgraf Earl Refutation Procedure, Interner Bericht, Memo-Seki-MK-84-01, FB Informatik, Univ. of Kaiserslautern (1984)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Kowalski, R., A Proof Procedure Using Connection Graphs, JACM 22, 4, (1975).","DOI":"10.1145\/321906.321919"},{"key":"CR7","unstructured":"Loveland, D., Automated Theorem Proving: A Logical Basis, North-Holland (1978)."},{"key":"CR8","unstructured":"Morris, J. B., E-Resolution: An Extension of Resolution to Include the Equality Relation. Proc. of IJCAI-69, 287?294 (dy1969)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Siekmann, J., Universal Unification, Proc. of CADE-84, Nappa USA. Springer (1984).","DOI":"10.1007\/978-0-387-34768-4_1"},{"key":"CR10","unstructured":"Schmidt-Schauss, M., A many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation, Proc. of IJCAI-85, Los Angeles (1985)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","volume":"1","author":"M. E. Stickel","year":"1985","unstructured":"StickelM. E., Automated deduction by theory resolution, Journal of Automated Reasoning 1, 333?355 (1985).","journal-title":"Journal of Automated Reasoning"},{"key":"CR12","unstructured":"Siekmann, J. and Wrightson, G., Paramodulated Connection Graphs, Acta Informatica (1978)."},{"key":"CR13","unstructured":"Szabo, P., Unifikationstheorie erster Ordnung, Thesis, Inst. f\u00fcr Informatik I, Univ. of Karlsruhe (1982)."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Walther, Ch., Elimination of Redundant Links in Extended Connection Graphs, Proc. of GWAI-81, Springer Fachberichte (1981) and Interner Bericht 10\/81, University of Karlsruhe.","DOI":"10.1007\/978-3-662-02328-0_19"},{"key":"CR15","unstructured":"Walther, Ch., A Many-Sorted Calculus Based on Resolution and Paramodulation, Interner Bericht 34\/82, Inst. f\u00fcr Informatik I, Univ. of Karlsruhe (1982). See also Proc. of IJCAI-83, Karlsruhe (1983)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00381143.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00381143\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00381143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T21:28:25Z","timestamp":1585949305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00381143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["BF00381143"],"URL":"https:\/\/doi.org\/10.1007\/bf00381143","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}