{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:27:27Z","timestamp":1725564447509},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540209652"},{"type":"electronic","value":"9783540246275"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24627-5_3","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T11:27:13Z","timestamp":1283686033000},"page":"14-30","source":"Crossref","is-referenced-by-count":14,"title":["Database Repair by Signed Formulae"],"prefix":"10.1007","author":[{"given":"Ofer","family":"Arieli","sequence":"first","affiliation":[]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[]},{"given":"Bert","family":"Van Nuffelen","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. 18th ACM Symp. on Principles of Database Systems (PODS 1999), pp. 68\u201379 (1999)","DOI":"10.1145\/303976.303983"},{"key":"3_CR2","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)"},{"issue":"4","key":"3_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":"3_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/3-540-45653-8_43","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"O. Arieli","year":"2001","unstructured":"Arieli, O., Van Nuffelen, B., Denecker, M., Bruynooghe, M.: Coherent composition of distributed knowledge-bases through abduction. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 620\u2013635. Springer, Heidelberg (2001)"},{"key":"3_CR5","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)"},{"issue":"1","key":"3_CR6","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), 191\u2013213 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR7","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, part I: Axiomatizing 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":"3_CR8","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, part 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":"3_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-36109-X_6","volume-title":"Flexible Query Answering Systems","author":"L. Bertossi","year":"2002","unstructured":"Bertossi, L., Chomicki, J., Cortes, A., Gutierrez, C.: Consistent answers from integrated data sources. In: Andreasen, T., Motro, A., Christiansen, H., Larsen, H.L. (eds.) FQAS 2002. LNCS (LNAI), vol.\u00a02522, pp. 71\u201385. Springer, Heidelberg (2002)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-45758-5_3","volume-title":"Foundations of Information and Knowledge Systems","author":"L. Bertossi","year":"2002","unstructured":"Bertossi, L., Schwind, C.: Analytic tableau and database repairs: Foundations. In: Eiter, T., Schewe, K.-D. (eds.) FoIKS 2002. LNCS, vol.\u00a02284, pp. 32\u201348. Springer, Heidelberg (2002)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An Algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Automated Reasoning\u00a028(2), 101\u2013142 (2002)","journal-title":"Automated Reasoning"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, Springer, Heidelberg (1997)"},{"key":"3_CR13","first-page":"475","volume-title":"Proc. National Conference on Artificial Intelligence (AAAI 1998)","author":"M. Dalal","year":"1988","unstructured":"Dalal, M.: Investigations into a theory of knowledge base revision. In: Proc. National Conference on Artificial Intelligence (AAAI 1998), pp. 475\u2013479. AAAI Press, Menlo Park (1988)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45758-5_5","volume-title":"Foundations of Information and Knowledge Systems","author":"S. Amo de","year":"2002","unstructured":"de Amo, S., Carnielli, W., Marcos, J.: A logical framework for integrating inconsistent information in multiple databases. In: Eiter, T., Schewe, K.-D. (eds.) FoIKS 2002. LNCS, vol.\u00a02284, pp. 67\u201384. Springer, Heidelberg (2002)"},{"key":"3_CR15","first-page":"406","volume-title":"Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 1998)","author":"T. Eiter","year":"1998","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: Progress report, comparisons and benchmarks. In: Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 406\u2013417. Morgan Kaufmann Publishers, San Francisco (1998)"},{"key":"3_CR16","first-page":"417","volume-title":"Proc. National Conf. on Artificial Intteligence (AAAI 2000)","author":"U. Egly","year":"2000","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified Boolean formulas. In: Proc. National Conf. on Artificial Intteligence (AAAI 2000), pp. 417\u2013422. AAAI Press, Menlo Park (2000)"},{"key":"3_CR17","first-page":"285","volume-title":"Proc. National Conf. on Artificial Intteligence (AAAI 2000)","author":"R. Feldmann","year":"2000","unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate quantified Boolean formulae. In: Proc. National Conf. on Artificial Intteligence (AAAI 2000), pp. 285\u2013290. AAAI Press, Menlo Park (2000)"},{"key":"3_CR18","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":"3_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-44404-1_20","volume-title":"Logic for Programming and Automated Reasoning","author":"S. Greco","year":"2000","unstructured":"Greco, S., Zumpano, E.: Querying inconsistent databases. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 308\u2013325. Springer, Heidelberg (2000)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45635-X_31","volume-title":"Logic Programming","author":"G. Greco","year":"2001","unstructured":"Greco, G., Greco, S., Zumpano, E.: A logic programming approach to the integration, repairing and querying of inconsistent databases. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 348\u2013363. Springer, Heidelberg (2001)"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"177","author":"H. Kleine-B\u00fcning","year":"1995","unstructured":"Kleine-B\u00fcning, H., Karpinski, M., F\u00f6gel, A.: Resolution for quantified Boolean formulas. Journal of Information and Computation\u00a0177(1), 12\u201318 (1995)","journal-title":"Journal of Information and Computation"},{"key":"3_CR22","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":"3_CR23","first-page":"145","volume-title":"Proc Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000)","author":"P. Liberatore","year":"2000","unstructured":"Liberatore, P., Schaerf, M.: BReLS: A system for the integration of knowledge bases. In: Proc Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000), pp. 145\u2013152. Morgan Kaufmann Publishers, 145\u2013152 (2000)"},{"key":"3_CR24","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"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. 39th Design Automation Conference (2001)","DOI":"10.1145\/378239.379017"},{"key":"3_CR26","first-page":"1192","volume-title":"Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999)","author":"J.T. Rintanen","year":"1999","unstructured":"Rintanen, J.T.: Improvements of the evaluation of quantified Boolean formulae. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999), pp. 1192\u20131197. Morgan Kaufmann Publishers, San Francisco (1999)"},{"issue":"1","key":"3_CR27","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"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24627-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:19:34Z","timestamp":1553044774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24627-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540209652","9783540246275"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24627-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}