{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:45Z","timestamp":1725455925264},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013822","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"100-114","source":"Crossref","is-referenced-by-count":2,"title":["Oracle semantics for Prologa"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Barbuti","sequence":"first","affiliation":[]},{"given":"Michael","family":"Codish","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Maher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"353","volume-title":"Proc. Sixth Int'l Conf. on Logic Programming","author":"K. R. Apt","year":"1989","unstructured":"K. R. Apt, R. N. Bol, and J.W. Klop. On the safe termination of PROLOG programs. In G. Levi and M. Martelli, editors, Proc. Sixth Int'l Conf. on Logic Programming, pages 353\u2013368. The MIT Press, Cambridge, Mass., 1989."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-76274-1_9","volume-title":"Computational Logic","author":"K. R. Apt","year":"1990","unstructured":"K. R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Computational Logic, pages 150\u2013176. Springer-Verlag, Berlin, 1990."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"K. R. Apt and D. Pedreschi. Proving Termination of General Prolog Programs. In T. Ito and A.R. Meyer, editors, Proc. of Int. Conf. on Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 265\u2013289, Sendai, Japan, 1991.","DOI":"10.1007\/3-540-54415-1_50"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0743-1066(87)90008-2","volume":"4","author":"B. Arbab","year":"1987","unstructured":"B. Arbab and D.M. Berry. Operational and Denotational Semantics of Prolog. Journal of Logic Programming, 4:309\u2013330, 1987.","journal-title":"Journal of Logic Programming"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"R. Barbuti, M. Codish, R. Giacobazzi, and G. Levi. Modelling Prolog Control. In Proc. Nineteenth Annual ACM Symp. on Principles of Programming Languages, pages 95\u2013104. ACM Press, 1992.","DOI":"10.1145\/143165.143186"},{"key":"8_CR6","volume-title":"volume 440 of Lecture Notes in Computer Science","author":"E. B\u00f6rger","year":"1990","unstructured":"E. B\u00f6rger. A logical operational semantics of full prolog. In E.B\u00f6rger, H. Kleine, H. B\u00fcning, and M. Richter, editors, CSL 89. 3rd workshop on Computer Science Logic, volume 440 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1990."},{"key":"8_CR7","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. Contributions to the Semantics of Open Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, 1992. To appear."},{"key":"8_CR8","first-page":"178","volume-title":"Proc. CAAP 89, volume 351 of Lecture Notes in Computer Science","author":"A. Bruin de","year":"1989","unstructured":"A. de Bruin and E. de Vink. Continuation semantics for Prolog with cut. In J. Diaz and F. Orejas, editors, Proc. CAAP 89, volume 351 of Lecture Notes in Computer Science, pages 178\u2013192. Springer-Verlag, Berlin, 1989."},{"key":"8_CR9","first-page":"245","volume-title":"Formal Description of Programming Concepts III","author":"S. K. Debray","year":"1987","unstructured":"S. K. Debray and P. Mishra. Denotational and Operational Semantics for Prolog. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 245\u2013269. North-Holland, Amsterdam, 1987."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(90)90061-L","volume":"75","author":"M. Falaschi","year":"1990","unstructured":"M. Falaschi and G. Levi. Finite failures and partial computations in concurrent logic languages. Theoretical Computer Science, 75:45\u201366, 1990.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR11","doi-asserted-by":"crossref","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, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","volume-title":"Lecture Notes in Computer Science","author":"M. Gabbrielli","year":"1992","unstructured":"M. Gabbrielli and M. C. Meo. Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns. In H. Kirchner and G. Levi, editors, Proceedings of Third International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992. In this Proceedings."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"H. Gaifman and E. Shapiro. Fully abstract compositional semantics for logic programs. In Proc. Sixteenth Annual ACM Symp. on Principles of Programming Languages, pages 134\u2013142. ACM, 1989.","DOI":"10.1145\/75277.75289"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111\u2013119. ACM, 1987.","DOI":"10.1145\/41625.41635"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 1991. To appear.","DOI":"10.1145\/129393.129398"},{"key":"8_CR16","unstructured":"N. D. Jones and A. Mycroft. Stepwise Development of Operational and Denotational Semantics for Prolog. In Sten-\u00c5ke T\u00e4rnlund, editor, Proc. Second Int'l Conf. on Logic Programming, pages 281\u2013288, 1984."},{"key":"8_CR17","first-page":"1649","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","author":"G. Levi","year":"1988","unstructured":"G. Levi. Models, Unfolding Rules and Fixpoint Semantics. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 1649\u20131665, The MIT Press, Cambridge, Mass., 1988."},{"key":"8_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.","edition":"Second edition"},{"key":"8_CR19","unstructured":"N.D.Jones and H.S\u00f8ndergaard. A Semantics-based Framework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 123\u2013142. Ellis Horwood Ltd, 1987."},{"issue":"4","key":"8_CR20","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1976","unstructured":"M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"},{"key":"8_CR21","unstructured":"T. Vasak and J. Potter. Characterization of Terminating Logic Programs. In Proc. Third IEEE Int'l Symp. on Logic Programming, pages 140\u2013147. IEEE Comp. Soc. Press, 1986."},{"key":"8_CR22","first-page":"301","volume-title":"Proc. Eighth Int'l Conf. on Logic Programming","author":"K. Vershaetse","year":"1991","unstructured":"K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301\u2013315. The MIT Press, Cambridge, Mass., 1991."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:30Z","timestamp":1586579610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0013822","relation":{},"subject":[]}}