{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:48Z","timestamp":1725663648819},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534877"},{"type":"electronic","value":"9783540463139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53487-3_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:05:44Z","timestamp":1330189544000},"page":"21-32","source":"Crossref","is-referenced-by-count":2,"title":["Discriminant circumscription"],"prefix":"10.1007","author":[{"given":"Li Yan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","first-page":"293","volume-title":"Logic and Databases","author":"K. Clark","year":"1978","unstructured":"Clark K., Negation as Failure, in Logic and Databases, H. Gallaire and J. Minker (ed.), Plenum Press, New York, 1978, 293\u2013322."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","volume":"12","author":"J. Doyle","year":"1979","unstructured":"Doyle J., A Truth Maintenance System, Artificial Intelligence Vol. 12, (1979), 231\u2013272.","journal-title":"Artificial Intelligence"},{"key":"2_CR3","unstructured":"Dung P. and K. Kanchanasut, A Fixpoint Approach to Declarative Semantics of Logic Programs, in Proc. North American Conference on Logic Programming, E. Lust and R. Overbeek (ed.), MIT Press, 1989, 604\u2013625."},{"key":"2_CR4","unstructured":"Dung P. and K. Kanchanasut, On the Generalized Predicate Completion of Non-Horn Program, in Proc. North American Conference on Logic Programming, E. Lust and R. Overbeek (ed.), MIT Press, 1989, 587\u2013603."},{"key":"2_CR5","unstructured":"Gelfond M. and V. Lifschitz, Compiling Circumscriptive Theories into Logic Programs, in Proc. 7th AAAI, 1988, 455\u2013459."},{"key":"2_CR6","unstructured":"Gelfond M. and V. Lifschitz, The Stable Model Semantics for Logic Programming, in Proc. 5th Symposium\/Conference on Logic Programming, R. A. Kowalski and K. A. Bowen (ed.), MIT Press, 1988, 1070\u20131080."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"Hanks S. and D. McDermott, Nonmonotonic Logic and Temporal Projection, Artificial Intelligence Vol. 33, (1987), 379\u2013412.","journal-title":"Artificial Intelligence"},{"key":"2_CR8","unstructured":"Lifschitz V., Computing Circumscription, Proc. IJCAI-85, Los Angeles, CA, 1985, 121\u2013127."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Lifschitz V., On the Declarative Semantics of Logic Programs with Negation, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 177\u2013192.","DOI":"10.1016\/B978-0-934613-40-8.50008-7"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy J., Circumscription\u2014A Form of Non-monotonic Reasoning, Artificial Intelligence Vol. 13, (1980), 27\u201339.","journal-title":"Artificial Intelligence"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy J., Applications of Circumscription to Formalizing Common-Sense Reasoning, Artificial Intelligence Vol. 28, (1986), 86\u2013116.","journal-title":"Artificial Intelligence"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0004-3702(88)90022-7","volume":"35","author":"P. H. Morris","year":"1988","unstructured":"Morris P. H., The Anomalous Extension Problem in Default Reasoning, Artificial Intelligence Vol. 35, (1988), 383\u2013399.","journal-title":"Artificial Intelligence"},{"key":"2_CR13","unstructured":"Przymusinski T., Non-monotonic Reasoning vs. Logic Programming: a New Perspective, in Formal Foundations of Artificial Intelligence, D. Patridge and Y. Wilks (ed.), 1988."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Przymusinski T., On the Declarative Semantics of Deductive Databases and Logic Programs, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 193\u2013216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"2_CR15","unstructured":"Przymusinski T., Three-Valued Formalizations of Non-monotonic Reasoning and Logic Programming, in Proc. First Int'l Conference on Principles of Knowledge, Representation, and Reasoning, Morgan Kaufmann, 1989, 341\u2013348."},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. C. Przymusinski","year":"1989","unstructured":"Przymusinski T. C., An Algorithm to Compute Circumscription, Artificial Intelligence Vol. 38, (1989), 47\u201373.","journal-title":"Artificial Intelligence"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Shepherson J., Negation in Logic Programs, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 19\u201388.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Van Gelder A., K. Ross and J. Schlipf, Unfounded Sets and Well-founded Semantics for General Logic Programs, in Proc. the 7th ACM PODS, 1988, 221\u2013230.","DOI":"10.1145\/308386.308444"},{"key":"2_CR19","unstructured":"You J. and L. Li, Supported Circumscription and Its Relation to Logic Programming with Negation, in Proc. North American Conference on Logic Programming, MIT Press, 1989."},{"key":"2_CR20","unstructured":"Yuan L. and J. You, A New Circumscription Method for Stable Model Semantics, unpublished manuscript, 1990."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53487-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:50:11Z","timestamp":1605628211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53487-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534877","9783540463139"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-53487-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}