{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:34:43Z","timestamp":1725564883055},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404941"},{"type":"electronic","value":"9783540450627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45062-7_43","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T22:14:10Z","timestamp":1283552050000},"page":"528-539","source":"Crossref","is-referenced-by-count":6,"title":["Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Besnard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Arieli, O., Avron, A.: Logical bilattices and inconsistent data. In: Proc. LICS, pp. 468\u2013476 (1994)","DOI":"10.1109\/LICS.1994.316044"},{"key":"43_CR2","first-page":"392","volume-title":"Proc. ICTAI 1996","author":"O. Arieli","year":"1996","unstructured":"Arieli, O., Avron, A.: Automatic diagnoses for properly stratified knowledge-bases. In: Proc. ICTAI 1996, pp. 392\u2013399. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0004-3702(98)00032-0","volume":"102","author":"O. Arieli","year":"1998","unstructured":"Arieli, O., Avron, A.: The value of four values. Artificial Intelligence\u00a0102(1), 97\u2013141 (1998)","journal-title":"Artificial Intelligence"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45758-5_1","volume-title":"Foundations of Information and Knowledge Systems","author":"O. Arieli","year":"2002","unstructured":"Arieli, O., Denecker, M.: Modeling paraconsistent reasoning by classical logic. In: Eiter, T., Schewe, K.-D. (eds.) FoIKS 2002. LNCS, vol.\u00a02284, pp. 1\u201314. Springer, Heidelberg (2002)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(91)90023-U","volume":"92","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Simple consequence relations. Information and Computation\u00a092, 105\u2013139 (1991)","journal-title":"Information and Computation"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36126-X_12","volume-title":"Formal Methods in Computer-Aided Design","author":"A. Ayari","year":"2002","unstructured":"Ayari, A., Basin, D.: QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 187\u2013201. Springer, Heidelberg (2002)"},{"key":"43_CR7","volume-title":"Modern Uses of Multiple-Valued Logic","author":"N. Belnap","year":"1977","unstructured":"Belnap, N.: A useful four-valued logic. In: Dunn, J., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic. Reidel, Dordrechtz (1977)"},{"key":"43_CR8","unstructured":"Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proc. IJCAI 1993, pp. 640\u2013647 (1993)"},{"key":"43_CR9","unstructured":"Besnard, P., Schaub, T.: Circumscribing inconsistency. In: Proc. IJCAI 1997, pp. 150\u2013155 (1997)"},{"issue":"1-2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1005957026440","volume":"20","author":"P. Besnard","year":"1998","unstructured":"Besnard, P., Schaub, T.: Signed systems for paraconsistent reasoning. Journal of Automated Reasoning\u00a020(1-2), 191\u2013213 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"43_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45757-7_27","volume-title":"Logics in Artificial Intelligence","author":"P. Besnard","year":"2002","unstructured":"Besnard, P., Schaub, T., Tompits, H., Woltran, S.: Paraconsistent reasoning via quantified Boolean formulas, I: Axiomatising signed systems. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 320\u2013331. Springer, Heidelberg (2002)"},{"key":"43_CR12","first-page":"262","volume-title":"Proc. AAAI 1998","author":"M. Cadoli","year":"1998","unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified Boolean formulae. In: Proc. AAAI 1998, pp. 262\u2013267. AAAI Press, Menlo Park (1998)"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02136173","volume":"18","author":"M. Cadoli","year":"1996","unstructured":"Cadoli, M., Schaerf, M.: On the complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence\u00a018, 29\u201350 (1996)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"43_CR14","unstructured":"Carnielli, W., Fari\u00f1as del Cerro, L., Lima Marques, M.: Contextual negations and reasoning with contradictions. In: Proc. IJCAI 1991, pp. 532\u2013537 (1991)"},{"key":"43_CR15","unstructured":"Coste-Marquis, S., Marquis, P.: Complexity results for paraconsistent inference relations. In: Proc. KR 2002, pp. 61\u201372 (2002)"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty, P., Lukaszewicz, W., Szalas, A.: Computing circumscription revisited: Areduction algorithm. Journal of Automated Reasoning\u00a018, 297\u2013334 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"43_CR17","unstructured":"D\u2019Ottaviano, I., da Costa, N.: Sur un probl\u00e8me de Ja\u015bkowski. In: Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris, vol.\u00a0270, pp. 1349\u20131353 (1970)"},{"key":"43_CR18","first-page":"285","volume-title":"Proc. AAAI 2000","author":"R. Feldmann","year":"2000","unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate quantified Boolean formulas. In: Proc. AAAI 2000, pp. 285\u2013290. AAAI Press, Menlo Park (2000)"},{"key":"43_CR19","unstructured":"Frisch, A.: Inference without chaining. In: Proc. IJCAI 1987, pp. 515\u2013519 (1987)"},{"key":"43_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-45744-5_27","volume-title":"Automated Reasoning","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A system for deciding quantified Boolean formulas satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 364\u2013369. Springer, Heidelberg (2001)"},{"key":"43_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45757-7_28","volume-title":"Logics in Artificial Intelligence","author":"S. Konieczny","year":"2002","unstructured":"Konieczny, S., Marquis, P.: Three-valued logics for inconsistency handling. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 332\u2013344. Springer, Heidelberg (2002)"},{"key":"43_CR22","unstructured":"Levesque, H.: A knowledge-level account of abduction. In: Proc. IJCAI 1989, pp. 1061\u20131067 (1989)"},{"key":"43_CR23","unstructured":"Lin, F.: Reasoning in the presence of inconsistency. In: Proc. AAAI 1987, pp. 139\u2013143 (1987)"},{"key":"43_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF00154005","volume":"1","author":"R. Manor","year":"1970","unstructured":"Manor, R., Rescher, N.: On inferences from inconsistent information. Theory and Decision\u00a01, 179\u2013219 (1970)","journal-title":"Theory and Decision"},{"key":"43_CR25","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\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"43_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science\u00a052(1-2), 145\u2013153 (1987)","journal-title":"Theoretical Computer Science"},{"key":"43_CR27","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00258428","volume":"8","author":"G. Priest","year":"1979","unstructured":"Priest, G.: Logic of paradox. Journal of Philosophical Logic\u00a08, 219\u2013241 (1979)","journal-title":"Journal of Philosophical Logic"},{"key":"43_CR28","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0004-3702(89)90027-1","volume":"39","author":"G. Priest","year":"1989","unstructured":"Priest, G.: Reasoning about truth. Artificial Intelligence\u00a039, 231\u2013244 (1989)","journal-title":"Artificial Intelligence"},{"key":"43_CR29","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1111\/j.1467-8640.1985.tb00061.x","volume":"1","author":"E. Sandewall","year":"1985","unstructured":"Sandewall, E.: A functional approach to non-monotonic logic. Computational Intelligence\u00a01, 80\u201387 (1985)","journal-title":"Computational Intelligence"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45062-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T18:35:58Z","timestamp":1553020558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45062-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404941","9783540450627"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45062-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}