{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:52Z","timestamp":1757627692023,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,12]],"date-time":"1999-02-12T00:00:00Z","timestamp":918777600000},"content-version":"vor","delay-in-days":1107,"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":[[1996,2]]},"DOI":"10.1016\/0304-3975(94)00216-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:06:05Z","timestamp":1027631165000},"page":"157-177","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Computing minimal models by partial instantiation"],"prefix":"10.1016","volume":"155","author":[{"given":"Vadim","family":"Kagan","sequence":"first","affiliation":[]},{"given":"Anil","family":"Nerode","sequence":"additional","affiliation":[]},{"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00216-9_bib1","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1145\/195613.195637","article-title":"Mixed integer programming methods for computing nonmonotonic deductive databases","volume":"41","author":"Bell","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)00216-9_bib2_1","series-title":"Proc. ACM-PODS","first-page":"283","article-title":"Implementing deductive databases by linear programming","author":"Bell","year":"1992"},{"key":"10.1016\/0304-3975(94)00216-9_bib2_2","unstructured":"full version accepted for publication in: ACM Trans. on Database Systems."},{"key":"10.1016\/0304-3975(94)00216-9_bib3","series-title":"Proc. 1993 Internat. Workshop on Logic Programming and Nonmonotonic Reasoning","article-title":"Implementing stable semantics by linear programming","author":"Bell","year":"1993"},{"key":"10.1016\/0304-3975(94)00216-9_bib4","series-title":"Proc. AAAI-93","first-page":"2","article-title":"On computing minimal models","author":"Ben-Eliyahu","year":"1993"},{"issue":"1","key":"10.1016\/0304-3975(94)00216-9_bib5","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. Assoc. Comput. Mach."},{"year":"1973","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","key":"10.1016\/0304-3975(94)00216-9_bib6"},{"key":"10.1016\/0304-3975(94)00216-9_bib7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(90)90012-M","article-title":"Generalized closed world assumption is II20-complete","volume":"34","author":"Chomicki","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00216-9_bib8","unstructured":"M. Falaschi; G. Levi; M. Martelli; C. Palamidessi, A new declarative semantics for logic languages, in: K. Bowen, and R. Kowalski, eds., Proc. 1988 Joint Internat. Conf on Logic programming, 993\u20131005."},{"key":"10.1016\/0304-3975(94)00216-9_bib9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01530802","article-title":"Disjunctive LP + integrity constraints = stable model semantics","volume":"8","author":"Fernandez","year":"1993","journal-title":"Ann. of Math. Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00216-9_bib10","unstructured":"J. Fernandez and J. Minker, Bottom-up evaluation of hierarchical disjunctive databases, in: K. Furukawa, ed., Proc. Eight Internat. Conf on Logic Prog, pp. 660\u2013675."},{"key":"10.1016\/0304-3975(94)00216-9_bib11","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski and K.A. Bowen, eds., Proc. 5th International Conference and Symposium on Logic Programming, 1070\u20131080."},{"key":"10.1016\/0304-3975(94)00216-9_bib12","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\/0304-3975(94)00216-9_bib13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann of Math. Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)00216-9_bib14","unstructured":"P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, in: Proc. 9th ACM Symp. on Principles of Database Systems, 299\u2013313."},{"key":"10.1016\/0304-3975(94)00216-9_bib15","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Unification Revisited","author":"Lassez","year":"1989"},{"year":"1987","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/0304-3975(94)00216-9_bib16"},{"year":"1992","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","key":"10.1016\/0304-3975(94)00216-9_bib17"},{"key":"10.1016\/0304-3975(94)00216-9_bib18","series-title":"Proc. IRIA Symp. on Automatic Demonstration, Lecture Notes in Mathematics","first-page":"147","article-title":"A linear format for resolution","author":"Loveland","year":"1970"},{"key":"10.1016\/0304-3975(94)00216-9_bib19","series-title":"Proc. 6th Internat. Conf on Logic Programming","first-page":"1989","article-title":"The relationship between logic program semantics and non monotonic reasoning","author":"Marek","year":"1989"},{"key":"10.1016\/0304-3975(94)00216-9_bib20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(92)90019-C","article-title":"The relationship between stable, supported, default and autoepistemic semantics for general logic programs","volume":"103","author":"Marek","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(94)00216-9_bib21","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. Lang. and Systems"},{"key":"10.1016\/0304-3975(94)00216-9_bib22","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/inco.1995.1005","article-title":"Computing circumscriptive deductive databases I: Theory and Algorithms","volume":"116","author":"Nerode","year":"1995","journal-title":"Inform and Comput."},{"year":"1993","series-title":"Logic for Applications","author":"Nerode","key":"10.1016\/0304-3975(94)00216-9_bib23"},{"key":"10.1016\/0304-3975(94)00216-9_bib24","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/69.390244","article-title":"WFS + branch and bound = stable models","volume":"7","author":"Subrahmanian","year":"1995","journal-title":"IEEE Trans. Knowledge Data Engrg."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002169?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:53Z","timestamp":1757477933000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397594002169"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00216-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing minimal models by partial instantiation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00216-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}