{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:48Z","timestamp":1725484908497},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_8","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"116-130","source":"Crossref","is-referenced-by-count":0,"title":["Binary Speed Up for Logic Programs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Hr\u016fza","sequence":"first","affiliation":[]},{"given":"Petr","family":"\u0160t\u011b\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"8_CR1","volume-title":"From Logic Programming to Prolog","author":"R. Apt","year":"1996","unstructured":"R. Apt, From Logic Programming to Prolog, Prentice Hall International, NJ 1996"},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-1-4471-3560-9_17","volume-title":"Logic Program Synthesis and Transformation 1992","author":"B. Demoen","year":"1993","unstructured":"B. Demoen, On the Transformation of a Prolog Program to a More Efficient Binary Program, in: Logic Program Synthesis and Transformation 1992, Kung-Kiu Lau and Tim Clement (editors), Lecture Notes in Computer Science Vol. Springer-Verlag 1993 pp. 242\u2013252"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"D. De Schreye, R. Gluck, J. Jorgensen, M. Leuschel, B. Martens, M. H. Sorensen, Conjunctive partial deduction: foundations, control, algorithms and experiments, The Journal of Logic Programming 41 (1999), 231\u2013277","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Sci. 69(3):289\u2013318 (1989)","journal-title":"Theoretical Sci."},{"key":"8_CR5","unstructured":"M. Leuschel, Dozen Problems for Partial Deduction (A Set of Benchmarks) http:\/\/www.ecs.soton.ac.uk\/~mal\/systems\/dppd\/"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"M. Leuschel, M. H. Sorensen, Redundant Arguments Filtering of Logic Programs, in John Gallagher (ed.), Logic Programm Synthesis and Transformation, Proceedings of the 6th International Workshop, LOPSTR\u201996, LCNS 1207, 83\u2013103, Stockholm, 1996.","DOI":"10.1007\/3-540-62718-9_6"},{"key":"8_CR7","doi-asserted-by":"publisher","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, J. Logic Programming 11 (1991), 217\u2013242","journal-title":"J. Logic Programming"},{"key":"8_CR8","series-title":"Lecture Notes in Sci.","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-16492-8_91","volume-title":"Proc. Third Int. Conference on Logic Programming","author":"M. J. Maher","year":"1986","unstructured":"M. J. Maher, Equivalences of Logic Programs, in: Proc. Third Int. Conference on Logic Programming, London 1986, E. Shapiro (editor), Lecture Notes in Sci. Vol 225, Springer-Verlag, Berlin 1986, pp. 410\u2013424"},{"key":"8_CR9","volume-title":"PhD Thesis","author":"U. W. Neumerkel","year":"1993","unstructured":"U. W. Neumerkel, Specialization of Prolog Programs with Partially Static Goals and Binarization, PhD Thesis, Technical University, Wien, 1993"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"M. Proietti","year":"1994","unstructured":"M. Proietti, A. Pettorossi, Tranformation of logic programs: Foundations and Techniques, Journal of Logic Programming, 19, 20:261\u2013320, 1994","journal-title":"Journal of Logic Programming"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"M. Proietti, A. Pettorossi, Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs, Theoretical Computer Science 142 (1995), 98\u2013124","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","volume-title":"Tech. Rep. 457","author":"A. Pettorossi","year":"1997","unstructured":"A. Pettorossi, M. Proietti, Synthesis and Transformation of Logic Programs Using Unfold\/Fold Proofs, Tech. Rep. 457, Dipartimento di Informatica, Sistemi e Produzione, Universita di Roma, Tor Vergata, Giugno 1997"},{"key":"8_CR13","volume-title":"PhD Dissertation","author":"D. Sahlin","year":"1991","unstructured":"D. Sahlin, An Automatic Partial Evaluator for Full Prolog, PhD Dissertation, The Royal Institute of Technology, Dept. of Telecommunication and Computer Science, Stockholm, March 1991"},{"key":"8_CR14","unstructured":"T. Sato, H. Tamaki, Unfold\/Fold Transformation of Logic Programs in: Proc. of the 2nd Int. Logic Programming Conference, Uppsala 1984, S. \u00c5. T\u00e4rnlund (editor), pp. 127\u2013138"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF03037449","volume":"6","author":"T. Sato","year":"1989","unstructured":"T. Sato, H. Tamaki, Existential Continuation, New Generation Computing 6 (1989), 421\u2013438","journal-title":"New Generation Computing"},{"key":"8_CR16","first-page":"325","volume-title":"Logic Programming","author":"J. \u0160ebel\u00edk","year":"1982","unstructured":"J. \u0160ebel\u00edk and P. \u0160t\u011bp\u00e1nek, Horn Clause Programs for Recursive Functions, in: Logic Programming, K. J. Clark and S. \u00c5. T\u00e4rnlund (editors), ACADEMIC PRESS, London 1982, pp. 325\u2013240"},{"key":"8_CR17","series-title":"Lect. Notes in Sci.","first-page":"396","volume-title":"Proc. CSL\u2019 89, Third Workshop on Computer Science Logic","author":"O. \u0160t\u011bp\u00e1nkov\u00e1","year":"1989","unstructured":"O. \u0160t\u011bp\u00e1nkov\u00e1 and P. \u0160t\u011bp\u00e1nek, Stratification of Definite Clause Programs and of General Logic Programs, in: Proc. CSL\u2019 89, Third Workshop on Computer Science Logic, Kaiserslautern, Germany, 1989, Lect. Notes in Sci. Vol 440, Springer-Verlag, Berlin 1989, pp. 396\u2013408"},{"key":"8_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/3-540-55844-6_158","volume-title":"A Continuation Passing Style Prolog Engine","author":"P. Tarau","year":"1992","unstructured":"P. Tarau, A Continuation Passing Style Prolog Engine, Lecture Notes in Computer Science, Vol. 631, pp. 479\u2013480, Springer-Verlag, Berlin 1992"},{"key":"8_CR19","series-title":"Lecture Notes in Sci.","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BFb0024183","volume-title":"Proc. PLILP\u201990","author":"P. Tarau","year":"1990","unstructured":"P. Tarau and M. Boyer, Elementary Logic Programs, in: Proc. PLILP\u201990, P. Deransart and J. Maluzsy\u0144ski (editors), Lecture Notes in Sci. Vol. Springer-Verlag, Berlin 1990, pp. 159\u2013173"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S. \u00c5. T\u00e4rnlund","year":"1977","unstructured":"S. \u00c5. T\u00e4rnlund, Horn Clause Computability, BIT 17 (1977), 215\u2013226","journal-title":"BIT"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF03037456","volume":"5","author":"K. Ueda","year":"1987","unstructured":"K. Ueda, Making Exhaustive Search Programs Deterministic, New Generation Computing 5 (1987), 317\u2013326","journal-title":"New Generation Computing"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:24:30Z","timestamp":1556465070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}