{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:09:05Z","timestamp":1648926545266},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5984,"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":[[1997,3]]},"DOI":"10.1016\/s0743-1066(96)00126-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:44:48Z","timestamp":1027644288000},"page":"179-204","source":"Crossref","is-referenced-by-count":0,"title":["Incremental algorithms for optimizing model computation based on partial instantiation"],"prefix":"10.1016","volume":"30","author":[{"given":"Raymond T.","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomei","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(96)00126-4_bib1","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"1","article-title":"Magic Sets and Other Strange Ways to Implement Logic Programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/S0743-1066(96)00126-4_bib2","series-title":"Proc. ACM-SIGMOD","first-page":"16","article-title":"An Amateur's Introduction to Recursive Query Processing Strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/S0743-1066(96)00126-4_bib3","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"283","article-title":"Implementing Deductive Databases by Linear Programming","author":"Bell","year":"1992"},{"key":"10.1016\/S0743-1066(96)00126-4_bib4","doi-asserted-by":"crossref","unstructured":"Bell, C., Nerode, A., Ng, R., and Subrahmanian, V. S., Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases,J. ACM, to appear.","DOI":"10.1145\/195613.195637"},{"key":"10.1016\/S0743-1066(96)00126-4_bib5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/68012.68015","article-title":"Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates","volume":"14","author":"Blakeley","year":"1989","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0743-1066(96)00126-4_bib6","series-title":"Proc. ACM-SIGMOD","first-page":"61","article-title":"Efficiently Updating Materialized Views","author":"Blakeley","year":"1986"},{"key":"10.1016\/S0743-1066(96)00126-4_bib7","first-page":"101","article-title":"The Sharing of Structure in Theorem-Proving Programs","volume":"7","author":"Boyer","year":"1972","journal-title":"Machine Intelligence"},{"key":"10.1016\/S0743-1066(96)00126-4_bib8","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(89)90021-7","article-title":"Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility","volume":"80","author":"Buning","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0743-1066(96)00126-4_bib9","series-title":"Proc. VLDB","first-page":"577","article-title":"Deriving Production Rules for Incremental View Maintenance","author":"Ceri","year":"1991"},{"key":"10.1016\/S0743-1066(96)00126-4_bib10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","article-title":"Extended Horn Sets in Propositional Logic","volume":"38","author":"Chandru","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0743-1066(96)00126-4_bib11","series-title":"Proc. ICDT","article-title":"Incremental Evaluation of Datalog Queries","author":"Dong","year":"1992"},{"key":"10.1016\/S0743-1066(96)00126-4_bib12","series-title":"Proc. 5th International Conference and Symposium on Logic Programming","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0743-1066(96)00126-4_bib13","series-title":"Proc. ACM-SIGMOD","first-page":"157","article-title":"Maintaining Views Incrementally","author":"Gupta","year":"1993"},{"key":"10.1016\/S0743-1066(96)00126-4_bib14","series-title":"Workshop of JICSLP","article-title":"Maintenance of Materialized Views in a Deductive Database: An Update Propagation Approach","author":"Harrison","year":"1992"},{"key":"10.1016\/S0743-1066(96)00126-4_bib15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-9236(88)90128-5","article-title":"Computation-Oriented Reductions of Predicate to Propositional Logic","volume":"4","author":"Jeroslow","year":"1988","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0743-1066(96)00126-4_bib16","doi-asserted-by":"crossref","unstructured":"Kagan, V., Nerode, A., and Subrahmanian, V. S., Computing Definite Logic Programs by Partial Instantiation,Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(94)90010-8"},{"key":"10.1016\/S0743-1066(96)00126-4_bib17","unstructured":"Kagan, V., Nerode, A., and Subrahmanian, V. S., Computing Minimal Models by Partial Instantiation, unpublished manuscript."},{"key":"10.1016\/S0743-1066(96)00126-4_bib18","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"key":"10.1016\/S0743-1066(96)00126-4_bib19","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/S0743-1066(96)00126-4_bib20","unstructured":"Nerode, A., Ng, R., and Subrahmanian, V. S., Computing Circumscription by Linear Programming,Inform. Comput, to appear."},{"key":"10.1016\/S0743-1066(96)00126-4_bib21","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1145\/971697.602293","article-title":"Maintenance of Views","volume":"14","author":"Shumeli","year":"1984","journal-title":"Sigmod Record"},{"key":"10.1016\/S0743-1066(96)00126-4_bib22","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"221","article-title":"Unfounded Sets and Well-Founded Semantics for General Logic Programs","author":"van Gelder","year":"1988"},{"key":"10.1016\/S0743-1066(96)00126-4_bib23","series-title":"Proc. ACM-SIGMOD","first-page":"78","article-title":"Incremental Evaluation of Rules and Its Relationship to Parallelism","author":"Wolfson","year":"1991"},{"key":"10.1016\/S0743-1066(96)00126-4_bib24","series-title":"Proc. of the International Conference on Logic Programming","first-page":"1666","article-title":"Design and Implementation of a Logic-Based Language for Data-Intensive Applications","author":"Zaniolo","year":"1988"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001264?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:22:14Z","timestamp":1555424534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696001264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0743106696001264"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00126-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}