{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:14Z","timestamp":1761611174279},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10472-005-9012-z","type":"journal-article","created":{"date-parts":[[2006,2,24]],"date-time":"2006-02-24T12:53:36Z","timestamp":1140785616000},"page":"4-37","source":"Crossref","is-referenced-by-count":10,"title":["Computational methods for database repair by signed formulae*"],"prefix":"10.1007","volume":"46","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","published-online":{"date-parts":[[2006,2,24]]},"reference":[{"key":"9012_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C.E. Alchourr\u00f3n","year":"1985","unstructured":"C.E. Alchourr\u00f3n, P. G\u00e4rdenfors and D. Makinson, On the logic of theory change: Partial meet contraction and revision function, Journal of Symbolic Logic 50 (1985) 510\u2013530.","journal-title":"Journal of Symbolic Logic"},{"key":"9012_CR2","unstructured":"J.J. Alferes, J.A. Leite, L.M. Pereira and P. Quaresma, Planning as abductive updating, in: Proc. of the Symposium on AI Planning and Intelligent Agents (AISB'00) (2000) pp. 1\u20138."},{"issue":"1\u20132","key":"9012_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0004-3702(02)00183-2","volume":"138","author":"J.J. Alferes","year":"2002","unstructured":"J.J. Alferes, L.M. Pereira, H. Przymusinska and T.C. Przymusinski, LUPS \u2013 A language for updating logic programs, Artificial Intelligence 138(1\u20132) (2002) 87\u2013116.","journal-title":"Artificial Intelligence"},{"key":"9012_CR4","doi-asserted-by":"crossref","unstructured":"M. Arenas, L. Bertossi and J. Chomicki, Consistent query answers in inconsistent databases, in: Proc. 18th ACM Symp. on Principles of Database Systems (PODS'99) (1999) pp. 68\u201379.","DOI":"10.1145\/303976.303983"},{"issue":"4\u20135","key":"9012_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1017\/S1471068403001832","volume":"3","author":"M. Arenas","year":"2003","unstructured":"M. Arenas, L. Bertossi and J. Chomicki, Answer sets for consistent query answering in inconsistent databases, Theory and Practice of Logic Programming 3(4\u20135) (2003) 393\u2013424.","journal-title":"Theory and Practice of Logic Programming"},{"key":"9012_CR6","unstructured":"O. Arieli, Paraconsistent preferential reasoning by signed quantified Boolean formulae, in: Proc. 16th European Conference on Artificial Intelligence (ECAI'04), eds. R. L\u00f3pez de M\u00e1ntaras and L. Saitta (IOS, 2004) pp. 773\u2013777."},{"key":"9012_CR7","doi-asserted-by":"crossref","unstructured":"O. Arieli and M. Denecker, Modeling paraconsistent reasoning by classical logic, in: Proc. 2nd Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), eds. T. Eiter and K.D. Schewe, LNCS 2284 (Springer, 2002) pp. 1\u201314.","DOI":"10.1007\/3-540-45758-5_1"},{"issue":"4","key":"9012_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1093\/logcom\/13.4.557","volume":"13","author":"O. Arieli","year":"2003","unstructured":"O. Arieli and M. Denecker, Reducing preferential paraconsistent reasoning to classical entailment, Journal of Logic and Computation 13(4) (2003) 557\u2013580.","journal-title":"Journal of Logic and Computation"},{"key":"9012_CR9","doi-asserted-by":"crossref","unstructured":"O. Arieli, M. Denecker, B. Van Nuffelen and M. Bruynooghe, Database repair by signed formulae, in: Proc. 3rd International Symposium on Foundations of Information and Knowledge Systems (FoIKS'04), eds. D. Seipel and J.M. Turull Torres, LNCS 2942 (Springer, 2004) pp. 14\u201330.","DOI":"10.1007\/978-3-540-24627-5_3"},{"key":"9012_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1613\/jair.1322","volume":"21","author":"O. Arieli","year":"2004","unstructured":"O. Arieli, M. Denecker, B. Van Nuffelen and M. Bruynooghe, Coherent integration of databases by abductive logic programming, Journal of Artificial Intelligence Research 21 (2004) 245\u2013286.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9012_CR11","doi-asserted-by":"crossref","unstructured":"O. Arieli, B. Van Nuffelen, M. Denecker and M. Bruynooghe, Coherent composition of distributed knowledge-bases through abduction, in: Proc. 8th Int. Conf. on Logic Programming, Artificial Intelligence and Reasoning (LPAR'01), eds. A. Nieuwenhuis and A. Voronkov, LNCS 2250 (Springer, 2001) pp. 620\u2013635.","DOI":"10.1007\/3-540-45653-8_43"},{"key":"9012_CR12","doi-asserted-by":"crossref","unstructured":"A. Ayari and D. Basin, QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers, in: Proc. 4th Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02), eds. M.D. Aagaard and J.W. O'Leary, LNCS 2517 (Springer, 2002) pp. 187\u2013201.","DOI":"10.1007\/3-540-36126-X_12"},{"issue":"2","key":"9012_CR13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/69.88001","volume":"3","author":"C. Baral","year":"1991","unstructured":"C. Baral, S. Kraus and J. Minker, Combining multiple knowledge bases, IEEE Transactions on Knowledge and Data Engineering 3(2) (1991) 208\u2013220.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9012_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1467-8640.1992.tb00337.x","volume":"8","author":"C. Baral","year":"1992","unstructured":"C. Baral, S. Kraus, J. Minker and V.S. Subrahmanain, Combining multiple knowledge bases consisting of first order theories, Computational Intelligence 8 (1992) 45\u201371.","journal-title":"Computational Intelligence"},{"issue":"4","key":"9012_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/27633.27634","volume":"18","author":"C. Batini","year":"1986","unstructured":"C. Batini, M. Lenzerini and B.B. Navathe, A comparative analysis of methodologies for database schema integration, ACM Computing Surveys 18(4) (1986) 323\u2013364.","journal-title":"ACM Computing Surveys"},{"issue":"1\u20133","key":"9012_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1014446411602","volume":"34","author":"S. Benferhat","year":"2002","unstructured":"S. Benferhat, D. Dubois, S. Kaci and H. Prade, Possibilistic merging and distance-based fusion of propositional information, Annals of Mathematics and Artificial Intelligence 34(1\u20133) (2002) 217\u2013252.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9012_CR17","doi-asserted-by":"crossref","unstructured":"L. Bertossi, J. Chomicki, A. Cort\u00e9s and C. Gutierrez, Consistent answers from integrated data sources, in: Proc. Flexible Query Answering Systems (FQAS'2002), eds. A. Andreasen et al., LNCS 2522 (Springer, 2002) pp. 71\u201385.","DOI":"10.1007\/3-540-36109-X_6"},{"key":"9012_CR18","doi-asserted-by":"crossref","unstructured":"L. Bertossi and C. Schwind, Analytic tableau and database repairs: Foundations, in: Proc. 2nd Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), eds. T. Eiter and K.D. Schewe, LNCS 2284 (Springer, 2002) pp. 32\u201348.","DOI":"10.1007\/3-540-45758-5_3"},{"issue":"1","key":"9012_CR19","doi-asserted-by":"crossref","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(1) (1998) 191\u2013213.","journal-title":"Journal of Automated Reasoning"},{"key":"9012_CR20","doi-asserted-by":"crossref","unstructured":"P. Besnard, T. Schaub, H. Tompits and S. Woltran, Paraconsistent reasoning via quantified Boolean formulas, part I: Axiomatizing signed systems, in: Proc. 8th European Conf. on Logics in Artificial Intelligence (JELIA'02), eds. S. Flesca et al., LNAI 2424 (Springer, 2002) pp. 320\u2013331.","DOI":"10.1007\/3-540-45757-7_27"},{"key":"9012_CR21","doi-asserted-by":"crossref","unstructured":"P. Besnard, T. Schaub, H. Tompits and S. Woltran, Paraconsistent reasoning via quantified Boolean formulas, part II: Circumscribing inconsistent theories, in: Proc. 7th European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'03), eds. T.D. Nielsen and N.L. Zhang, LNAI 2711 (Springer, 2003) pp. 528\u2013539.","DOI":"10.1007\/978-3-540-45062-7_43"},{"issue":"2","key":"9012_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"M. Cadoli, M. Schaerf, A. Giovanardi and M. Giovanardi, An Algorithm to evaluate quantified Boolean formulae and its experimental evaluation, Automated Reasoning 28(2) (2002) 101\u2013142.","journal-title":"Automated Reasoning"},{"key":"9012_CR23","doi-asserted-by":"crossref","unstructured":"M. Carlsson, G. Ottosson and B. Carlson, An open-ended finite domain constraint solver, in: Proc. 9th Int. Symp. on Programming Languages, Implementations, Logics, and Programs (PLILP'97), LNCS 1292 (Springer, 1997) pp. 191\u2013206.","DOI":"10.1007\/BFb0033845"},{"key":"9012_CR24","doi-asserted-by":"crossref","unstructured":"S.H. Nienhuys\u2013Cheng, Distance between Herbrand interpretations: A measure for approximations to a target concept, in: Proc. 7th Int. Workshop on Inductive Logic Programming (ILP'97), LNCS 1297 (Springer, 1997) pp. 213\u2013226.","DOI":"10.1007\/3540635149_50"},{"key":"9012_CR25","unstructured":"M. Dalal, Investigations into a theory of knowledge base revision, in: Proc. National Conference on Artificial Intelligence (AAAI'98) (AAAI Press, 1988) pp. 475\u2013479."},{"key":"9012_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(96)00038-0","volume":"89","author":"A. Darwiche","year":"1997","unstructured":"A. Darwiche and J. Pearl, On the logic of iterated belief revision, Artificial Intelligence 89 (1997) 1\u201329.","journal-title":"Artificial Intelligence"},{"key":"9012_CR27","doi-asserted-by":"crossref","unstructured":"S. de Amo, W. Carnielli and J. Marcos, A logical framework for integrating inconsistent information in multiple databases, in: Proc. 2nd Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), eds. T. Eiter and K.D. Schewe, LNCS 2284 (Springer, 2002) pp. 67\u201384.","DOI":"10.1007\/3-540-45758-5_5"},{"key":"9012_CR28","doi-asserted-by":"crossref","unstructured":"J. Delgrande and T. Schaub, Two approaches to merging knowledge bases, in: Proc. 9th European Conference on Logic in Artificial Intelligence (JELIA'04), LNCS 3229 (Springer, 2004) pp. 426\u2013438.","DOI":"10.1007\/978-3-540-30227-8_36"},{"issue":"6","key":"9012_CR29","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1093\/logcom\/14.6.801","volume":"14","author":"J. Delgrande","year":"2004","unstructured":"J. Delgrande, T. Schaub, H. Tompits and S. Woltran, On computing belief change operations using quantified Boolean formulas, Journal of Logic and Computation 14(6) (2004) 801\u2013826.","journal-title":"Journal of Logic and Computation"},{"key":"9012_CR30","unstructured":"U. Egly, T. Eiter, H. Tompits and S. Woltran, Solving advanced reasoning tasks using quantified Boolean formulas, in: Proc. National Conf. on Artificial Intelligence (AAAI'00) (AAAI, 2000) pp. 417\u2013422."},{"key":"9012_CR31","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, The KR system dlv: Progress report, comparisons and benchmarks, in: Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98) (Morgan Kaufmann, 1998) pp. 406\u2013417."},{"key":"9012_CR32","unstructured":"R. Feldmann, B. Monien and S. Schamberger, A distributed algorithm to evaluate quantified Boolean formulae, in: Proc. National Conf. on Artificial Intelligence (AAAI'00) (AAAI, 2000) pp. 285\u2013290."},{"key":"9012_CR33","doi-asserted-by":"crossref","unstructured":"E. Franconi, A.L. Palma, N. Leone, D. Perri and F. Scarcello, Census data repair: A challenging application of disjunctive logic programming, in: Proc. 8th Internations Conference on Logic Programming, Artificial Intelligence and Reasoning (LPAR'01), eds. A. Nieuwenhuis and A. Voronkov, LNCS 2250 (Springer, 2001) pp. 561\u2013578.","DOI":"10.1007\/3-540-45653-8_39"},{"key":"9012_CR34","doi-asserted-by":"crossref","unstructured":"D. Gabbay, O. Rodrigues and A. Russo, Revision by translation, in: Information, Uncertainty, and Fusion, eds. B. Bouchon-Meunier, R.R. Yager and L. Zadeh (Kluwer, 2000) pp. 3\u201332.","DOI":"10.1007\/978-1-4615-5209-3_1"},{"key":"9012_CR35","doi-asserted-by":"crossref","unstructured":"E. Giunchiglia, M. Narizzano and A. Tacchella, QuBE: A system for deciding quantified Boolean formulas satisfiability, in: Proc. 1st Int. Conf. on Automated Reasoning (IJCAR'01), eds. R. Gor, A. Leitsch and T. Nipkow, LNCS 2083 (Springer, 2001) pp. 364\u2013369.","DOI":"10.1007\/3-540-45744-5_27"},{"key":"9012_CR36","doi-asserted-by":"crossref","unstructured":"G. Greco, S. Greco and E. Zumpano, A logic programming approach to the integration, repairing and querying of inconsistent databases, in: Proc. 17th Int. Conf. on Logic Programming (ICLP'01), LNCS 2237 (Springer, 2001) pp. 348\u2013363.","DOI":"10.1007\/3-540-45635-X_31"},{"key":"9012_CR37","doi-asserted-by":"crossref","unstructured":"S. Greco and E. Zumpano, Querying inconsistent databases, in: Proc. Int. Conf. on Logic Programming and Automated Reasoning (LPAR'2000), eds. M. Parigot and A. Voronkov, LNAI 1955 (Springer, 2000) pp. 308\u2013325.","DOI":"10.1007\/3-540-44404-1_20"},{"key":"9012_CR38","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(91)90069-V","volume":"52","author":"H. Katsuno","year":"1991","unstructured":"H. Katsuno and A.O. Mendelzon. Propositional knowledge base revision and minimal change, Artificial Intelligence 52 (1991) 263\u2013294.","journal-title":"Artificial Intelligence"},{"key":"9012_CR39","doi-asserted-by":"crossref","unstructured":"G. Kern-Isberner, The principle of conditional preservation in belief revision, in: Proc. 2nd Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), eds. T. Eiter and K.D. Schewe, LNCS 2284 (Springer, 2002) pp. 105\u2013129.","DOI":"10.1007\/3-540-45758-5_8"},{"issue":"1\u20132","key":"9012_CR40","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1026110129951","volume":"40","author":"G. Kern-Isberner","year":"2004","unstructured":"G. Kern-Isberner, A thorough axiomatization of a principle of conditional preservation in belief revision, Annals of Mathematics and Artificial Intelligence 40(1\u20132) (2004) 127\u2013164.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"9012_CR41","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"177","author":"H. Kleine-B\u00fcning","year":"1995","unstructured":"H. Kleine-B\u00fcning, M. Karpinski and A. F\u00f6gel, Resolution for quantified Boolean formulas, Journal of Information and Computation 177(1) (1995) 12\u201318.","journal-title":"Journal of Information and Computation"},{"issue":"5","key":"9012_CR42","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1093\/logcom\/12.5.773","volume":"12","author":"S. Konieczny","year":"2002","unstructured":"S. Konieczny and R. Pino P\u00e9rez, Merging information under constraints: A logical framework, Journal of Logic and Computation 12(5) (2002) 773\u2013808.","journal-title":"Journal of Logic and Computation"},{"key":"9012_CR43","doi-asserted-by":"crossref","unstructured":"R. Letz, Lemma and model caching in decision procedures for quantified Boolean formulas, in: Proc. TABLEAUX'2002, eds. U. Egly and G.C. Ferm\u00fcler, LNAI 2381 (Springer, 2002) pp. 160\u2013175.","DOI":"10.1007\/3-540-45616-3_12"},{"key":"9012_CR44","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/69.667090","volume":"10","author":"P. Liberatore","year":"1998","unstructured":"P. Liberatore and M. Schaerf, Arbitration (or how to merge knowledge bases), IEEE Transactions on Knowledge and Data Engineering 10 (1998) 76\u201390.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9012_CR45","unstructured":"P. Liberatore and M. Schaerf, BReLS: A system for the integration of knowledge bases, in: Proc Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'2000) (Morgan Kaufmann, 2000) pp. 145\u2013152."},{"key":"9012_CR46","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0004-3702(95)00019-4","volume":"83","author":"J. Lin","year":"1996","unstructured":"J. Lin, Integration of weighted knowledge bases, Artificial Intelligence 83 (1996) 363\u2013378.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9012_CR47","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0218843098000040","volume":"7","author":"J. Lin","year":"1998","unstructured":"J. Lin and A.O. Mendelzon, Merging databases under constraints International Journal of Cooperative Information Systems 7(1) (1998) 55\u201376.","journal-title":"International Journal of Cooperative Information Systems"},{"key":"9012_CR48","doi-asserted-by":"crossref","unstructured":"C.A. Mareco and L. Bertossi, Specification and implementation of temporal databases in a bitemporal event calculus, in: Advance in Conceptual Modeling, LNCS 1727 (Springer, 1999) pp. 74\u201385.","DOI":"10.1007\/3-540-48054-4_7"},{"key":"9012_CR49","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence 28 (1986) 89\u2013116.","journal-title":"Artificial Intelligence"},{"key":"9012_CR50","doi-asserted-by":"crossref","unstructured":"M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, in: Proc. 39th Design Automation Conference (DAC'01) (2001) pp. 530\u2013535.","DOI":"10.1145\/378239.379017"},{"issue":"4","key":"9012_CR51","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s007780100057","volume":"10","author":"E. Rahm","year":"2001","unstructured":"E. Rahm and P.A. Bernstein. A survey of approaches to automatic schema matching, VLDB Journal 10(4) (2001) 334\u2013350.","journal-title":"VLDB Journal"},{"issue":"10","key":"9012_CR52","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/PL00013304","volume":"37","author":"J. Ramon","year":"2001","unstructured":"J. Ramon and M. Bruynooghe, A polynomial time computable metric between point sets, Acta Informatica 37(10) (2001) 765\u2013780.","journal-title":"Acta Informatica"},{"key":"9012_CR53","doi-asserted-by":"crossref","unstructured":"R. Reiter, On closed world databases, in: Logic and Databases, eds. H. Gallaire and J. Minker (Plenum, 1978) pp. 55\u201376.","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"9012_CR54","unstructured":"J.T. Rintanen, Improvements of the evaluation of quantified Boolean formulae, in: Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99) (Morgan Kaufmann, 1999) pp. 1192\u20131197."},{"issue":"6","key":"9012_CR55","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1017\/S1471068403001716","volume":"3","author":"C. Sakama","year":"2003","unstructured":"C. Sakama and K. Inou, An abductive framework for computing knowledge base updates, Theory and Practice of Logic Programming 3(6) (2003) 671\u2013715.","journal-title":"Theory and Practice of Logic Programming"},{"key":"9012_CR56","unstructured":"S.M. Sripada, Efficient implementation of the event calculus for temporal database applications, in: Proc. Int. Conf. on Logic Programming (ICLP'95) (1995) pp. 99\u2013113."},{"issue":"2","key":"9012_CR57","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/176567.176571","volume":"19","author":"V.S. Subrahmanian","year":"1994","unstructured":"V.S. Subrahmanian, Amalgamating knowledge-bases, ACM Transactions on Database Systems 19(2) (1994) 291\u2013331.","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"9012_CR58","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0304-3975(99)00219-4","volume":"239","author":"J. Ullman","year":"2000","unstructured":"J. Ullman, Information integration using logical views, Theoretical Computer Science 239(2) (2000) 189\u2013210.","journal-title":"Theoretical Computer Science"},{"key":"9012_CR59","doi-asserted-by":"crossref","unstructured":"B. Van Nuffelen, A. Cort\u00e9s-Calabuig, M. Denecker, O. Arieli and M. Bruynooghe, Data integration using ID-logic, in: Proc. 16th Int. Conf. on Advanced Information Systems Engineering (CAiSE'04), LNCS 3084 (Springer, 2004) pp. 67\u201381.","DOI":"10.1007\/978-3-540-25975-6_7"},{"issue":"1","key":"9012_CR60","doi-asserted-by":"crossref","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) (1976) 23\u201333.","journal-title":"Theoretical Computer Science"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-9012-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-005-9012-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-9012-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:51:49Z","timestamp":1559152309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-005-9012-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":60,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["9012"],"URL":"https:\/\/doi.org\/10.1007\/s10472-005-9012-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}