{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:58Z","timestamp":1749221338663},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632559"},{"type":"electronic","value":"9783540692492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63255-7_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:23:06Z","timestamp":1330298586000},"page":"410-419","source":"Crossref","is-referenced-by-count":2,"title":["GLUE: Opening the world to theorem provers"],"prefix":"10.1007","author":[{"given":"Gerd","family":"Neugebauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"31_CR1","unstructured":"Peter Baumgartner. Refinements of theory model elimination and a variant without contrapositives. In A.G. Cohn, editor, 11th European Conference on Artificial Intelligence, ECAI'94, pages 90\u201394. Wiley, 1994."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Peter Baumgartner and Ulrich Furbach. Model elimination without contrapositives. In Bundy [4], pages 87\u2013101.","DOI":"10.1007\/3-540-58156-1_7"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Peter Baumgartner and Ulrich Furbach. PROTEIN: A Prover with a Theory Extension INterface. In Bundy [4], pages 769\u2013773.","DOI":"10.1007\/3-540-58156-1_57"},{"key":"31_CR4","unstructured":"Alan Bundy, editor. Proceedings of the 12\nth\nConference on Automated Deduction, Nancy, France, June\/July 1994. Springer Verlag, Berlin, Heidelberg, New-York, 1994."},{"key":"31_CR5","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1973","unstructured":"Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison Wesley, Reading, MA, 1973."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"D. W. Loveland. A simplified version for the model elimination theorem proving procedure. Journal of the ACM, 16(3), 1969.","DOI":"10.1145\/321526.321527"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M. E. Stickel","year":"1988","unstructured":"Mark E. Stickel. A Prolog Technology Theorem Prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4:353\u2013380, 1988.","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Logic Programming And Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63255-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:43:27Z","timestamp":1619574207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63255-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632559","9783540692492"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-63255-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}