Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic

International Journal of Approximate Reasoning

Volumn 51, Issue 3, 2010, Pages 346-362

  Dunin Kȩplicz, Barbara ^a,b   Nguyen, Linh Anh ^a   Szałas, Andrzej ^a,c  

^a UNIVERSITY OF WARSAW   (Poland)

^b INSTITUTE OF COMPUTER SCIENCE   (Poland)

^c LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Approximate database; Dynamic logic; Knowledge fusion; Rough sets; Similarity relation

Indexed keywords

DATABASE QUERYING; DOHERTY; DYNAMIC LOGIC; HETEROGENEOUS AGENTS; HETEROGENEOUS INFORMATION SOURCES; HORN FRAGMENTS; INFORMATION EXCHANGES; KNOWLEDGE FUSION; PROPOSITIONAL DYNAMIC LOGIC; ROUGH SET; SIMILARITY RELATIONS;

DATABASE SYSTEMS; DYNAMIC PROGRAMMING; GENE EXPRESSION; KNOWLEDGE MANAGEMENT; ROUGH SET THEORY;

FORMAL LOGIC;

EID: 76049104499     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2009.11.002     Document Type: Article

References (39)

1. In: Baader F., Calvanese D., McGuinness D.L., Nardi D., and Patel-Schneider P.F. (Eds). Description Logic Handbook (2002), Cambridge University Press
2. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press
3. Ciucci D., and Flaminio T. Generalized rough approximations in Π frac(1, 2). Int. J. Approx. Reason. 48 2 (2008) 544-558
4. Cormen T.H., Leiserson E.H., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), The MIT Press
5. Demri S.P., and Orłowska E.S. Incomplete Information: Structure, Inference, Complexity. Monographs in Theoretical Computer Science An EATCS Series (2002), Springer-Verlag, Heidelberg
6. Doherty P., Dunin-Kȩplicz B., and Szałas A. Dynamics of approximate information fusion. In: Kryszkiewicz M., Peters J., Rybinski H., and Skowron A. (Eds). Proceedings of the RSEISP 2007, Rough Sets and Emerging Intelligent Systems Paradigms. LNAI vol. 4585 (2007), Springer-Verlag 668-677
7. Doherty P., Łukaszewicz W., Skowron A., and Szałas A. Knowledge Representation Techniques. A Rough Set Approach. Studies in Fuziness and Soft Computing vol. 202 (2006), Springer-Verlag
8. Doherty P., Łukaszewicz W., and Szałas A. Communication between agents with heterogeneous perceptual capabilities. J. Inf. Fusion 8 1 (2007) 56-69
9. Doherty P., Magnusson M., and Szałas A. Approximate databases: a support tool for approximate reasoning. J. Appl. Non-Classical Logics 16 1-2 (2006) 87-118 Special issue on Implementation of logics
10. Doherty P., and Szałas A. On the correspondence between approximations and similarity. In: Tsumoto S., Slowinski R., Komorowski J., and Grzymala-Busse J.W. (Eds). Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing (RSCTC'2004). LNAI vol. 3066 (2004), Springer 143-152
11. Dubois V., and Quafafou M. Concept learning with approximation: Rough version spaces. In: Alpigini J.J., Peters J.F., Skowron A., and Zhong N. (Eds). Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing (RSCTC 2002). LNAI vol. 2475 (2002), Springer-Verlag 239-246
12. Dunin-Kȩplicz B., and Szałas A. Towards approximate BGI systems. In: Burkhard H.-D., Lindeman G., Varga L., and Verbrugge R. (Eds). Proceedings of the 5th International Central and Eastern European Conference on Multi-Agent Systems (CEEMAS 20 07). LNAI vol. 4696 (2007), Springer-Verlag 277-287
13. Dunin-Kȩplicz B., and Verbrugge R. Collective intentions. Fundam. Inform. 51 3 (2002) 271-295
14. Dunin-Kȩplicz B., and Verbrugge R. A tuning machine for cooperative problem solving. Fundam. Inform. 63 (2004) 283-307
15. Fagin R., Halpern J.Y., Moses Y., and Vardi M.Y. Reasoning about Knowledge (1995), MIT Press, Cambridge, MA
16. Harel D., Kozen D., and Tiuryn J. Dynamic Logic (2000), MIT Press
17. Hustadt U., Motik B., and Sattler U. Data complexity of reasoning in very expressive description logics. In: Kaelbling L.P., and Saffiotti A. (Eds). Proceedings of IJCAI-05 (2005), Professional Book Center 466-471
18. J. Komorowski, Z. Pawlak, L. Polkowski, A. Skowron, Rough sets: atutorial, in: Pal and Skowron [29], pp. 3-98.
19. K. Konolige, Belief and incompleteness, Technical Report 319, SRI Inter., 1984.
20. Li T.-J., Leung Y., and Zhang W.-X. Generalized fuzzy rough approximation operators based on fuzzy coverings. Int. J. Approx. Reason. 48 3 (2008) 836-856
21. Liu G., and Sai Y. A comparison of two types of rough sets induced by coverings. Int. J. Approx. Reason. 50 3 (2009) 521-528
22. J. Maluszyński, A. Szałas, A. Vitória, Paraconsistent logic programs with four-valued rough sets, in: C.-C. Chan, J. Grzymala-Busse, W. Ziarko (Eds.), Proceedings of 6th International Conference on Rough Sets and Current Trends in Computing (RSCTC 2008), LNAI, vol. 5306, pp. 41-51, 2008.
23. McCarthy J. First order theories of individual concepts and propositions. Mach. Intell. 9 (1979) 120-147
24. Meyer J.-J.Ch., and vander Hoek W. Epistemic Logic for AI and Theoretical Computer Science (1995), Cambridge University Press, Cambridge
25. Nguyen L.A. Multimodal logic programming. Theor. Comput. Sci. 360 (2006) 247-288
26. Nguyen L.A. On the deterministic Horn fragment of test-free PDL. In: Hodkinson I., and Venema Y. (Eds). Advances in Modal Logic vol. 6 (2006), King's College Publications 373-392
27. L.A. Nguyen, Weakening Horn knowledge bases in regular description logics to have PTIME data complexity, in: S. Ghilardi, U. Sattler, V. Sofronie-Stokkermans, A. Tiwari (Eds.), Proceedings of Automated Deduction: Decidability, Complexity, Tractability (ADDCT'07), 2007, pp. 32-47.
28. Nguyen L.A. Constructing finite least Kripke models for positive logic programs in serial regular grammar logics. Logic J. IGPL 16 2 (2008) 175-193
29. In: Pal S.K., and Skowron A. (Eds). Rough Fuzzy Hybridization: A New Trend in Decision-Making (1999), Springer-Verlag, Singapore
30. Pawlak Z. Rough Sets, Theoretical Aspects of Reasoning about Data (1991), Kluwer Academic Publishers, Dordrecht
31. Pawlak Z., and Skowron A. Rough sets and boolean reasoning. Inform. Sci. 177 1 (2007) 41-73
32. Pawlak Z., and Skowron A. Rough sets: some extensions. Inform. Sci. 177 1 (2007) 28-40
33. Pawlak Z., and Skowron A. Rudiments of rough sets. Inform. Sci. 177 1 (2007) 3-27
34. Skowron A., and Stepaniuk J. Tolerance approximation spaces. Fundam. Inform. 27 (1996) 245-253
35. Słowiński R., and Vanderpooten D. Similarity relation as a basis for rough approximations. In: Wang P. (Ed). Advances in Machine Intelligence & Soft Computing (1997), Bookwrights, Raleigh NC 17-33
36. Słowiński R., and Vanderpooten D. A generalized definition of rough approximations based on similarity. IEEE Trans. Data Knowl. Eng. 12 2 (2000) 331-336
37. van Benthem J. Correspondence theory. In: Gabbay D.M., and Guenthner F. (Eds). Handbook of Philosophical Logic vol. 2 (1984), D. Reidel Pub. Co. 167-247
38. Y.Y. Yao, Generalized rough set models, in: L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery, 1998, pp. 286-318.
39. Yao Y.Y., and Lin T.Y. Generalization of rough sets using modal logic. Intell. Autom. Soft Comput. - Int. J. 2 2 (1996) 103-120