Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and these in turn are used to define approximate sets and relations. In any of the approaches, one would like to embed such relations in an appropriate logic which can be used as a reasoning engine for specific applications with specific constraints. We propose a framework which permits a formal study of the relationship between approximate relations, similarity spaces and three-valued logics. Using ideas from correspondence theory for modal logics and constraints on an accessibility relation, we develop an analogous framework for three-valued logics and constraints on similarity relations. In this manner, we can provide a tool which helps in determining the proper three-valued logical reasoning engine to use for different classes of approximate relations generated via specific types of similarity spaces. Additionally, by choosing a three-valued logic first, the framework determines what constraints would be required on a similarity relation and the approximate relations induced by it. Such information would guide the generation of approximate relations for specific applications.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
179--193
Opis fizyczny
bibliogr. 24 poz.
Twórcy
autor
autor
- Department of Computer and Information Science, Linköping University, S-581 83 Linköping, Sweden, patdo@ida.liu.se
Bibliografia
- [1] Ackermann, W.: Untersuchungen über das Eliminationsproblem der mathematischen Logik, Mathematische Annalen, 110, 1935, 390-413.
- [2] Busch, D.: Sequent Formalizations of Three-Valued Logics, in: Partiality, Modality and Nonmonotonicity (P. Doherty, Ed.), CSLI Publications, 1996, 45-75.
- [3] Demri, S., Orłowska, E.: Incomplete Information: Structure, Inference, Complexity, EATCS Monographs, Springer, 2002.
- [4] Doherty, P., Łukaszewicz, W., Skowron, A., Szałas, A.: Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge, Rough-Neuro Computing: Techniques for Computing with Words (S. Pal, L. Polkowski, A. Skowron, Eds.), Cognitive Technologies, Cognitive Technologies, Springer-Verlag, 2003, 189-218.
- [5] Doherty, P., Łukaszewicz, W., Szałas, A.: Computing Circumscription Revisited, Journal of Automated Reasoning, 18(3), 1997, 297-336.
- [6] Doherty, P., Łukaszewicz, W., Szałas, A.: Information Granules for Intelligent Knowledge Structures, Proc. 9th Conf. RSFDGrC (WangG., Q. Liu, Y. Yao, A. Skowron, Eds.), LNCS, vol. 2639 of LNCS, Springer-Verlag, 2003, 405-412.
- [7] Doherty, P., Łukaszewicz, W., Szałas, A.: Similarity, Approximations and Vagueness, Proc. RSFDGrC'05 (e. a. Slezak D., Ed.), LNAI, number 3641 in LNAI, Springer-Verlag, 2003, 541-550.
- [8] Doherty, P., Łukaszewicz, W., Szałas, A.: Tolerance Spaces and Approximative Representational Structures, Proc. 26th German Conf. on AI, KI'2003 (A. Günter, R. Kruse, B. Neumann, Eds.), LNAI, vol. 2821 of LNAI, Springer-Verlag, 2003, 475-489.
- [9] Doherty, P., Łukaszewicz, W., Szałas, A.: Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities, Proceedings of the 7th Int. Conf. on Information Fusion, FUSION' 2004, 2004, 175-182.
- [10] Doherty, P., Szałas, A.: On the Correspondence between Approximations and Similarity, Proc.of 4th Int. Conf. RSCTC'2004 (S. Tsumoto, R. Slowinski, J. Komorowski, J. Grzymala-Busse, Eds.), LNAI, vol. 3066 of LNAI, Springer-Verlag, 2004, 143-152.
- [11] Fitting, M.: A Kripke-Kleene Semantics for Logic Programs, Journal Logic Programming, 2(4), 1985, 295-312.
- [12] Gabbay, D., Ohlbach, H.: Quantifier Elimination in Second-Order Predicate Logic, South African Computer Journal, 7, 1992, 35-43.
- [13] Konikowska, B.: A logic for reasoning about relative similarity, Studia Logica, 58(1), 1997, 185-226.
- [14] Magnusson, M.: DLS*, http://www.ida.liu.se/labs/kplab/projects/dlsstar/,, 2005.
- [15] Nonnengart, A., Ohlbach, H., Szałas, A.: Elimination of Predicate Quantifiers, Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I (H. Ohlbach, U. Reyle, Eds.), Kluwer, 1999, 159-181.
- [16] Nonnengart, A., Szałas, A.: A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa (E. Orłowska, Ed.), Studies in Fuzziness and Soft Computing, vol. 24 of Studies in Fuzziness and Soft Computing, Springer Physica-Verlag, 1998, 307-328.
- [17] Pawlak, Z.: Information systems - theoretical foundations, Information Systems, 6, 1981, 205-218.
- [18] Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.
- [19] Przymusinski, T., Przymusinska, H.: Semantic issues in deductive databases and logic programs, Formal Techniques in AI (R. Banerji, Ed.), North Holland, 1990, 321-367.
- [20] Skowron, A., Stepaniuk, J.: Tolerance Approximation Spaces, Fundamenta Informaticae, 27, 1996, 245-253.
- [21] Słowiński, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations, Advances in Machine Intelligence & Soft Computing (P. Wang, Ed.), Bookwrights, Raleigh NC, 1997, 17-33.
- [22] Słowiński, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity, IEEE Trans. on Data and Knowledge Engineering, 12(2), 2000, 331-336.
- [23] Szałas, A.: On the Correspondence between Modal and Classical Logic: An Automated Approach, Journal of Logic and Computation, 3, 1993, 605-620.
- [24] Van Benthem, J.: Correspondence Theory, Handbook of Philosophical Logic (D. Gabbay, F. Guenthner, Eds.), vol. 2, D. Reidel Pub. Co., 1984, 167-247.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS5-0009-0009