{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:11:20Z","timestamp":1710249080818},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/s0304-3975(96)00125-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"61-75","source":"Crossref","is-referenced-by-count":10,"title":["Combining explicit negation and negation by failure via Belnap's logic"],"prefix":"10.1016","volume":"171","author":[{"given":"Paul","family":"Ruet","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00125-9_BIB1","series-title":"Proc. ILPS'92 Joint Internat. Conf. and Symp. on Logic Programming","article-title":"On logic program semantics with two kinds of negation","author":"Alferes","year":"1992"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB2","first-page":"506","volume":"Vol. 2","author":"Anderson","year":"1992"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB3","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB4","series-title":"Modern Uses of Multiple-Valued Logic","article-title":"A useful four-valued logic","author":"Belnap","year":"1977"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB5","series-title":"Logic and Databases","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB6_1","article-title":"Consistency of clark's completion and existence of stable models","author":"Fages","year":"1990"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB6_2","volume":"1","author":"Fages","year":"1994","journal-title":"Methods of Logic in Computer Science"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB7","doi-asserted-by":"crossref","unstructured":"F. Fages, Constructive Negation by pruning, J. Logic Programming, to appear.","DOI":"10.1016\/S0743-1066(96)00092-1"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF00274066","article-title":"Bilattices and the theory of truth","volume":"18","author":"Fitting","year":"1989","journal-title":"J. Philos. Logic"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(91)90014-G","article-title":"Bilattices and the semantics of logic programming","volume":"11","author":"Fitting","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(93)90031-B","article-title":"The family of stable models","volume":"17","author":"Fitting","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB12","series-title":"Proc. ICLP'88, 5th Internat. Conf. on Logic Programming","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB13","series-title":"Proc. ICLP'90, 7th Internat. Conf. on Logic Programming","article-title":"Logic programs with classical negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037169","article-title":"classical negation in Logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB15","series-title":"Proc. ILPS'92 Joint Internat. Conf. and Symp. on Logic Programming","article-title":"Representing actions in extended logic programs","author":"Gelfond","year":"1992"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB16","article-title":"Multivalued logics: a uniform approach to reasoning in artificial intelligence","volume":"4","author":"Ginsberg","year":"1988","journal-title":"Computat. Intelligence"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB17","doi-asserted-by":"crossref","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\/S0304-3975(96)00125-9_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependences in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB19","series-title":"Proc. LICS'91 Internat. Conf. on Logic in Computer Science","article-title":"Constructive negation for constraint logic programming","author":"Stuckey","year":"1991"},{"key":"10.1016\/S0304-3975(96)00125-9_BIB20","doi-asserted-by":"crossref","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(96)00125-9_BIB21","series-title":"MFDBS'91","article-title":"A database needs two kinds of negation","author":"Wagner","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:56:36Z","timestamp":1555404996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0304397596001259"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00125-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}