{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:17:35Z","timestamp":1725794255192},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071503"},{"type":"electronic","value":"9783319071510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07151-0_17","type":"book-chapter","created":{"date-parts":[[2014,5,22]],"date-time":"2014-05-22T03:30:14Z","timestamp":1400729414000},"page":"270-284","source":"Crossref","is-referenced-by-count":2,"title":["Semantics for Prolog with Cut \u2013 Revisited"],"prefix":"10.1007","author":[{"given":"Jael","family":"Kriener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Blair, H.A., Walker, A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(90)90197-P","volume":"71","author":"M. Billaud","year":"1990","unstructured":"Billaud, M.: Simple Operational and Denotational Semantics for Prolog with Cut. Theoretical Computer Science\u00a071(2), 193\u2013208 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"2&3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming\u00a013(2&3), 103\u2013179 (1992)","journal-title":"Journal of Logic Programming"},{"key":"17_CR4","unstructured":"Dawson, S., Ramakrishnan, C.R., Ramakrishnan, I.V., Sekar, R.C.: Extracting Determinacy in Logic Programs. In: International Conference on Logic Programming, pp. 424\u2013438. MIT Press (1993)"},{"issue":"20","key":"17_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. De Schreye","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of logic programs: The never-ending story. Joural of Logic Programming\u00a019(20), 199\u2013260 (1994)","journal-title":"Joural of Logic Programming"},{"issue":"1","key":"17_CR6","first-page":"237","volume":"13","author":"E.P. Vink de","year":"1989","unstructured":"de Vink, E.P.: Comparative Semantics for Prolog with Cut. Science of Computer Programming\u00a013(1), 237\u2013264 (1989)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0743-1066(88)90007-6","volume":"5","author":"S.K. Debray","year":"1988","unstructured":"Debray, S.K., Mishra, P.: Denotational and Operational Semantics for Prolog. Journal of Logic Programming\u00a05(1), 81\u201391 (1988)","journal-title":"Journal of Logic Programming"},{"key":"17_CR8","unstructured":"Kriener, J.: Towards A Verified Determinacy Analysis for Prolog with cut. PhD thesis, School of Computing, University of Kent (December 2013)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kriener, J., King, A.: Appendix for RedAlert: Determinacy Inference for Prolog. Technical Report 1-11, School of Computing, University of Kent, CT2 7NF, UK (2011), http:\/\/arxiv.org\/corr\/home","DOI":"10.1017\/S1471068411000160"},{"issue":"4-5","key":"17_CR10","first-page":"537","volume":"11","author":"J. Kriener","year":"2011","unstructured":"Kriener, J., King, A.: RedAlert: Determinacy inference for Prolog. TPLP\u00a011(4-5), 537\u2013553 (2011)","journal-title":"TPLP"},{"key":"17_CR11","unstructured":"Le Charlier, B., Rossi, S., Van Hentenryck, P.: An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut. In: Symposium on Logic Programming, pp. 157\u2013171. MIT Press (1994)"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00354-008-0085-1","volume":"28","author":"P. L\u00f3pez-Garc\u00eda","year":"2010","unstructured":"L\u00f3pez-Garc\u00eda, P., Bueno, F., Hermenegildo, M.V.: Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses. New Generation Computing\u00a028(2), 177\u2013206 (2010)","journal-title":"New Generation Computing"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-62064-8_31","volume-title":"Perspectives of System Informatics","author":"T.\u00c6. Mogensen","year":"1996","unstructured":"Mogensen, T.\u00c6.: A Semantics-Based Determinacy Analysis for Prolog with Cut. In: Bjorner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol.\u00a01181, pp. 374\u2013385. Springer, Heidelberg (1996)"},{"key":"17_CR14","volume-title":"The Craft of Prolog","author":"R.A. O\u2019Keefe","year":"1990","unstructured":"O\u2019Keefe, R.A.: The Craft of Prolog. MIT Press, Cambridge (1990)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Elliott, C.: Higher-Order Abstract Syntax. In: Wexelblat, R.L. (ed.) PLDI, pp. 199\u2013208. ACM (1988)","DOI":"10.1145\/960116.54010"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Sahlin, D.: Determinacy Analysis for Full Prolog. In: Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 23\u201330. ACM (1991)","DOI":"10.1145\/115866.115869"},{"issue":"4-6","key":"17_CR17","first-page":"365","volume":"10","author":"P. Schneider-Kamp","year":"2010","unstructured":"Schneider-Kamp, P., Giesl, J., Str\u00f6der, T., Serebrenik, A., Thiemann, R.: Automated termination analysis for logic programs with cut. TPLP\u00a010(4-6), 365\u2013381 (2010)","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07151-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:12:06Z","timestamp":1649031126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07151-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319071503","9783319071510"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07151-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}