{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:55:00Z","timestamp":1768456500200,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642156748","type":"print"},{"value":"9783642156755","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15675-5_18","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T00:07:17Z","timestamp":1284336437000},"page":"195-207","source":"Crossref","is-referenced-by-count":8,"title":["Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription"],"prefix":"10.1007","author":[{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"first","affiliation":[]},{"given":"Radu","family":"Grigore","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Cadoli, M., Lenzerini, M.: The complexity of closed world reasoning and circumscription. In: AAAI Conference on Artificial Intelligence, pp. 550\u2013555 (1990)"},{"key":"18_CR2","unstructured":"Castell, T., Cayrol, C., Cayrol, M., Berre, D.L.: Using the Davis and Putnam procedure for an efficient computation of preferred models. In: European Conference on Artificial Intelligence, pp. 350\u2013354 (1996)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, ch.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/B978-044450813-3\/50021-7","volume-title":"Handbook of Automated Reasoning","author":"J. Dix","year":"2001","unstructured":"Dix, J., Furbach, U., Niemel\u00e4, I.: Nonmonotonic reasoning: Towards efficient calculi and implementations. In: Voronkov, A., Robinson, A. (eds.) Handbook of Automated Reasoning, vol.\u00a019, pp. 1241\u20131354. North-Holland, Amsterdam (2001)"},{"key":"18_CR5","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified boolean formulas. In: AAAI Conference on Artificial Intelligence, pp. 417\u2013422 (2000)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are $\\Pi^P_2$ -complete. Theor. Comput. Sci.\u00a0114(2), 231\u2013245 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"12-13","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","volume":"172","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. Artif. Intell.\u00a0172(12-13), 1495\u20131539 (2008)","journal-title":"Artif. Intell."},{"key":"18_CR8","first-page":"191","volume-title":"Principles of programming languages (POPL)","author":"C. Flanagan","year":"2002","unstructured":"Flanagan, C., Qadeer, S.: Predicate abstraction for software verification. In: Principles of programming languages (POPL), pp. 191\u2013202. ACM, New York (2002)"},{"issue":"1","key":"18_CR9","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., Przymusinski, T.C.: On the relationship between circumscription and negation as failure. Artif. Intell.\u00a038(1), 75\u201394 (1989)","journal-title":"Artif. Intell."},{"key":"18_CR10","unstructured":"Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: European Conference on Artificial Intelligence, pp. 377\u2013381 (2006)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.H.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log.\u00a07(1), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: European Conf. on Logics in Artif. Intell., pp. 134\u2013146 (2004)","DOI":"10.1007\/978-3-540-30227-8_14"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Janota, M., Botterweck, G., Grigore, R., Marques-Silva, J.: How to complete an interactive configuration process? In: Conference on Current Trends in Theory and Practice of Computer Science, pp. 528\u2013539 (2010)","DOI":"10.1007\/978-3-642-11266-9_44"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Janota, M., Grigore, R., Marques-Silva, J.: Counterexample guided abstraction refinement algorithm for propositional circumscription. Tech. Rep. TR-32-2010, INESC-ID Lisboa (2010)","DOI":"10.1007\/978-3-642-15675-5_18"},{"key":"18_CR15","unstructured":"Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69\u2013127 (1996)"},{"issue":"1-2","key":"18_CR16","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 - a form of non-monotonic reasoning. Artif. Intell.\u00a013(1-2), 27\u201339 (1980)","journal-title":"Artif. Intell."},{"issue":"1","key":"18_CR17","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. Artif. Intell.\u00a028(1), 89\u2013116 (1986)","journal-title":"Artif. Intell."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"6th Conference on Automated Deduction","author":"J. Minker","year":"1982","unstructured":"Minker, J.: On indefinite databases and the closed world assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol.\u00a0138, pp. 292\u2013308. Springer, Heidelberg (1982)"},{"key":"18_CR19","unstructured":"Niemel\u00e4, I.: Implementing circumscription using a tableau method. In: European Conference on Artificial Intelligence, pp. 80\u201384 (1996)"},{"key":"18_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11546207_36","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Oikarinen","year":"2005","unstructured":"Oikarinen, E., Janhunen, T.: circ2dlp \u2014 translating circumscription into disjunctive logic programming. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 405\u2013409. Springer, Heidelberg (2005)"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"49","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. Artif. Intell.\u00a038(1), 49\u201373 (1989)","journal-title":"Artif. Intell."},{"key":"18_CR22","unstructured":"Rosa, E.D., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints. An International Journal (2010) (in press)"},{"key":"18_CR23","unstructured":"SAT4j, http:\/\/www.sat4j.org"},{"issue":"115-125","key":"18_CR24","first-page":"10","volume":"2","author":"G.S. Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. Studies in constructive mathematics and mathematical logic\u00a02(115-125), 10\u201313 (1968)","journal-title":"Studies in constructive mathematics and mathematical logic"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A.H. Yahya","year":"1985","unstructured":"Yahya, A.H., Henschen, L.J.: Deduction in non-Horn databases. Journal of Automated Reasoning\u00a01(2), 141\u2013160 (1985)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T12:44:09Z","timestamp":1559652249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}