{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:03:23Z","timestamp":1780952603155,"version":"3.54.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,5,20]],"date-time":"2003-05-20T00:00:00Z","timestamp":1053388800000},"content-version":"vor","delay-in-days":4979,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90126-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"135-154","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":194,"title":["Paraconsistent logic programming"],"prefix":"10.1016","volume":"68","author":[{"given":"Howard A.","family":"Blair","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90126-6_BIB1","article-title":"FLOG: A logic programming system based on a six-valued logic","author":"Anand","year":"1987","journal-title":"Proc. AAAI Intl. Symp. on Knowledge Engg."},{"key":"10.1016\/0304-3975(89)90126-6_BIB2","first-page":"3","article-title":"The generalized completeness of Horn predicate logic as a programming language","volume":"4","author":"Andreka","year":"1978","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(89)90126-6_BIB3","series-title":"Foundations of Logic Programming and Deductive Databases","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0304-3975(89)90126-6_BIB4","series-title":"Mathematical Logic in Latin America","first-page":"1","article-title":"A survey of paraconsistent logic","author":"Arruda","year":"1979"},{"key":"10.1016\/0304-3975(89)90126-6_BIB5","series-title":"Proc. Intl. Symp. on Logic Prog.","first-page":"600","article-title":"Completeness of the SLDNF-resolution for a class of logic programs","volume":"225","author":"Barbuti","year":"1986"},{"key":"10.1016\/0304-3975(89)90126-6_BIB6","author":"Barbuti","year":"1986","journal-title":"Completeness of SLDNF-resolution for structured programs"},{"key":"10.1016\/0304-3975(89)90126-6_BIB7","first-page":"8","article-title":"A useful four-valued logic","author":"Belnap","year":"1977"},{"key":"10.1016\/0304-3975(89)90126-6_BIB8","article-title":"Decidability in the Herbrand Base","author":"Blair","year":"1986","journal-title":"Proc. Workshop on Foundations of Logic Programming and Deductive Databases"},{"key":"10.1016\/0304-3975(89)90126-6_BIB9","unstructured":"H.A. Blair and V.S. Subrahmanian, Foundations of generally Horn logic programming, in preparation."},{"key":"10.1016\/0304-3975(89)90126-6_BIB10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1305\/ndjfl\/1093891487","article-title":"On the theory of inconsistent formal systems","volume":"15","author":"da Costa","year":"1974","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(89)90126-6_BIB11","first-page":"621","article-title":"A semantical analysis of the calculi Cn","volume":"18","author":"da Costa","year":"1977","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(89)90126-6_BIB12","first-page":"185","article-title":"Relations between paraconsistent logic and many-valued logic","volume":"10","author":"da Costa","year":"1981","journal-title":"Bull. Section of Logic"},{"key":"10.1016\/0304-3975(89)90126-6_BIB13","unstructured":"N.C.A. da Costa and D. Marconi, An overview of paraconsistent logic in the 80's, in: Logica Novam (Akademie Verlag, Berlin) to appear."},{"key":"10.1016\/0304-3975(89)90126-6_BIB14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programming","volume":"4","author":"Fitting","year":"1985","journal-title":"J. Logic Program."},{"key":"10.1016\/0304-3975(89)90126-6_BIB15","series-title":"Proc. 3rd Intl. Conf. on Logic Programming","article-title":"Issues and trends in the semantics of logic programming","volume":"225","author":"Jaffar","year":"1986"},{"key":"10.1016\/0304-3975(89)90126-6_BIB16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","article-title":"Canonical logic programs","volume":"3","author":"Jaffar","year":"1986","journal-title":"J. Logic Program."},{"key":"10.1016\/0304-3975(89)90126-6_BIB17","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1957"},{"key":"10.1016\/0304-3975(89)90126-6_BIB18","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(89)90126-6_BIB19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(85)90128-8","article-title":"Optimal fixed points of logic programs","volume":"39","author":"Lassez","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90126-6_BIB20","series-title":"Proc. 3rd Intl. Conf. on Logic Programming","first-page":"624","article-title":"Negation and quantifiers in NU-Prolog","volume":"225","author":"Naish","year":"1986"},{"key":"10.1016\/0304-3975(89)90126-6_BIB21","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1111\/j.1467-8640.1986.tb00083.x","article-title":"On the consistency of commonsense reasoning","volume":"2","author":"Perlis","year":"1986","journal-title":"Comput. Intelligence"},{"key":"10.1016\/0304-3975(89)90126-6_BIB22","series-title":"Proc. 3rd Intl. Conf. on Logic Programming","first-page":"635","article-title":"Gracefully adding negation and disjunction in Prolog","volume":"225","author":"Poole","year":"1986"},{"key":"10.1016\/0304-3975(89)90126-6_BIB23","first-page":"173","article-title":"On the semantics of quantitative logic programs","author":"Subrahmanian","year":"1987"},{"key":"10.1016\/0304-3975(89)90126-6_BIB24","article-title":"Towards a theory of evidential reasoning in logic programming","author":"Subrahmanian","year":"1987"},{"key":"10.1016\/0304-3975(89)90126-6_BIB25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","article-title":"Quantitative deduction and its fixpoint theory","volume":"4","author":"Van Emden","year":"1986","journal-title":"J. Logic Program."},{"key":"10.1016\/0304-3975(89)90126-6_BIB26","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"},{"key":"10.1016\/0304-3975(89)90126-6_BIB27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF00453021","article-title":"Four valued semantics and the liar","volume":"13","author":"Visser","year":"1984","journal-title":"J. Philos. Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:41Z","timestamp":1757477921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901266"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90126-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Paraconsistent logic programming","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(89)90126-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}