{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:10Z","timestamp":1761620770708},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5472,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0004-3702(98)00054-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"273-294","source":"Crossref","is-referenced-by-count":4,"title":["Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator"],"prefix":"10.1016","volume":"103","author":[{"given":"Fangzhen","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00054-X_BIB1","series-title":"Proc. Internat. Logic Programming Symposium","first-page":"591","article-title":"A paralogical semantics for the prolog cut","author":"Andrews","year":"1995"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB2","series-title":"Computer Science Logic, CSL-89","first-page":"36","article-title":"A logical operational semantics of full Prolog","volume":"Vol. 440","author":"B\u00f6rger","year":"1989"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB3","series-title":"Proc. Fifth International Conference and Symposium on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB4","series-title":"Proc. International Joint Conference on Artificial Intelligence (IJCAI-69)","first-page":"219","article-title":"Application of theorem proving to problem solving","author":"Green","year":"1969"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB5","series-title":"Proc. 1984 International Symposium on Logic Programming","first-page":"281","article-title":"Stepwise development of operational and denotational semantics for Prolog","author":"Jones","year":"1984"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018925704786","article-title":"An ordering on subgoals for planning","volume":"21","author":"Lin","year":"1997","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1\u20133","key":"10.1016\/S0004-3702(98)00054-X_BIB7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0743-1066(96)00122-7","article-title":"Rules as actions: A situation calculus semantics for logic programs","volume":"31","author":"Lin","year":"1997","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB8","first-page":"463","article-title":"Some philosophical problems from the standpoint of artificial intelligence","volume":"4","author":"McCarthy","year":"1969"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB9","series-title":"Proc. 1995 International Conference on Logic Programming","first-page":"449","article-title":"Operational semantics of constraint logic programs with cocoutining","author":"Podelski","year":"1995"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB10","series-title":"Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy","first-page":"418","article-title":"The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression","author":"Reiter","year":"1991"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB11","series-title":"Proc. 5th Internat. Workshop on Extensions of Logic Programming","first-page":"255","article-title":"A declarative semantics for the Prolog cut operator","author":"Stroetmann","year":"1996"},{"key":"10.1016\/S0004-3702(98)00054-X_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(93)90041-E","article-title":"Tight, consistent, and computable completions for unrestricted logic programs","volume":"15","author":"Wallace","year":"1993","journal-title":"Journal of Logic Programming"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437029800054X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437029800054X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:57:56Z","timestamp":1555523876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437029800054X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S000437029800054X"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00054-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}