{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:10:01Z","timestamp":1749125401554,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1006319819647","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T01:36:27Z","timestamp":1040520987000},"page":"247-289","source":"Crossref","is-referenced-by-count":0,"title":["Evaluation of Queries under Closed-World Assumption. Part II: The Hierarchical Case"],"prefix":"10.1007","volume":"25","author":[{"given":"Marek A.","family":"Suchenek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"241382_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"Apt, K. R., Blair, H. A. and Walker, A.: Towards a theory of declarative knowledge, in Minker, J., (ed.): [14], 1988, pp. 89\u2013142."},{"key":"241382_CR2","first-page":"739","volume-title":"Handbook of Mathematical Logic","author":"P. Aczel","year":"1978","unstructured":"Aczel, P.: An introduction to inductive definitions, in Barwise, J. (ed.): [3], Chapter C.7, 1978, pp. 739\u2013782.","edition":"2nd edn"},{"key":"241382_CR3","volume-title":"Handbook of Mathematical Logic","year":"1978","unstructured":"Barwise, J. (ed.): Handbook of Mathematical Logic, 2nd edn, North-Holland, Amsterdam, 1978.","edition":"2nd edn"},{"issue":"1","key":"241382_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1984","unstructured":"Bossu, G. and Siegel, P.: Saturation, nonmonotonic reasoning, and the closed world assumption, Artif. Intell.\n25(1) (1984), 13\u201364.","journal-title":"Artif. Intell."},{"key":"241382_CR5","doi-asserted-by":"crossref","unstructured":"Clark, K. L.: Negation as failure, in H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, 1978, pp. 55\u201376.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"1","key":"241382_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1111\/j.1467-8640.1985.tb00055.x","volume":"1","author":"D. W. Etherington","year":"1985","unstructured":"Etherington, D. W., Mercer, R. E. and Reiter, R.: On the adequacy of predicate circumscription for closed-world reasoning, Comput. Intell.\n1(1) (1985), 11\u201315.","journal-title":"Comput. Intell."},{"key":"241382_CR7","doi-asserted-by":"crossref","unstructured":"Fitting, M.: First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4684-0357-2"},{"key":"241382_CR8","first-page":"19","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"A. Van Gelder","year":"1988","unstructured":"Van Gelder, A.: Negation as failure using tight derivations for general logic programs, in Minker, J., (ed.): [14], 1988, pp. 19\u201388."},{"key":"241382_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"Gelfond, M., Przymusi\u0144ska, H. and Przymusi\u0144ski, T. C.: On the relationship between circumscription and negation as failure, Artif. Intell.\n38 (1989), 75\u201394.","journal-title":"Artif. Intell."},{"key":"241382_CR10","first-page":"47","volume-title":"Handbook of Mathematical Logic","author":"H. J. Keisler","year":"1978","unstructured":"Keisler, H. J.: Fundamentals of model theory, in Barwise, J. (ed.): [3], Chapter A.2, 1978, pp. 47\u2013104.","edition":"2nd edn"},{"key":"241382_CR11","first-page":"371","volume-title":"Handbook of Mathematical Logic","author":"K. Kunen","year":"1978","unstructured":"Kunen, K.: Combinatorics, in Barwise, J. (ed.): [3], Chapter B.3, 1978, pp. 371\u2013401.","edition":"2nd edn"},{"key":"241382_CR12","unstructured":"Lifschitz, V.: Computing circumscription, in Proceedings of Eight International Joint Conference on Artificial Intelligence, Los Angeles, 1985, pp. 121\u2013127."},{"key":"241382_CR13","series-title":"Symbolic Computation. Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.: Foundations of Logic Programming, 2nd extended edn, (Symbolic Computation. Artificial Intelligence), Springer-Verlag, New York, edn, 1987.","edition":"2nd extended ed"},{"volume-title":"Foundations of Deductive Databases and Logic Programming","year":"1988","key":"241382_CR14","unstructured":"Minker, J., (ed.): Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, 1988."},{"key":"241382_CR15","doi-asserted-by":"crossref","unstructured":"Reiter, R.: On closed world data bases, in H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, 1978, pp. 55\u201376.","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"241382_CR16","first-page":"182","volume-title":"Methodologies for Intelligent Systems 5","author":"M. A. Suchenek","year":"1990","unstructured":"Suchenek, M. A. and Sunderraman, R.: Minimal models for closed world data bases with views, in Z. W. Ras (ed.), Methodologies for Intelligent Systems 5, North-Holland, New York, 1990, pp. 182\u2013193."},{"key":"241382_CR17","first-page":"28","volume":"1","author":"M. A. Suchenek","year":"1990","unstructured":"Suchenek, M. A. and Sunderraman, R.: On negative information in deductive data bases, J. Database Administration\n1 (1990), 28\u201341. An invited paper.","journal-title":"J. Database Administration"},{"key":"241382_CR18","unstructured":"Suchenek, M. A.: Forcing versus closed world assumption, in Z. W. Ra\u015b and M. Zemankova, (eds.), Methodologies for Intelligent Systems, North-Holland, 1987, pp. 453\u2013460."},{"key":"241382_CR19","series-title":"Lecture Notes in Comput. Sci.","first-page":"243","volume-title":"Algebraic Logic and Universal Algebra in Computer Science","author":"M. A. Suchenek","year":"1988","unstructured":"Suchenek, M. A.: Incremental models of updating data bases, in C. H. Bergman, R. D. Maddux, and D. L. Pigozzi (eds.), Algebraic Logic and Universal Algebra in Computer Science, Lecture Notes in Comput. Sci. 425, Ames, June 1-4, Springer-Verlag, 1988, pp. 243\u2013271."},{"issue":"1","key":"241382_CR20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0129054190000059","volume":"1","author":"M. A. Suchenek","year":"1990","unstructured":"Suchenek, M. A.: Applications of Lyndon homomorphism theorems to the theory of minimal models, Internat. J. Found. Comput. Sci.\n1(1) (1990), 49\u201359.","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"241382_CR21","first-page":"187","volume-title":"Informal Proceedings of 2nd Workshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming, International Logic Programming Symposium","author":"M. A. Suchenek","year":"1993","unstructured":"Suchenek, M. A.: Alternative computations of minimal consequences in indefinite deductive data bases, in Informal Proceedings of 2nd Workshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming, International Logic Programming Symposium, Vancouver, British Columbia, Canada, October 29, MSI Cornell University, 1993, pp. 187\u2013204."},{"key":"241382_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00881837","volume":"10","author":"M. A. Suchenek","year":"1993","unstructured":"Suchenek, M. A.: First-order syntactic characterizations of minimal entailment, domain minimal entailment, and Herbrand entailment, J. Automated Reasoning\n10 (1993), 237\u2013263.","journal-title":"J. Automated Reasoning"},{"key":"241382_CR23","first-page":"315","volume":"1","author":"M. A. Suchenek","year":"1994","unstructured":"Suchenek, M. A.: Preservation properties in deductive databases, Methods of Logic in Comput. Sci., an Internat. J.\n1 (1994) 315\u2013338. An invited paper.","journal-title":"Methods of Logic in Comput. Sci., an Internat. J."},{"key":"241382_CR24","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1005723423016","volume":"18","author":"M. A. Suchenek","year":"1997","unstructured":"Suchenek, M. A.: Evaluation of queries under the closed-world assumption, J. Automated Reasoning\n18 (1997), 357\u2013398.","journal-title":"J. Automated Reasoning"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006319819647.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006319819647\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006319819647.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:28:59Z","timestamp":1749122939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006319819647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["241382"],"URL":"https:\/\/doi.org\/10.1023\/a:1006319819647","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}