Database repair by signed formulae

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2942, Issue , 2004, Pages 14-30

  Arieli, Ofer ^a   Denecker, Marc ^b   Van Nuffelen, Bert ^b   Bruynooghe, Maurice ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATABASE SYSTEMS; LOGIC PROGRAMMING; REPAIR;

COMPUTATIONAL MODEL; CONSTRAINT LOGIC PROGRAMS; CORRESPONDING SOLUTIONS; DATABASE REPAIRS; INCONSISTENT DATABASE; QUANTIFIED BOOLEAN FORMULAS;

BOOLEAN ALGEBRA;

EID: 35048903034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24627-5_3     Document Type: Article

References (27)

1. M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. Proc. 18th ACM Symp. on Principles of Database Systems (PODS'99), pp.68-79, 1999.
2. O. Arieli and M. Denecker. Modeling paraconsistent reasoning by classical logic. Proc. 2nd Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), T. Eiter and K.D. Schewe, editors, LNCS 2284, Springer, pp.1-14, 2002.
3. O. Arieli and M. Denecker. Reducing preferential paraconsistent reasoning to classical entailment. Journal of Logic and Computation 13(4), pp.557-580, 2003.
4. O. Arieli, B. Van Nuffelen, M. Denecker, and M. Bruynooghe. Coherent composition of distributed knowledge-bases through abduction. Proc. 8th Int. Conf. on Logic Programming, Artificial Intelligence and Reasoning (LPAR'01), A. Nieuwenhuis and A. Voronkov, editors, LNCS 2250, Springer, pp.620-635, 2001.
5. A. Ayari and D. Basin. QUBOS: Deciding quantified Boolean logic using prepositional satisfiability solvers. Proc. 4th Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02), M.D. Aagaard and J.W. O'Leary, editors, LNCS 2517, Springer, pp.187-201, 2002.
6. P. Besnard, T. Schaub. Signed systems for paraconsistent reasoning. Journal of Automated Reasoning 20(1), pp.191-213, 1998.
7. P. Besnard, T. Schaub, H. Tompits, and S. Woltran. Paraconsistent reasoning via quantified Boolean formulas, part I: Axiomatizing signed systems. Proc. 8th European Conf. on Logics in Artificial Intelligence (JELIA'02), S. Flesca et al., editors, LNAI 2424, Springer, pp.320-331, 2002.
8. P. Besnard, T. Schaub, H. Tompits, and S. Woltran. Paraconsistent reasoning via quantified Boolean formulas, part II: Circumscribing inconsistent theories. Proc. 7th European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'03), T.D. Nielsen and N.L. Zhang, editors, LNAI 2711, Springer, pp.528-539, 2003.
9. L. Bertossi, J. Chomicki, A. Cortes, and C. Gutierrez. Consistent answers from integrated data sources. Proc. Flexible Query Answering Systems (FQAS'2002), A. Andreasen et al., editors, LNCS 2522, Springer, pp.71-85, 2002.
10. L. Bertossi and C. Schwind. Analytic tableau and database repairs: Foundations. Proc. 2nd Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), T. Eiter and K.D. Schewe, editors, LNCS 2284, Springer, pp.32-48, 2002.
11. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Automated Reasoning 28(2), pp.101-142, 2002.
12. M. Carlsson, G. Ottosson and B. Carlson. An open-ended finite domain constraint solver, Proc. 9th Int. Symp. on Programming Languages, Implementations, Logics, and Programs (PLILP'97), LNCS 1292, Springer, 1997.
13. M. Dalal. Investigations into a theory of knowledge base revision. Proc. National Conference on Artificial Intelligence (AAAI'98), AAAI Press, pp.475-479, 1988.
14. S. de Amo, W. Carnielli, and J. Marcos. A logical framework for integrating inconsistent information in multiple databases. Proc. 2nd Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS'02), T. Eiter and K.D. Schewe, editors, LNCS 2284, Springer, pp.67-84, 2002.
15. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR system dlv: Progress report, comparisons and benchmarks. Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98), Morgan Kaufmann Publishers, pp.406-417, 1998.
16. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving advanced reasoning tasks using quantified Boolean formulas. Proc. National Conf. on Artificial Intteligence (AAAI'00), AAAI Press, pp.417-422, 2000.
17. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified Boolean formulae. Proc. National Conf. on Artificial Intteligence (AAAI'00), AAAI Press, pp. 285-290, 2000.
18. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A system for deciding quantified Boolean formulas satisfiability. Proc. 1st Int. Conf. on Automated Reasoning (IJCAR'01), R. Gor, A. Leitsch, and T. Nipkow, editors, LNCS 2083, Springer, pp.364-369, 2001.
19. S. Greco and E. Zumpano. Querying inconsistent databases. Proc. Int. Conf. on Logic Programming and Automated Reasoning (LPAR'2000), M. Parigot and A. Voronkov, editors, LNAI 1955, Springer, pp.308-325, 2000.
20. G. Greco, S. Greco, and E. Zumpano. A logic programming approach to the integration, repairing and querying of inconsistent databases. Proc. 17th Int. Conf. on Logic Programming (ICLP'01), LNCS 2237, Springer, pp.348-363, 2001.
21. H. Kleine-Büning, M. Karpinski, and A. Fögel. Resolution for quantified Boolean formulas. Journal of Information and Computation 177(1), pp.12-18, 1995.
22. R. Letz. Lemma and model caching in decision procedures for quantified Boolean formulas. Proc. TABLEAUX'2002, U. Egly and G.C. Fermüler, editors, LNAI 2381, pp.160-175, 2002.
23. P. Liberatore and M. Schaerf. BReLS: A system for the integration of knowledge bases. Proc Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'2000), Morgan Kaufmann Publishers, pp.145-152, 2000.
24. J.McCarthy. Applications of circumscription to formalizing common-Sense knowledge. Artificial Intelligence 28, pp.89-116, 1986.
25. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. Proc. 39th Design Automation Conference, 2001.
26. J.T. Rintanen. Improvements of the evaluation of quantified Boolean formulae. Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), Morgan Kaufmann Publishers, pp.1192-1197. 1999.
27. C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science 3(1), pp.23-33, 1976.