{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:35Z","timestamp":1725663995204},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560395"},{"type":"electronic","value":"9783540473602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56039-4_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:54:30Z","timestamp":1330235670000},"page":"261-275","source":"Crossref","is-referenced-by-count":1,"title":["Well founded semantics and stable semantics of semi-strict programs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7oise","family":"Gire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"unstructured":"Apt R. K., Blair H., Walker A., Towards a theory of Declarative Knowledge, Workshop on Foundations of Deductive Databases and Logic Programming (1986) 546\u2013628.","key":"17_CR1"},{"unstructured":"Bidoit N., Froidevaux C., Negation by Default and Unstratifiable Logic Programs, Technical report n\u2218 437, LRI, 1988.","key":"17_CR2"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(51)90003-5","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"Bidoit N., Negation in Rule Based Database Languages: a Survey, Theoretical Computer Science 78 (1991) 3\u201383","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(51)90008-4","volume":"78","author":"J.P. Delahaye","year":"1991","unstructured":"Delahaye J.P., Thibau V., Programming in three-valued Logic, Theoretical Computer Science 78 (1991) 189\u2013216","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"4","author":"M. Fitting","year":"1985","unstructured":"Fitting M., A Kripke-Kleene semantics for logic programs, in: J. Logic Programming 4 (1985)295\u2013312.","journal-title":"J. Logic Programming"},{"unstructured":"Gelfond M., Lifschitz V., The stable model semantics for logic programs, in: Proc. Internat. Conf. on Logic Programming (1988) 1070\u20131080.","key":"17_CR6"},{"unstructured":"Gire F., Mod\u00e8les par d\u00e9faut des programmes effectivement d\u00e9terministes, in: Proc. Vl\u00e8mes Journ\u00e9es de Bases de Donn\u00e9es avanc\u00e9es (1990) 71\u201389.","key":"17_CR7"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"Kunen K., Signed Data Dependencies in Logic Programs, in: J. Logic Programming 7 (1989) 231\u2013245.","journal-title":"J. Logic Programming"},{"key":"17_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundation of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd J.W., Foundation of Logic Programming, Springer, Berlin, 1987."},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou C.H., Yannakakis M., Tie-Breaking semantics and structural totality, personally communicated draft accepted to PODS 1992.","key":"17_CR10","DOI":"10.1145\/137097.137103"},{"doi-asserted-by":"crossref","unstructured":"Przymusinski T., On the Declarative Semantics of Deductive Databases and Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J.Minker editor, Morgan Kaufmann publishers (1988) 193\u2013216.","key":"17_CR11","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"unstructured":"Przymusinski T., Perfect Model Semantics, in: Proc. Internat. Conf. on Logic Programming (1988) 1081\u20131096","key":"17_CR12"},{"doi-asserted-by":"crossref","unstructured":"Van Gelder A., Ross K., Schlipf J.S., Unfounded Sets and Well Founded Semantics for General Logic Programs, in: Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD-SIGART (1988) 221\u2013230.","key":"17_CR13","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56039-4_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:46Z","timestamp":1605628966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56039-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560395","9783540473602"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56039-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}