{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:26:05Z","timestamp":1725636365136},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540531326"},{"type":"electronic","value":"9783642760716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/978-3-642-76071-6_18","type":"book-chapter","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T13:16:55Z","timestamp":1321967815000},"page":"160-170","source":"Crossref","is-referenced-by-count":3,"title":["A New and Simple Method for Explicit Computation of a Circumscription"],"prefix":"10.1007","author":[{"given":"Sukhamay","family":"Kundu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T Przymusinsky","year":"1989","unstructured":"Przymusinsky, T\u201e An algorithm to compute circumscription, Artificial Intelligence 38(1989), pp. 49\u201373.","journal-title":"Artificial Intelligence"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"ML Ginsberg","year":"1989","unstructured":"Ginsberg, M. L., A circumscriptive theorem prover, Artificial Intelligence 39 (1989), pp. 209\u2013230.","journal-title":"Artificial Intelligence"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M Gelfond","year":"1989","unstructured":"Gelfond, M., Przymusinska, H. and Przymusinsky, T., On the relationship between circumscription and negation as failure, Artificial Intelligence 38 (1989), pp. 75\u201394.","journal-title":"Artificial Intelligence"},{"key":"18_CR4","first-page":"293","volume-title":"Logic and Databases","author":"KL Clark","year":"1978","unstructured":"Clark, K.L., Negation as failure, in H. Gallaire and J. Minker (Eds.), Logic and Databases, Plenum Press, New York, (1978), pp. 293\u2013322."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J McCarthy","year":"1980","unstructured":"McCarthy, J., Circumscription \u2014 a form of non-monotonic reasoning, Artificial Intelligence 13 (1980), pp. 27\u201339.","journal-title":"Artificial Intelligence"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"89","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 knowledge, Artificial Intelligence 28 (1986), pp. 89\u2013116.","journal-title":"Artificial Intelligence"},{"key":"18_CR7","first-page":"121","volume-title":"Computing circumscription","author":"V Lifschitz","year":"1985","unstructured":"Lifschitz, V., Computing circumscription, Proceedings IJCAL-85, Los Angeles, CA (1985), pp. 121\u2013127."},{"key":"18_CR8","first-page":"406","volume-title":"Pointwise circumscription","author":"V Lifschitz","year":"1986","unstructured":"Lifschitz, V., Pointwise circumscription, Proceedings AAAI-86, Philadelphia, PA (1986), pp. 406\u2013410."},{"key":"18_CR9","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 Apt","year":"1988","unstructured":"Apt, K., Blair, H. and Walker, A., Towards a theory of declarative knowledge, in J. Minker (Ed.), Foundations of Deductive databases and Logic Programming Morgan Kaufmann, Los Altos, CA (1988), pp. 89\u2013148."},{"key":"18_CR10","first-page":"418","volume-title":"Circumscription implies predicate completion (sometimes)","author":"R Reiter","year":"1982","unstructured":"Reiter, R., Circumscription implies predicate completion (sometimes), Proceedings AAAI-82, Pittsburgh, PA (1982), pp. 418\u2013420."},{"key":"18_CR11","first-page":"133","volume-title":"The extended closed world assumption and its relationship to parallel circumscription","author":"M Gelfond","year":"1986","unstructured":"Gelfond, M., Przymusinska, H. and Przymusinsky, T., The extended closed world assumption and its relationship to parallel circumscription, Proceedings of Symposium on Principles of Database Systems, Cambridge, MA (1986), pp. 133\u2013139."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J Shepherdson","year":"1984","unstructured":"Shepherdson, J., Negation as failure: a comparison of Clark\u2019s completed databases and Reiter\u2019s closed world assumption, Journal of Logic programming, 1 (1984), pp. 51\u201379.","journal-title":"Journal of Logic programming"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","volume":"27","author":"V Lifschitz","year":"1985","unstructured":"Lifschitz, V., Close-world databases and circumscription, Artificial Intelligence 27 (1985), pp. 229\u2013235.","journal-title":"Artificial Intelligence"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G Bossu","year":"1985","unstructured":"Bossu, G and Siegel, P., Saturation, non-monotonic reasoning and the closed world assumption, Artificial Intelligence 25 (1985), pp. 13\u201363.","journal-title":"Artificial Intelligence"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1111\/j.1467-8640.1985.tb00055.x","volume":"1","author":"D Etherington","year":"1985","unstructured":"Etherington, D., Mercer, R. and Reiter, R., On the adequacy of predicate circumscription for closed-world reasoning, Computational Intelligence, 1(1985), pp. 11\u201315.","journal-title":"Computational Intelligence"},{"key":"18_CR16","first-page":"133","volume-title":"On the relationship between autoepistemic logic and parallel circumscription","author":"M Gelfond","year":"1986","unstructured":"Gelfond, M. and Przymusinska, H., On the relationship between autoepistemic logic and parallel circumscription, Proceedings of Symposium on Principles of Database Systems, Cambridge, MA (1986), pp. 133\u2013139."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","volume":"32","author":"T Imielinski","year":"1987","unstructured":"Imielinski, T., Results on translating defaults to circumscription, Artificial Intelligence 32 (1987), pp. 131\u2013146.","journal-title":"Artificial Intelligence"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0004-3702(89)90070-2","volume":"38","author":"A Rabinov","year":"1989","unstructured":"Rabinov, A., A generalization of collapsible cases of circumscription, artificial Intelligence, 38(1989), pp. 111\u2013117","journal-title":"artificial Intelligence"}],"container-title":["Informatik-Fachberichte","GWAI-90 14th German Workshop on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-76071-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:03:03Z","timestamp":1606255383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-76071-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540531326","9783642760716"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-76071-6_18","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1990]]}}}