{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:37:03Z","timestamp":1703187423990},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7139,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0743-1066(94)90040-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"27-53","source":"Crossref","is-referenced-by-count":6,"title":["On negation in Hilog"],"prefix":"10.1016","volume":"18","author":[{"given":"Kenneth A","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)90040-X_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"issue":"1","key":"10.1016\/0743-1066(94)90040-X_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn Clause Queries and Generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(94)90040-X_BIB3","series-title":"Proceedings of the North American Conference on Logic Programming","article-title":"HiLog: A First Order Semantics for Higher-Order Logic Programming Constructs","author":"Chen","year":"1989"},{"issue":"3","key":"10.1016\/0743-1066(94)90040-X_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","article-title":"HiLog: A Foundation for Higher-Order Logic Programming","volume":"15","author":"Chen","year":"1993","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0743-1066(94)90040-X_BIB5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321510.321524","article-title":"The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas","volume":"16","author":"DiPaola","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(94)90040-X_BIB6","series-title":"Proceedings of the Fifth International Conference on Logic Programming","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(94)90040-X_BIB7","first-page":"288","article-title":"Query Restricted Bottom-up Evaluation of Normal Logic Programs","author":"Kemp","year":"1992","journal-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(94)90040-X_BIB8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","article-title":"The Expressive Power of Stratified Programs","volume":"90","author":"Kolaitis","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/0743-1066(94)90040-X_BIB9","article-title":"An Alternating Fixpoint Tailored to Magic Programs","author":"Moroshita","year":"1992","journal-title":"Proceedings of the Workshop on Deductive Databases, Joint International Conference and Symposium on Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(94)90040-X_BIB10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00263192","article-title":"Logic for Improving Integrity Checking in Relational Databases","volume":"18","author":"Nicolas","year":"1982","journal-title":"Acta Informatica"},{"key":"10.1016\/0743-1066(94)90040-X_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/119995.115840","article-title":"Glue-Nail: A Deductive Database System","author":"Phipps","year":"1991","journal-title":"Proceedings of the ACM-SIGMOD International Conference on Management of Data"},{"key":"10.1016\/0743-1066(94)90040-X_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1990-13106","article-title":"Weakly Stratified Logic Programs","volume":"13","author":"Przymusinska","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/0743-1066(94)90040-X_BIB13","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(94)90040-X_BIB14","first-page":"167","article-title":"On the Declarative and Procedural Semantics of Logic Programs","volume":"5","author":"Przymusinski","year":"1989","journal-title":"J. Auto. Reasoning"},{"key":"10.1016\/0743-1066(94)90040-X_BIB15","first-page":"273","article-title":"Controlling the Search in Bottom-Up Evaluation","author":"Ramakrishnan","year":"1992","journal-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(94)90040-X_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/298514.298558","article-title":"Modular Stratification and Magic Sets for Datalog Programs with Negation","author":"Ross","year":"1990","journal-title":"Proceedings of the Ninth ACM Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(94)90040-X_BIB17","doi-asserted-by":"crossref","DOI":"10.1145\/113413.113432","article-title":"On Negation in HiLog","author":"Ross","year":"1991","journal-title":"Proceedings of the Tenth ACM Symposium on Principles of Database Systems"},{"issue":"1","key":"10.1016\/0743-1066(94)90040-X_BIB18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0743-1066(89)90032-0","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","volume":"6","author":"Van Gelder","year":"1989","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(94)90040-X_BIB19","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"Unfounded Sets and Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669490040X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669490040X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:47:14Z","timestamp":1621032434000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669490040X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["074310669490040X"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90040-x","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}