{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:01Z","timestamp":1725663841800},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581567"},{"type":"electronic","value":"9783540484677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58156-1_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:21:24Z","timestamp":1330269684000},"page":"207-221","source":"Crossref","is-referenced-by-count":10,"title":["The applicability of logic program analysis and transformation to theorem proving"],"prefix":"10.1007","author":[{"given":"D. A.","family":"Waal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-1-4471-3234-9_11","volume-title":"Logic Program Synthesis and Transformation","author":"D. A. Waal de","year":"1994","unstructured":"D.A. de Waal. The power of partial evaluation. In Y. Deville, editor, Logic Program Synthesis and Transformation, Louvain-la-Neuve 1993, Workshops in Computing, pages 113\u2013123. Springer-Verlag, 1994."},{"key":"15_CR2","unstructured":"D.A. de Waal and J. Gallagher. Logic program specialisation with deletion of useless clauses. In D. Miller, editor, Proceedings of the 1993 International Symposium, Vancouver, 1993."},{"key":"15_CR3","unstructured":"D.A. de Waal and J.P. Gallagher. The applicability of logic program analysis and transformation to theorem proving. Technical Report CSTR-93-15, University of Bristol, September 1993."},{"key":"15_CR4","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In 6th IEEE Symposium on Logic in Computer Science, Amsterdam, 1991."},{"issue":"5","key":"15_CR5","first-page":"45","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Y. Futamura. Partial evaluation of computation process \u2014 an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45\u201350, 1971.","journal-title":"Systems, Computers, Controls"},{"key":"15_CR6","volume-title":"Tutorial on specialisation of logic programs","author":"J. Gallagher","year":"1993","unstructured":"J. Gallagher. Tutorial on specialisation of logic programs. In The ACM-SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation (PEPM'93), Copenhagen, June 1993. ACM Press."},{"key":"15_CR7","unstructured":"J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991."},{"key":"15_CR8","unstructured":"J. Gallagher and D.A. de Waal. Regular approximations of logic programs and their uses. Technical Report CSTR-92-06, University of Bristol, March 1992."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"J. Gallagher and D.A. de Waal. Deletion of redundant unary type predicates from logic programs. In K.K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation, Workshops in Computing, pages 151\u2013167. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3560-9_11"},{"key":"15_CR10","unstructured":"J. Gallagher and D.A. de Waal. Fast and precise regular approximation of logic programs. Technical Report TR-93-19, Dept. of Computer Science, University of Bristol, 1993. (accepted for presentation at the Eleventh International Conference on Logic Programming)."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"C.A. Gurr. Specialising the ground representation in the logic programming language G\u00f6del. To be published in the Proceedings of the Third International Workshop on Logic Program Synthesis and Transformation, Louvain-la-Neuve, 1993.","DOI":"10.1007\/978-1-4471-3234-9_12"},{"issue":"1","key":"15_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143\u2013184, 1993.","journal-title":"Journal of the ACM"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. Technical report, Brown University, Department of Computer Science, December 1993.","DOI":"10.1145\/178243.178479"},{"key":"15_CR14","volume-title":"Forming concepts for fast inference","author":"H. Kautz","year":"1992","unstructured":"H. Kautz and B. Selman. Forming concepts for fast inference. In Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, California. AAAI\/MIT Press, 1992."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming: 2nd Edition. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"3","key":"15_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11(3 & 4):217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"15_CR17","unstructured":"D.W. Loveland. Automated theorem proving: a logical basis. North-Holland, 1978."},{"issue":"1","key":"15_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00249353","volume":"7","author":"D. W. Loveland","year":"1991","unstructured":"D.W. Loveland. Near-Horn Prolog and beyond. Journal of Automated Reasoning, 7(1):1\u201326, 1991.","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR19","unstructured":"K. Marriott, L. Naish, and J-L. Lassez. Most specific logic programs. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, Washington, August 1988."},{"key":"15_CR20","first-page":"141","volume":"7","author":"D. Michie","year":"1972","unstructured":"D. Michie, R. Ross, and G.J. Shannan. G-deduction. Machine Intelligence, 7:141\u2013165, 1972.","journal-title":"Machine Intelligence"},{"key":"15_CR21","unstructured":"C.K. Gomard N.D. Jones and P. Sestoft. Partial Evaluation and Automatic Program generation. Prentice Hall, 1993."},{"key":"15_CR22","unstructured":"G. Neugebauer. Reachability analysis. To be published in the Proceedings of the Third International Workshop on Logic Program Synthesis and Transformation, Louvain-la-Neuve, 1993."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"D.L. Poole and R. Goebel. Gracefully adding negation and disjunction to Prolog. In E. Shapiro, editor, Third International Conference on Logic Programming, pages 635\u2013641. Lecture Notes in Computer Science, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16492-8_112"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"H. Seki. On the power of Alexander templates. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, 1989.","DOI":"10.1145\/73721.73737"},{"key":"15_CR25","unstructured":"B. Selman and H. Kautz. Knowledge compilation using Horn approximation. In Proceedings of the Ninth National Conference on Artificial Intelligence. AAAI\/MIT Press, 1991."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"M.E. Stickel. A Prolog Technology Theorem Prover. In International Symposium on Logic Programming, Atlantic City, NJ, pages 211\u2013217, Feb. 6\u20139 1984.","DOI":"10.1007\/BF03037328"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"G. Sutcliffe. Linear-input subset analysis. In D. Kapur, editor, 11th International Conference on Automated Deduction, pages 268\u2013280. Lecture Notes in Computer Science, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55602-8_171"},{"key":"15_CR28","volume-title":"Technical Report TPTP v1.0.0 \u2014 TR 12.11.93","author":"C. Sutter","year":"1993","unstructured":"C. Sutter, G. Sutcliffe, and T. Yemenis. The TPTP problem library. Technical Report TPTP v1.0.0 \u2014 TR 12.11.93, James Cook University, Australia, November 1993."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"T. Wakayama. Case-free programs: An abstraction of definite Horn programs. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 87\u2013101. Lecture Notes in Computer Science, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52885-7_81"},{"issue":"2","key":"15_CR30","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1990","unstructured":"E. Yardeni and E.Y. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125\u2013154, 1990.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-12"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58156-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:33Z","timestamp":1605647853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58156-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581567","9783540484677"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-58156-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}