{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:16:02Z","timestamp":1648959362529},"reference-count":14,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1080\/095281396147456","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T16:22:42Z","timestamp":1027700562000},"page":"191-205","source":"Crossref","is-referenced-by-count":2,"title":["A new class of theories for which circumscription can be obtained via the predicate completion"],"prefix":"10.1080","volume":"8","author":[{"given":"SUKHAMAY","family":"KUNDU","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90040-2"},{"key":"CIT0002","first-page":"293","volume-title":"Logic and Databases","author":"Clark K. L.","year":"1978"},{"key":"CIT0003","doi-asserted-by":"crossref","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. pp.133\u2013139.","DOI":"10.1145\/6012.15410"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90068-4"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90064-6"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Kundu, S. and Chen, J. A new and simple method for explicit computation of circumscription. Proceedings of GWAI-90, German Workshop on Artificial Intelligence. September1990, Geske, W. Germany.","DOI":"10.1007\/978-3-642-76071-6_18"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90055-4"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90028-7"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90011-9"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90032-9"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90067-2"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90070-2"},{"key":"CIT0013","unstructured":"Reiter, R. Circumscription implies predicate completion (sometimes). Proceedings AAAI-82. Pittsburgh, PA. pp.418\u2013420."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90023-2"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/095281396147456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T11:32:48Z","timestamp":1511955168000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/095281396147456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["10.1080\/095281396147456"],"URL":"https:\/\/doi.org\/10.1080\/095281396147456","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"value":"0952-813X","type":"print"},{"value":"1362-3079","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}