{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:38:09Z","timestamp":1740109089447,"version":"3.37.3"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Completeness of a logic program means that the program produces all the answers required by its specification. The cut is an important construct of programming language Prolog. It prunes part of the search space, this may result in a loss of completeness. This paper proposes a way of proving completeness of programs with the cut. The semantics of the cut is formalized by describing how SLD-trees are pruned. A sufficient condition for completeness is presented, proved sound, and illustrated by examples.<\/jats:p>","DOI":"10.1007\/s00165-016-0392-0","type":"journal-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T09:36:19Z","timestamp":1473759379000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Proving completeness of logic programs with the cut"],"prefix":"10.1145","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4700-7272","authenticated-orcid":false,"given":"W\u0142odzimierz","family":"Drabent","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland"},{"name":"Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001540"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1051"},{"key":"e_1_2_1_2_3_2","unstructured":"Apt KR (1997) From logic programming to Prolog. International Series in Computer Science. Prentice Hall Europe Hemel Hempstead Hertfordshire"},{"key":"e_1_2_1_2_4_2","first-page":"96","volume-title":"TAPSOFT, Vol.2, Lecture Notes in Computer Science, vol 352.","author":"Bossi A","year":"1989"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(93)90014-8"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90197-P"},{"key":"e_1_2_1_2_7_2","unstructured":"Clark KL (1979) Predicate logic as computational formalism. Technical Report 79\/59 Imperial College London"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90107-5"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90099-0"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/167491"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840500253X"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/528626"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"Drabent W (2015) On completeness of logic programs. In: Logic based program synthesis and transformation LOPSTR 2014. Revised Selected Papers Lecture Notes in Computer Science vol 8981. Springer Berlin. Extended version in CoRR (2014). arXiv:1411.3015.","DOI":"10.1007\/978-3-319-17822-6_15"},{"issue":"3","key":"e_1_2_1_2_14_2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2898434","article-title":"Correctness and completeness of logic programs","volume":"17","author":"Drabent W","year":"2016","journal-title":"ACM Trans Comput Log"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000089"},{"issue":"1","key":"e_1_2_1_2_16_2","first-page":"237","article-title":"Comparative semantics for PROLOG with cut","volume":"13","author":"de Vink EP","year":"1989","journal-title":"Sci Comput Program"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"crossref","unstructured":"Kriener J King A (2014) Semantics for Prolog with cut-revisited. In: Codish M Sumii E (eds) Functional and Logic Programming\u201412th International Symposium FLOPS 2014 Kanazawa Japan June 4\u20136 2014. Proceedings Lecture Notes in Computer Science vol 8475. Springer Berlin pp 270\u2013284","DOI":"10.1007\/978-3-319-07151-0_17"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"crossref","unstructured":"Lloyd JW (1987) Foundations of logic programming. Second extended edition. Springer Berlin","DOI":"10.1007\/978-3-642-83189-8"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"crossref","unstructured":"Maher MJ (1988) Equivalences of logic programs. In: Minker J (ed) Foundations of deductive databases and logic programming. Morgan Kaufmann Los Altos California pp 627\u2013658","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"key":"e_1_2_1_2_20_2","unstructured":"Nilsson U Ma\u0142uszy\u0144ski J (1995) Logic programming and Prolog (2ed). Wiley Chichester West Sussex England. http:\/\/www.ida.liu.se\/~ulfni\/lpp\/."},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000165"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"publisher","DOI":"10.5555\/538679"},{"key":"e_1_2_1_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00012-6"},{"key":"e_1_2_1_2_24_2","volume-title":"The art of Prolog","author":"Sterling L","year":"1994","edition":"2"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-016-0392-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-016-0392-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-016-0392-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-016-0392-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T16:04:27Z","timestamp":1641485067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-016-0392-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1007\/s00165-016-0392-0"],"URL":"https:\/\/doi.org\/10.1007\/s00165-016-0392-0","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"type":"print","value":"0934-5043"},{"type":"electronic","value":"1433-299X"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}