{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:52Z","timestamp":1725493192999},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441908"},{"type":"electronic","value":"9783540457572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_27","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T17:50:39Z","timestamp":1192902639000},"page":"320-331","source":"Crossref","is-referenced-by-count":7,"title":["Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems"],"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","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"S. Benferhat, D. Dubois, and H. Prade. Argumentative Inference in Uncertain and Inconsistent Knowledge Bases. In Proc. UAI-93, pages 411\u2013419, 1993.","DOI":"10.1016\/B978-1-4832-1451-1.50054-8"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1005957026440","volume":"20","author":"P. Besnard","year":"1998","unstructured":"P. Besnard and T. Schaub. Signed Systems for Paraconsistent Reasoning. Journal of Automated Reasoning, 20:191\u2013213, 1998.","journal-title":"Journal of Automated Reasoning"},{"key":"27_CR3","unstructured":"M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262\u2013267. AAAI Press, 1998."},{"issue":"3\u20134","key":"27_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1018939502485","volume":"22","author":"C. Cayrol","year":"1998","unstructured":"C. Cayrol, M. Lagasquie-Schiex, and T. Schiex. Nonmonotonic Reasoning: From Complexity to Algorithms. Ann. of Mathematics and Artificial Intelligence, 22(3\u20134):207\u2013236, 1998.","journal-title":"Ann. of Mathematics and Artificial Intelligence"},{"key":"27_CR5","unstructured":"S. Coste-Marquis and P. Marquis. Complexity Results for Paraconsistent Inference Relations. In Proc. KR-02, pages 61\u201372, 2002."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"J. Delgrande, T. Schaub, H. Tompits, and S. Woltran. On Computing Solutions to Belief Change Scenarios. In Proc. ECSQARU-01, pages 510\u2013521. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44652-4_45"},{"key":"27_CR7","unstructured":"U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In Proc. AAAI-00, pages 417\u2013422. AAAI Press, 2000."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. In Proc. TABLEAUX-02, 2002. To appear.","DOI":"10.1007\/3-540-45616-3_8"},{"key":"27_CR9","unstructured":"R. Feldmann, B. Monien, and S. Schamberger. ADistributedAlgorithm to Evaluate Quantifint Boolean Formula. In Proc. AAAI-00, pages 285\u2013290. AAAI Press, 2000."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proc. IJCAR-01, pages 364\u2013369. Springer Verlag, 2001.","DOI":"10.1007\/3-540-45744-5_27"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"G. Gottlob. Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation, 2(3):397\u2013425, 1992.","journal-title":"Journal of Logic and Computation"},{"issue":"1\u20132","key":"27_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0004-3702(94)90086-8","volume":"69","author":"G. Gottlob","year":"1994","unstructured":"G. Gottlob and Z. Mingyi. Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artificial Intelligence, 69(1\u20132):329\u2013345, 1994.","journal-title":"Artificial Intelligence"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, pages 306\u2013320. Springer Verlag, 2001.","DOI":"10.1007\/3-540-45329-6_31"},{"issue":"1\u20132","key":"27_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13(1\u20132):81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"27_CR15","unstructured":"H. Tompits. Expressing Default Abduction Problems as Quantified Boolean Formulas. In AI Communications, 2002. To appear."},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"C. Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1):23\u201333, 1976.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:47:27Z","timestamp":1548373647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}