摘要: A version of fuzzy description logic based on the basic (continuous t-norm based) predicate BL is presented. Problems satisfiability, validity and subsumption concepts are discussed reduced to problems propositional known be decidable for any continuous t-norm. For Lukasiewicz some stronger results obtained.
elsevier.com
sci-hub.se 参考文章(15)
Steffen Hölldobler, Hans-Peter Störr, Tran Dinh Khang, A Fuzzy Description Logic with Hedges as Concept Modifiers ,(2002)
Henrik Legind Larsen, Jørgen Fischer Nilsson, Fuzzy querying in a concept object algebraic datamodel flexible query answering systems. pp. 123- 139 ,(1997) , 10.1007/978-1-4615-6075-3_7
R Molitor, C B Tresp, A Description Logic for Vague Knowledge european conference on artificial intelligence. pp. 361- 365 ,(1998)
John Yen, Generalizing term subsumption languages to fuzzy logic international joint conference on artificial intelligence. pp. 472- 477 ,(1991)
Piero A. Bonatti, Andrea G. B. Tettamanzi, Some complexity results on fuzzy description logics international workshop on fuzzy logic and applications. pp. 19- 24 ,(2003) , 10.1007/10983652_3
Alex Borgida, On the relative expressiveness of description logics and predicate logics Artificial Intelligence. ,vol. 82, pp. 353- 367 ,(1996) , 10.1016/0004-3702(96)00004-5
R. Cignoli, F. Esteva, L. Godo, A. Torrens, Basic Fuzzy Logic is the logic of continuous t-norms and their residua soft computing. ,vol. 4, pp. 106- 112 ,(2000) , 10.1007/S005000000044
Daniele Mundici, Satisfiability in many-valued sentential logic is NP-complete Theoretical Computer Science. ,vol. 52, pp. 145- 153 ,(1987) , 10.1016/0304-3975(87)90083-1
Petr Hájek, Metamathematics of Fuzzy Logic ,(1998)