Abstract
The data integration of a number of local heterogeneous databases, with possible conflicting, mutually inconsistent, information, coming from different places, is an increasingly important issue. In order to avoid such inconsistency, a number of current in-practice developed database systems are based on different software and architectural paradigms, and are specified a number of embedded ad-hoc algorithms for a kind of preferred query-answering w.r.t. some preordering. The query-answering to conjunctive queries is usually performed in two consecutive steps: first are obtained certain answers from the underlying DBMS system, and successively is applied a filtering software, based on particular user-written algorithms, in order to obtain a ‘best subset’ of answers. Thus, the obtained resulting answers does not correspond to the original user’s query: to which kind of logic formula the obtained answers correspond was an open problem. In this paper we show that such bivalent database/software-algorithm paradigm can be unified in an equivalent Abstract Object Type (AOT) database with a partial order, and that the query formula which returns with the same answers, as the answers to a conjunctive query of the original database/softwarealgorithm, is a modal logic formula.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beckert, B., Hanhle, R., Manyá, F.: Transformations between signed and classical clause logic. In: Proc. 29th Int.Symposium on Multiple-Valued Logics, Freiburg, Germany, pp. 248–255 (1999)
Bertolazzi, P., Santis, L.D., Scannapieco, M.: Automatic Record Matching in Cooperative Information Systems. In: Proceedings of the ICDT 2003 International Workshop on Data Quality in Cooperative Information Systems (DQCIS 2003), Siena, Italy (2003)
Jacobs, B.: Towards a duality result in coalgebraic modal logic. In: Reichel, H. (ed.) Coalgebraic Methods in computer science. Elec. Notes in Theor. Comp. Sci., vol. 33 (2000)
Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. Theoretical Informatics and Applications 35(1), 31–59 (2001)
Lembo, D., Lenzerini, M., Rosati, R.: Source inconsistency and incompleteness in data integration. In: Proc. of the 9th Int.Workshop on Knowledge Representation meets Databases (KRDB 2002) CEUR (2002)
Greco, G., Greco, S., Zampano, E.: A logic programming approach to the integration, repairing and querying of inconsistent databases. In: Proc. of the 17th Int. Conf. on Logic Programming, vol. 2237, pp. 348–364 (2001)
Blair, H.A., Subrahmanian, V.S.: Paraconsistent logic programming. Theoretical Computer Science 68, 135–154 (1989)
Imaz, G., Manyá, F.: The satisfiability problem for multiple-valued horn formulae. In: Proc. International Symposium on Multiple-Valued Logics (ISMVL), Boston, pp. 250–256. IEEE Press, Los Alamitos (1994)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 10(8) (1966)
Moss, L.S.: Coalgebraic logic. Annals of Pure and Applied Logic 96, 277–317 (1999)
Maier, D., Ullman, J.D., Vardi, M.Y.: On the foundations of the universal relation model. ACM Trans. Database Syst. 9, 283–308 (1984)
Majkić, Z.: Coalgebraic semantics for logic programming. In: 18th Worshop on (Constraint) Logic Programming, WLP 2004, March 04-06, Berlin, Germany (2004)
Majkić, Z.: Database mappings and partial trees derived from abstract object type. Notes in (2004), http://www.dis.uniroma1.it/~majkic/
Majkić, Z.: General framework for query answering in data quality cooperative information systems. In: International Workshop on Information Quality in Information Systems (IQIS), June 18, Paris, France (2004)
Majkić, Z.: Meta many-valued logic programming for incomplete and locally inconsistent databases. In: 8th International Database Engineering and Application Symposium (IDEAS),July 7-9, Coimbra, Portugal (2004)
Majkić, Z.: Ontological encapsulation of many-valued logic. In: 19th Italian Symposium of Computational Logic (CILC 2004),June 16-17, Parma, Italy (2004)
Fitting, M.C.: Billatices and the semantics of logic programming. Journal of Logic Programming 11, 91–116 (1991)
Mecella, M., Scannapieco, M., Virgillito, A., Baldoni, R., Catarci, T., Batini, C.: Managing Data Quality in Cooperative Information Systems. Journal of Data Semantics (2003) (to appear)
Ginsberg, M.: Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computational Intelligence 4, 265–316 (1988)
Kifer, M., Lozinskii, E.L.: A logic for reasoning with inconsistency. Journal of Automated reasoning 9(2), 179–215 (1992)
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. Journal of Logic Programming 12(4), 335–368 (1992)
Lenzerini, M.: Data integration:a theoretical perspective. pp. 233–246 (2002)
Reiter, R.: What should a database know? Journal of Logic Programming 14, 127–153 (1990)
Hahnle, R.: Automated deduction in multiple-valued logics. Oxford University Press, Oxford (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Majkić, Z. (2004). Modal Query Language for Databases with Partial Orders. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30468-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-30468-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23663-4
Online ISBN: 978-3-540-30468-5
eBook Packages: Springer Book Archive