{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:14:51Z","timestamp":1648700091513},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90229-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"373-388","source":"Crossref","is-referenced-by-count":0,"title":["Is there an axiomatic semantics for standard pure prolog?"],"prefix":"10.1016","volume":"82","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Paul","family":"Delahaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(91)90229-U_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contribution to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90229-U_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0743-1066(87)90008-2","article-title":"Operational and denotational semantics of Prolog","volume":"4","author":"Arbab","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(91)90229-U_BIB3","series-title":"Th\u00e8se d'Etat","article-title":"Negation in rule-based database language: a survey","author":"Bidoit","year":"1989"},{"key":"10.1016\/0304-3975(91)90229-U_BIB4","article-title":"Simple operational and denotational semantics for Prolog with cut","volume":"88","author":"Billaud","year":"1988","journal-title":"Informatica"},{"key":"10.1016\/0304-3975(91)90229-U_BIB5","series-title":"A semantical approach of an internal rendering of the negation in general logic programs","author":"Bleuzen-Guernalec","year":"1990"},{"key":"10.1016\/0304-3975(91)90229-U_BIB6","series-title":"MFCS 90","article-title":"A logical operational semantics of full Prolog","volume":"452","author":"B\u00f6rger","year":"1990"},{"key":"10.1016\/0304-3975(91)90229-U_BIB7","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0304-3975(91)90229-U_BIB8","series-title":"Formal Description for Programming Concept III","article-title":"Denotational and operational semantics for Prolog","author":"Debray","year":"1987"},{"issue":"1","key":"10.1016\/0304-3975(91)90229-U_BIB9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1988220100031","article-title":"S\u00e9mantique Logique et D\u00e9notationnelle des Interpr\u00e9teurs Prolog","volume":"22","author":"Delahaye","year":"1988","journal-title":"Inform. Th\u00e9or. Applic."},{"key":"10.1016\/0304-3975(91)90229-U_BIB10","article-title":"Operational semantics of standard Prolog: an axiomatic approach","author":"Delahaye","year":"1990","journal-title":"Actes du S\u00e9minaire de Programmation Logique de Tr\u00e9gastel"},{"key":"10.1016\/0304-3975(91)90229-U_BIB11","series-title":"Rapport de recherche","article-title":"Approximations de la s\u00e9mantique op\u00e9rationnelle d'un interpr\u00e9teur Prolog Standard par des s\u00e9mantiques axiomatiques","author":"Denis","year":"1989"},{"key":"10.1016\/0304-3975(91)90229-U_BIB12","series-title":"Rapport de recherche","article-title":"Is there an axiomatic semantics for Standard pure Prolog?","author":"Denis","year":"1990"},{"key":"10.1016\/0304-3975(91)90229-U_BIB13","series-title":"Rapport de Recherche","article-title":"Unfolding and fixpoint semantics","author":"Denis","year":"1990"},{"key":"10.1016\/0304-3975(91)90229-U_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behaviour of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90229-U_BIB15","series-title":"TR-32\/89","article-title":"A model-theoretic reconstruction of the operational semantics of logic programs","author":"Falaschi","year":"1989"},{"key":"10.1016\/0304-3975(91)90229-U_BIB16","article-title":"Toward useful type-free theories","author":"Feferman","year":"1982","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90229-U_BIB17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0743-1066(85)90014-7","article-title":"A deterministic Prolog fixpoint semantics","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(91)90229-U_BIB18","series-title":"Proc. 8th Symp. on Mathematics and Computer Science","article-title":"Complete extension of general logic programs","author":"Gil","year":"1990"},{"key":"10.1016\/0304-3975(91)90229-U_BIB19","series-title":"Axiomatic Set Theory, Proc Symp. Pure Maths., Part II","first-page":"147","article-title":"The consistency of partial set theory without extensionality","author":"Gilmore","year":"1974"},{"key":"10.1016\/0304-3975(91)90229-U_BIB20","series-title":"Lush-resolution and its completeness","author":"Hill","year":"1974"},{"key":"10.1016\/0304-3975(91)90229-U_BIB21","first-page":"500","article-title":"Completeness of the negation as failure rule","author":"Jaffar","year":"1983","journal-title":"IJCAI-83"},{"key":"10.1016\/0304-3975(91)90229-U_BIB22","article-title":"Stepwise development of operational and denotational semantics for Prolog","author":"Jones","year":"1984","journal-title":"Internat. Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(91)90229-U_BIB23","series-title":"Information Processing 74","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"key":"10.1016\/0304-3975(91)90229-U_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(91)90229-U_BIB25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependencies in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(91)90229-U_BIB26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures and fairness in semantics of programming logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90229-U_BIB27","series-title":"TR-13\/88","article-title":"The unfolding semantics of logic programs","author":"Levi","year":"1988"},{"key":"10.1016\/0304-3975(91)90229-U_BIB28","series-title":"Foundation of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(91)90229-U_BIB29","series-title":"ICLP 1989","first-page":"600","article-title":"The relationship between logic program semantics and non monotonic reasoning","author":"Marek","year":"1989"},{"key":"10.1016\/0304-3975(91)90229-U_BIB30","series-title":"Proc. 1st STACS Conf.","first-page":"274","article-title":"Logic programs and many-valued logic","volume":"166","author":"Mycroft","year":"1984"},{"key":"10.1016\/0304-3975(91)90229-U_BIB31","series-title":"ICLP 1989","first-page":"655","article-title":"Non-monotonic formalisms and logic programming","author":"Przymunsinski","year":"1989"},{"key":"10.1016\/0304-3975(91)90229-U_BIB32","article-title":"Contribution \u00e0 la r\u00e9alisation d'une sp\u00e9cification formelle pour Prolog","author":"Richard","year":"1989","journal-title":"Th\u00e8se \u00e0l'Universit\u00e9 d`Orl\u00e9ans"},{"key":"10.1016\/0304-3975(91)90229-U_BIB33","doi-asserted-by":"crossref","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90229-U_BIB34","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in logic programming","author":"Shepherdson","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(91)90229-U_BIB35","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Van Emden","year":"1976","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190229U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190229U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:45Z","timestamp":1555127625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190229U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190229U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90229-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}