{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:49Z","timestamp":1725456229571},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012858","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:12:39Z","timestamp":1132708359000},"page":"573-581","source":"Crossref","is-referenced-by-count":2,"title":["A subsumption algorithm based on characteristic matrices"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Socher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C.L. Chang","year":"1973","unstructured":"Chang, C.L.; Lee, R.C.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Eisinger, N.: Subsumption and Connection Graphs. Proc. of the 7th IJCAI, Vancouver, 480\u2013486 (1981).","DOI":"10.1007\/978-3-662-02328-0_17"},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/3149.214118","volume":"32","author":"G. Gottlob","year":"1985","unstructured":"Gottlob, G.; Leitsch, A.: On the Efficiency of Subsumption Algorithms. Journal of the ACM, 32\/2, 280\u2013295 (1985).","journal-title":"Journal of the ACM"},{"key":"39_CR4","unstructured":"Karl, Mark G. Raph: The Markgraph Karl Refutation Procedure. Interner Bericht, SEKI-Memo MK-84-01, Universit\u00e4t Kaiserslautern (1984)."},{"key":"39_CR5","unstructured":"Loveland, D.W.: Automated Theorem Proving: A Logical Basis. Fundamental Studies in Computer Science, North Holland (1978)."},{"issue":"4","key":"39_CR6","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1145\/321784.321792","volume":"20","author":"R.B. Stillman","year":"1973","unstructured":"Stillman, R.B.: The Concept of Weak Substitution in Theorem Proving. Journal of the ACM, 20\/4, 648\u2013667 (1973).","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012858.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T10:06:42Z","timestamp":1607335602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0012858","relation":{},"subject":[]}}