{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:01:23Z","timestamp":1750453283336},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242604"},{"type":"electronic","value":"9783540305972"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/978-3-540-30597-2_4","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T23:34:10Z","timestamp":1267400050000},"page":"84-118","source":"Crossref","is-referenced-by-count":10,"title":["Representing Paraconsistent Reasoning via Quantified Propositional Logic"],"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":"4_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/303976.303983","volume-title":"Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1999)","author":"M. Arenas","year":"1999","unstructured":"Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1999), pp. 68\u201379. ACM Press, New York (1999)"},{"key":"4_CR2","unstructured":"Arieli, O.: Paraconsistent preferential reasoning by signed quantified Boolean formulae. In: Proceedings of the 16th European Conference on Artificial Intelligence, ECAI 2004 (2004) (to appear)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1093\/logcom\/13.4.557","volume":"13","author":"O. Arieli","year":"2003","unstructured":"Arieli, O., Denecker, M.: Reducing preferential paraconsistent reasoning to classical entailment. Journal of Logic and Computation\u00a013(4), 557\u2013580 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-24627-5_3","volume-title":"Foundations of Information and Knowledge Systems","author":"O. Arieli","year":"2004","unstructured":"Arieli, O., Denecker, M., Nuffelen, B.V., Bruynooghe, M.: Database repair by signed formulae. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol.\u00a02942, pp. 14\u201330. Springer, Heidelberg (2004)"},{"key":"4_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":"4_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":"4_CR7","doi-asserted-by":"crossref","unstructured":"Benferhat, S., Dubois, D., Prade, H.: Argumentative inference in uncertain and inconsistent knowledge bases. In: Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI 1993), pp. 411\u2013419 (1993)","DOI":"10.1016\/B978-1-4832-1451-1.50054-8"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1004987830832","volume":"58","author":"S. Benferhat","year":"1997","unstructured":"Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. Part 1: The flat case. Studia Logica\u00a058(1), 17\u201345 (1997)","journal-title":"Studia Logica"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05689-9","volume-title":"An Introduction to Default Logic","author":"P. Besnard","year":"1989","unstructured":"Besnard, P.: An Introduction to Default Logic. Springer, Heidelberg (1989)"},{"key":"4_CR10","first-page":"150","volume-title":"Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997)","author":"P. Besnard","year":"1997","unstructured":"Besnard, P., Schaub, T.: Circumscribing inconsistency. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 150\u2013155. Morgan Kaufmann Publishers, San Francisco (1997)"},{"key":"4_CR11","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, 191\u2013213 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR12","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":"4_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-540-45062-7_43","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"P. Besnard","year":"2003","unstructured":"Besnard, P., Schaub, T., Tompits, H., Woltran, S.: Paraconsistent reasoning via quantified Boolean formulas, II: Circumscribing inconsistent theories. In: Nielsen, T.D., Zhang, N.L. (eds.) ECSQARU 2003. LNCS (LNAI), vol.\u00a02711, pp. 528\u2013539. Springer, Heidelberg (2003)"},{"key":"4_CR14","first-page":"1043","volume-title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989)","author":"G. Brewka","year":"1989","unstructured":"Brewka, G.: Preferred subtheories: An extended logical framework for default reasoning. In: Sridharan, N.S. (ed.) Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989), pp. 1043\u20131048. Morgan Kaufmann Publishers, San Francisco (1989)"},{"issue":"8","key":"4_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"1\u20132","key":"4_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence\u00a069(1\u20132), 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"key":"4_CR17","unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified Boolean formulae. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI 1998), pp. 262\u2013267. AAAI Press\/MIT Press (1998)"},{"key":"4_CR18","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"},{"issue":"3\u2013 4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1018939502485","volume":"22","author":"C. Cayrol","year":"1998","unstructured":"Cayrol, C., Lagasquie-Schiex, M., Schiex, T.: Nonmonotonic reasoning: From complexity to algorithms. Annals of Mathematics and Artificial Intelligence\u00a022(3\u2013 4), 207\u2013236 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-60112-0_13","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"C. Cayrol","year":"1995","unstructured":"Cayrol, C., Lagasquie-Schiex, M.-C.: Non-monotonic syntax-based entailment: A classification of consequence relations. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol.\u00a0946, pp. 107\u2013114. Springer, Heidelberg (1995)"},{"key":"4_CR21","volume-title":"Introduction to Mathematical Logic","author":"A. Church","year":"1956","unstructured":"Church, A.: Introduction to Mathematical Logic, vol.\u00a0I. Princeton University Press, Princeton (1956)"},{"key":"4_CR22","first-page":"61","volume-title":"Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002)","author":"S. Coste-Marquis","year":"2002","unstructured":"Coste-Marquis, S., Marquis, P.: Complexity results for paraconsistent inference relations. In: Fensel, D., Giunchiglia, F., McGuiness, D., Williams, M. (eds.) Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 61\u201372. Morgan Kaufmann Publishers, San Francisco (2002)"},{"issue":"7","key":"4_CR23","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putman, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"4_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-44652-4_45","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"J. Delgrande","year":"2001","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: On computing solutions to belief change scenarios. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol.\u00a02143, pp. 510\u2013521. Springer, Heidelberg (2001)"},{"key":"4_CR26","first-page":"1349","volume":"270","author":"I. D\u2019Ottaviano","year":"1970","unstructured":"D\u2019Ottaviano, I., da Costa, N.: Sur un probl\u00e8me de Ja\u015bkowski. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris\u00a0270, 1349\u20131353 (1970)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris"},{"key":"4_CR27","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified Boolean formulas. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 417\u2013422. AAAI Press\/MIT Press (2000)"},{"key":"4_CR28","unstructured":"Egly, U., Pichler, R., Woltran, S.: On deciding subsumption problems. In: Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002), pp. 89\u201397 (2002)"},{"key":"4_CR29","unstructured":"Egly, U., Tompits, H., Woltran, S.: On quantifier shifting for quantified Boolean formulas. In: Proceedings of the SAT 2002 Workshop on Theory and Applications of Quantified Boolean Formulas (QBF 2002), pp. 48\u201361 (2002)"},{"issue":"3\u20134","key":"4_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence\u00a015(3\u20134), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45616-3_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Klotz, V., Tompits, H., Woltran, S.: Modal nonmonotonic logics revisited: Efficient encodings for the basic reasoning tasks. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 100\u2013114. Springer, Heidelberg (2002)"},{"key":"4_CR32","unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate quantified Boolean formulas. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 285\u2013290. AAAI Press\/MIT Press (2000)"},{"key":"4_CR33","first-page":"515","volume-title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI 1987)","author":"A. Frisch","year":"1987","unstructured":"Frisch, A.: Inference without chaining. In: McDermott, J. (ed.) Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI 1987), pp. 515\u2013519. Morgan Kaufmann Publishers, San Francisco (1987)"},{"key":"4_CR34","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, New York (1979)"},{"key":"4_CR35","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)"},{"issue":"3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic and Computation\u00a02(3), 397\u2013425 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"4_CR37","first-page":"374","volume-title":"Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996)","author":"H. Kautz","year":"1996","unstructured":"Kautz, H., McAllester, D., Selman, B.: Encoding plans in propositional logic. In: Aiello, L., Doyle, J., Shapiro, S. (eds.) Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 374\u2013384. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"4_CR38","first-page":"359","volume-title":"Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992)","author":"H. Kautz","year":"1992","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359\u2013363. John Wiley & Sons, Chichester (1992)"},{"issue":"1","key":"4_CR39","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H. Kleine B\u00fcning","year":"1995","unstructured":"Kleine B\u00fcning, H., Karpinski, M., Fl\u00f6gel, A.: Resolution for quantified Boolean formulas. Information and Computation\u00a0117(1), 12\u201318 (1995)","journal-title":"Information and Computation"},{"key":"4_CR40","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)"},{"issue":"3","key":"4_CR41","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4064\/fm-14-1-1-81","volume":"14","author":"S. Le\u015bniewski","year":"1929","unstructured":"Le\u015bniewski, S.: Grundz\u00fcge eines neuen System der Grundlagen der Mathematik. Fundamenta Mathematica\u00a014, 1\u201381 (1929)","journal-title":"Fundamenta Mathematica"},{"key":"4_CR43","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45616-3_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Letz","year":"2002","unstructured":"Letz, R.: Lemma and model caching in decision procedures for quantified Boolean formulas. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 160\u2013175. Springer, Heidelberg (2002)"},{"key":"4_CR44","first-page":"1061","volume-title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989)","author":"H. Levesque","year":"1989","unstructured":"Levesque, H.: A knowledge-level account of abduction. In: Sridharan, N.S. (ed.) Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI 1989), pp. 1061\u20131067. Morgan Kaufmann Publishers, San Francisco (1989)"},{"issue":"Cl. III","key":"4_CR45","first-page":"30","volume":"23","author":"J. \u0141ukasiewicz","year":"1930","unstructured":"\u0141ukasiewicz, J., Tarski, A.: Untersuchungen \u00fcber den Aussagenkalk\u00fcl. Comptes Rendus S\u00e9ances Soci\u00e9t\u00e9 des Sciences et Lettres Varsovie\u00a023(Cl. III), 30\u201350 (1930)","journal-title":"Comptes Rendus S\u00e9ances Soci\u00e9t\u00e9 des Sciences et Lettres Varsovie"},{"key":"4_CR46","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 nonmonotonic reasoning. Artificial Intelligence\u00a013, 27\u201339 (1980)","journal-title":"Artificial Intelligence"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual Symposium on Switching and Automata Theory, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"4_CR48","first-page":"1","volume-title":"ACM Symposium on Theory of Computing (STOC 1973)","author":"A.R. Meyer","year":"1973","unstructured":"Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. In: ACM Symposium on Theory of Computing (STOC 1973), pp. 1\u20139. ACM Press, New York (1973)"},{"key":"4_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1303-8","volume-title":"Binary Decision Diagrams and Applications for VLSI CAD","author":"S. Minato","year":"1996","unstructured":"Minato, S.: Binary Decision Diagrams and Applications for VLSI CAD. Kluwer, Dordrecht (1996)"},{"issue":"1-2","key":"4_CR50","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":"4_CR51","first-page":"417","volume-title":"Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR 1991)","author":"B. Nebel","year":"1991","unstructured":"Nebel, B.: Belief revision and default reasoning: Syntax-based approaches. In: Allen, J., Fikes, R., Sandewall, E. (eds.) Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 417\u2013428. Morgan Kaufmann Publishers, San Francisco (1991)"},{"key":"4_CR52","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"4_CR53","series-title":"Lecture Notes in Artificial Intelligence","first-page":"306","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"4_CR54","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0166-218X(02)00409-2","volume":"130","author":"D. Plaisted","year":"2003","unstructured":"Plaisted, D., Biere, A., Zhu, Y.: A satisfiability procedure for quantified Boolean formulae. Discrete Applied Mathematics\u00a0130, 291\u2013328 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR55","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":"4_CR56","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"},{"issue":"1\u20132","key":"4_CR57","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013(1\u20132), 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"4_CR58","volume-title":"Plausible Reasoning","author":"N. Rescher","year":"1976","unstructured":"Rescher, N.: Plausible Reasoning. Van Gorcum, Amsterdam (1976)"},{"key":"4_CR59","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF00154005","volume":"1","author":"N. Rescher","year":"1970","unstructured":"Rescher, N., Manor, R.: On inference from inconsistent premises. Theory and Decision\u00a01, 179\u2013219 (1970)","journal-title":"Theory and Decision"},{"key":"4_CR60","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen","year":"1999","unstructured":"Rintanen, J.: Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research\u00a010, 323\u2013352 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"4_CR61","first-page":"1192","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999)","author":"J. Rintanen","year":"1999","unstructured":"Rintanen, J.: Improvements to the evaluation of quantified Boolean formulae. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 1192\u20131197. Morgan Kaufmann Publishers, San Francisco (1999)"},{"issue":"1","key":"4_CR62","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM\u00a012(1), 23\u201341 (1965)","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR63","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2369962","volume":"28","author":"B. Russell","year":"1906","unstructured":"Russell, B.: The theory of implication. American Journal of Mathematics\u00a028(2), 159\u2013202 (1906)","journal-title":"American Journal of Mathematics"},{"key":"4_CR64","unstructured":"Schamberger, S.: Ein paralleler Algorithmus zum L\u00f6sen von Quantifizierten Boole\u2019schen Formeln. Master\u2019s thesis, Universit\u00e4t Gesamthochschule Paderborn (2000)"},{"key":"4_CR65","doi-asserted-by":"crossref","unstructured":"Srzednicki, J., Stachniak, Z. (eds.): Lesniewski\u2019s Systems Protothetic, Dordrecht (1998)","DOI":"10.1007\/978-94-011-5736-0"},{"key":"4_CR66","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science\u00a09, 67\u201372 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science\u00a03(1), 1\u201322 (1976)","journal-title":"Theoretical Computer Science"},{"key":"4_CR68","first-page":"89","volume":"16","author":"H. Tompits","year":"2003","unstructured":"Tompits, H.: Expressing default abduction problems as quantified Boolean formulas. AI Communications\u00a016, 89\u2013105 (2003)","journal-title":"AI Communications"},{"key":"4_CR69","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45757-7_10","volume-title":"Logics in Artificial Intelligence","author":"H. Turner","year":"2002","unstructured":"Turner, H.: Polynomial-length planning spans the polynomial hierarchy. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 111\u2013124. Springer, Heidelberg (2002)"},{"key":"4_CR70","unstructured":"Whitehead, A.N., Russell, B.: Principia Mathematica, vol.\u00a01\u20133. Cambridge University Press, Cambridge (1910\u201313)"},{"key":"4_CR71","unstructured":"Woltran, S.: Quantified Boolean Formulas \u2013 From Theory to Practice. PhD thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (2003)"},{"issue":"1","key":"4_CR72","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theoretical Computer Science\u00a03(1), 23\u201333 (1976)","journal-title":"Theoretical Computer Science"},{"key":"4_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46135-3_14","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 200\u2013215. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Inconsistency Tolerance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30597-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:16:04Z","timestamp":1558876564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30597-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242604","9783540305972"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30597-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}