{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T23:10:27Z","timestamp":1717110627768},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/s0747-7171(89)80031-8","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T10:22:56Z","timestamp":1212056576000},"page":"509-522","source":"Crossref","is-referenced-by-count":4,"title":["Stratification and knowledge base management"],"prefix":"10.1016","volume":"7","author":[{"given":"Catherine","family":"Lassez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"McAloon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graeme","family":"Port","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(89)80031-8_bib1","series-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1986"},{"key":"10.1016\/S0747-7171(89)80031-8_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clauses queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0747-7171(89)80031-8_bib3","series-title":"Logic and Databases","first-page":"283","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0747-7171(89)80031-8_bib4","series-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0747-7171(89)80031-8_bib5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(89)80031-8_bib6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0747-7171(89)80031-8_bib7","series-title":"Proceedings 1985 Symposium on Logic Programming","first-page":"208","article-title":"Logic programming and graph rewriting","author":"Gallier","year":"1985"},{"key":"10.1016\/S0747-7171(89)80031-8_bib8","series-title":"Computers and intractability, a guide to the theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0747-7171(89)80031-8_bib9","series-title":"Proc., First Australian AI Conference","article-title":"A canonical representation for logic knowledge bases","author":"Helm","year":"1986"},{"key":"10.1016\/S0747-7171(89)80031-8_bib10","first-page":"105","article-title":"Complete problems for deterministic polynomial time","author":"Jones","year":"1977","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/S0747-7171(89)80031-8_bib11","author":"Kohavi","year":"1978"},{"key":"10.1016\/S0747-7171(89)80031-8_bib12","series-title":"Proceedings of the Workshop on Foundations of Deductive Database and Logic Programming","first-page":"420","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1986"},{"key":"10.1016\/S0747-7171(89)80031-8_bib13","article-title":"Integrity constaint checking in stratified databases","author":"Lloyd","year":"1986"},{"key":"10.1016\/S0747-7171(89)80031-8_bib14","first-page":"292","article-title":"On indefinite databases and the closed world assumption","volume":"138","author":"Minker","year":"1982"},{"key":"10.1016\/S0747-7171(89)80031-8_bib15","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"712","article-title":"On the semantics of stratified disjunctive databases","author":"Przymusinski","year":"1986"},{"key":"10.1016\/S0747-7171(89)80031-8_bib16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0747-7171(89)80031-8_bib17","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"712","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1986"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800318?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800318?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T07:24:29Z","timestamp":1545981869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717189800318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["S0747717189800318"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(89)80031-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}