ĐẠI HỌC QUỐC GIA HÀ NỘI TRƯỜNG ĐẠI HỌC CÔNG NGHỆ NGUYỄN THỊ HỒNG KHÁNH XỬ LÝ KHÔNG NHẤT QUÁN TRONG TÍCH HỢP TRI THỨC DỰA TRÊN LOGIC LUẬN ÁN TIẾN SĨ NGÀNH CÔNG NGHỆ THÔNG TIN Hà Nội - 2019 ĐẠI HỌC QUỐC GIA HÀ NỘI TRƯỜNG ĐẠI HỌC CÔNG NGHỆ NGUYỄN THỊ HỒNG KHÁNH XỬ LÝ KHÔNG NHẤT QUÁN TRONG TÍCH HỢP TRI THỨC DỰA TRÊN LOGIC Chuyên ngành: Hệ thống thông tin Mã số: 9480104.01 LUẬN ÁN TIẾN SĨ NGÀNH CÔNG NGHỆ THÔNG TIN NGƯỜI HƯỚNG DẪN KHOA HỌC: PGS TS Hà Quang Thuỵ PGS.TSKH Nguyễn Anh Linh Hà Nội – 2019 L˝I CAM OAN Tæi xin cam oan lu“n ¡n n y l cỉng tr…nh nghi¶n cứu ca riảng tổi CĂc kt quÊ ữổc vit chung vợi cĂc tĂc giÊ khĂc ãu ữổc sỹ ỗng ỵ ca cĂc ỗng tĂc giÊ trữợc ữa v o lu“n ¡n C¡c k‚t qu£ n¶u l trung thüc v ch÷a tłng ÷ỉc cỉng bŁ c¡c cỉng tr…nh n o khĂc Nghiản cứu sinh Nguyn Th Hỗng KhĂnh L˝IC MÌN Lu“n ¡n ÷ỉc thüc hi»n t⁄i Bº mỉn C¡c H» thŁng thæng tin, Khoa Cæng ngh» thæng tin, Tr÷íng ⁄i håc Cỉng ngh» ( ⁄i håc quŁc gia H Ni) dữợi sỹ hữợng dÔn khoa hồc ca PGS.TS H Quang Thửy v PGS.TSKH Nguyn Anh Linh Trữợc tiản tổi xin gòi lới cÊm ỡn chƠn th nh v s¥u s›c ‚n PGS TS H Quang Thu v PGS TSKH Nguyn Anh Linh hai ngữới thy  hữợng dÔn, khuy‚n kh‰ch, truy•n c£m høng, ch¿ b£o v t⁄o cho tổi nhng iãu kiằn tt nhĐt t bt u l m nghi¶n cøu sinh ‚n ho n th nh lu“n ¡n n y Tæi xin b y tä lặng bit ỡn tợi GS.TSKH Nguyn Ngồc Th nh, i håc cỉng ngh» Wroclaw (Ba Lan), PGS.TS Vª QuŁc B£o, ⁄i håc cỉng ngh» Swinburne (Australia), TS Trƒn Thanh L÷ìng, Trữớng i hồc khoa hồc ( i hồc Hu)  cõ hỉ trổ nhiãu vã chuyản mổn cho lun Ăn n y Tổi xin chƠn th nh cÊm ỡn tợi t“p th” c¡c thƒy cæ gi¡o, c¡c nh khoa håc thuºc Tr÷íng ⁄i håc Cỉng ngh» ( °c bi»t l cĂc th nh viản ca Phặng th nghiằm Khoa hồc dœ li»u v Cỉng ngh» tri thøc DSKTlab) ¢ gióp ù vã chuyản mổn v to iãu kiằn thun lổi cho tỉi suŁt thíi gian håc t“p v nghi¶n cứu Tổi xin b y tọ lặng cÊm ỡn chƠn th nh tợi cĂc cng sỹ  tổi thỹc hiằn cĂc cổng trnh nghiản cứu v cĂc bn ỗng nghi»p ¢ gióp ï, trao Œi v chia s· nhœng kinh nghiằm vã chuyản mổn, õng gõp cĂc ỵ kin quỵ bĂu cho tổi quĂ trnh nghiản cứu Tổi xin tr¥n trång c£m ìn c¡c thƒy cỉ hºi ỗng chuyản mổn  õng gõp cĂc ỵ kin quỵ b¡u ” tæi ho n thi»n lu“n ¡n Tæi xin tr¥n trång c£m ìn Bº Gi¡o dưc v o t⁄o, • ¡n 911 cıa Bº GD& T ¢ hØ trỉ mºt phƒn kinh ph‰ cho tæi qu¡ tr…nh håc t“p Tỉi xin c£m ìn Ban Gi¡m hi»u, Tr÷ðng khoa Cổng nghằ thổng tin v cĂc anh ch em ỗng nghiằp trữớng i hồc iằn lỹc  giúp ù, chia s· qu¡ tr…nh cỉng t¡c, håc t“p, nghi¶n cøu v thüc hi»n lu“n ¡n cıa m…nh Tæi luæn bi‚t ỡn nhng ngữới thƠn gia nh, mà ni, b mà ngoi, cĂc anh ch em  luổn chia sà khõ khôn, ng viản v l dỹa tinh thn vœng ch›c cho tỉi suŁt thíi gian qua NCS Nguyn Th Hỗng KhĂnh Mửc lửc LI CAM OAN L˝I C M ÌN MÖC LÖC DANH MÖC TØ VI T T T DANH MÖC C C KÞ HI U DANH MÖC C C B NG 10 DANH MÖC C C H NH V 11 M— 12 Ch÷ìng U GI˛I THI U CHUNG V QU N LÞ KH˘NG NH T QU N 22 1.1 Mºt sŁ kh¡i ni»m cì b£n 22 1.1.1 Dœ li»u, thæng tin v tri thøc 22 1.1.2 Cì sð tri thøc 23 1.1.3 Khỉng nh§t qu¡n 24 1.2 T‰ch hæp tri thøc 25 1.2.1 Giỵi thi»u 25 1.2.2 C¡c to¡n tß t‰ch hỉp tri thøc 26 Mưc lưc 1.3 Logic mỉ t£ 28 1.3.1 Giợi thiằu vã logic mổ tÊ 28 1.3.2 Cì sð tri thøc LGMT 29 1.3.3 Håc kh¡i ni»m LGMT 35 1.4 Logic para-nh§t qu¡n 37 1.4.1 Logic bŁn gi¡ trà cıa N D Belnap 38 1.4.2 Ngœ ngh¾a cıa logic bŁn gi¡ trà 39 1.4.3 Lỵ thuyt chứng minh logic bŁn gi¡ trà 40 1.5 Logic kh£ n«ng 42 1.5.1 Có ph¡p 42 1.5.2 Ngœ ngh¾a 43 1.5.3 khổng nhĐt quĂn theo logic khÊ nông 44 1.6 Mæ phäng hai chiãu, tữỡng tỹ hai chiãu, tnh chĐt Hennessy-Milner 45 1.6.1 Mổ phọng hai chiãu v tữỡng tỹ hai chiãu 45 1.6.2 T‰nh ch§t Hennessy-Milner 48 1.7 Nghiản cứu vã quÊn lỵ khổng nhĐt qu¡n v ti‚p c“n cıa lu“n ¡n 49 1.7.1 QuÊn lỵ KNQ dỹa trản logic mổ tÊ 50 1.7.2 QuÊn lỵ KNQ dỹa trản logic khÊ nông vợi khung tranh lun v m phĂn 52 1.8 K‚t lu“n ch÷ìng 53 Ch÷ìng LOGIC M˘ T PARA-NH T QU N BăN GI TR: M PHNG HAI CHI U, T NH CH T HENNESSY-MILNER V ÙNG DÖNG H¯C KH I NI M 54 2.1 Nghiản cứu vã mỉ phäng hai chi•u LGMT 55 2.2 LGMT para-nh§t qu¡n bŁn gi¡ trà 56 2.2.1 Ngœ ngh¾a cıa LGMT para-nh§t qu¡n bŁn gi¡ trà 56 2.2.2 Mỉ phäng hai chi•u Łi vợi LGMT para-nhĐt quĂn bn giĂ tr 64 Mửc lưc 2.3 T‰nh ch§t b£o to n cıa mỉ phäng hai chi•u 68 2.4 Tnh chĐt Hennessy-Milner ca mổ phọng hai chiãu 73 2.5 Håc kh¡i ni»m cho LGMT para-nh§t qu¡n 80 2.5.1 B i to¡n håc kh¡i ni»m LGMT para-nh§t qu¡n 80 2.5.2 Thu“t to¡n håc kh¡i ni»m LGMT para-nh§t qu¡n 81 2.5.3 Thüc nghi»m v nh“n x†t 83 2.6 K‚t lu“n ch÷ìng 85 Ch÷ìng LOGIC M˘ T M˝ THEO NGÚ NGH A G´DEL: M˘ PH˜NG HAI CHI U V T NH MILNER 86 CH T HENNESSY- 3.1 Nghiản cứu vã mổ phäng hai chi•u logic mí 86 3.2 T“p mí theo ngœ ngh¾a Gâdel 88 3.2.1 T“p mí v c¡c ph†p to¡n t“p mí 88 3.2.2 Ba ngœ ngh¾a cıa t“p mí 90 3.2.3 To¡n tß mí Gâdel 91 3.3 Logic mỉ t£ mí theo ngœ ngh¾a Gâdel 93 3.4 Mổ phọng hai chiãu vợi LGMT mí 98 3.5 T‰nh ch§t b£o to n cıa mỉ phäng hai chi•u mí 102 3.6 T‰nh ch§t Hennessy-Milner cıa mỉ phäng hai chi•u mí 103 3.7 K‚t lu“n ch÷ìng 105 Ch÷ìng KHUNG TRANH LU N V M PH N HײNG ×U TI N TRONG T CH HÑP TRI THÙC NH T QU N 106 4.1 T‰ch hæp tri thøc b‹ng m ph¡n 106 4.1.1 Khung m ph¡n t‰ch hæp tri thøc 106 4.1.2 Mæ h…nh m ph¡n 108 4.1.3 Chi‚n l÷ỉc s›p x‚p t‰ch hỉp tri thøc 108 4.1.4 m ph¡n düa trản cĂc ữu tiản 109 Ch÷ìng KHUNG TRANH LU N V M PH N HײNG ×U TI N TRONG T CH HĐP TRI THC NH T QU N trản viằc sò dửng KNQ nhữ mt thữợc o vợi thao tĂc ct t¿a ” x¥y düng khung tranh lu“n cho t‰ch hỉp tri thức Mt hổp cĂc nh ã ữổc giợi thi»u v c¡c thuºc t‰nh logic ÷ỉc kh£o s¡t v Ănh giĂ Kt quÊ nghiản cứu ti chữỡng n y ¢ ÷ỉc cỉng bŁ [NTHKhanh4, NTHKhanh5, NTHKhanh7] 126 K TLU NV HìNGPH TTRI N Kt quÊ nghiản cứu ca lun Ăn Logic mổ tÊ cụng nhữ logic khÊ nông cung c§p c¡c cỉng cư r§t m⁄nh m‡ qu£n lỵ KNQ, v vy, lun Ăn trung nghiản cứu v• bi”u di„n v l“p lu“n tri thøc KNQ düa trản mổ phọng hai chiãu v tữỡng tỹ hai chiãu mºt sŁ ki”u LGMT mð rºng v t‰ch hæp tri thøc logic kh£ n«ng Lu“n ¡n tham gia v o dặng nghiản cứu trản th giợi vã xò lỵ KNQ dỹa trản LGMT v logic khÊ nông Lun Ăn cõ cĂc õng gõp chnh sau Ơy: ã nh nghắa mổ phọng hai chiãu v tữỡng tỹ hai chiãu i vợi LGMT para-nhĐt quĂn trản nãn LGMT ALC (mt kiu LGMT ALC reg vợi cĂc c trững b sung l I: vai trỈ nghàch £o, O: ành danh, Q: hn ch s lữổng, U: vai trặ to n cửc, Self: ph£n x⁄); ph¡t bi”u v chøng minh t ‰nh ch§t Hennessy-Milner v t‰nh b£o to n cıa mỉ phäng hai chiãu v tữỡng tỹ hai chiãu ữổc nh nghắa; ph¡t bi”u b i to¡n håc kh¡i ni»m LGMT para-nhĐt quĂn bn giĂ tr, ã ngh mt thut toĂn gi£i x§p x¿ b i to¡n håc kh¡i ni»m LGMT para-nh§t qu¡n bŁn gi¡ trà v thüc nghi»m Mºt phƒn c¡c âng gâp n y ÷ỉc cỉng bŁ trong[NTHKhanh1], [NTHKhanh2], [NTHKhanh3] v [NTHKhanh6] ã nh nghắa mổ phọng hai chiãu v tữỡng tỹ hai chiãu i vợi LGMT mớ theo ng nghắa Gõdel trản nãn LGMT ALC ; phĂt bi”u v chøng minh t‰nh ch§t Hennessy-Milner v t‰nh b£o to n ca mổ phọng hai chiãu v tữỡng tỹ hai chiãu ữổc nh nghắa õng gõp n y ữổc cổng 127 Kt lun v hữợng phĂt trin b [NTHKhanh2] • • nghà mºt khung t‰ch hỉp c¡c cì s tri thức khÊ nông dỹa trản viằc sò dửng KNQ nhữ mt thữợc o vợi thao tĂc c›t t¿a ” x¥y düng khung tranh lu“n cho t‰ch hỉp tri thøc • nghà mºt t“p c¡c ành • cƒn thi‚t, kh£o s¡t v ¡nh gi¡ c¡c thuºc t‰nh logic liản quan i vợi khung tranh lun cho tch hỉp tri thøc C¡c k‚t qu£ nghi¶n cøu n y ÷æc cæng bŁ [NTHKhanh4], [NTHKhanh5], [NTHKhanh7] H⁄n ch‚ ca lun Ăn Vã mt ứng dửng, dũ  trin khai mºt phƒn m•m thüc nghi»m ìn gi£n håc kh¡i niằm theo LGMT para-nhĐt quĂn, nhiản, hn ch lợn nhĐt ca lun Ăn l chữa trin khai ữổc cĂc phn mãm nông lỹc minh hồa cho cĂc mổ h…nh bi”u di„n tri thøc v l“p lu“n düa tr¶n cĂc logic  ữổc nh nghắa v khÊo sĂt lun Ăn Vã mt lỵ thuyt, nƠng cĐp i vỵi c¡c LGMT mð rºng ph⁄m vi mºt ALC nãn v chữa ữổc phĂt trin dỹa trản hồ LGMT DL-Lite Hữợng phĂt trin Thứ nhĐt, cn tin h nh tri”n khai h» thŁng phƒn m•m minh håa ı tt cho cĂc nghiản cứu lỵ thuyt ca lun Ăn Ni dung nghiản cứu trin khai xƠy dỹng cĂc cổng cư v phƒn m•m bi”u di„n tri thøc v l“p lun liản quan tợi KNQ cĂc lun Ăn Tin s trản th giợi (chflng hn, [83, 84, 78]) cn ÷ỉc kh£o s¡t, håc häi v ¡p dưng Thø hai, vã mt lỵ thuyt, cn cõ thảm cĂc nghiản cứu cổng phu phƠn tch sƠu sc hỡn na vã cĂc mổ phọng hai chiãu, tữỡng tỹ hai chiãu, tnh chĐt Hennessy-Milner v cĂc tnh chĐt ct lêi liản quan i vợi cĂc LGMT m rng CĂc kt quÊ nghiản cøu L.A.Nguyen, A.R Divroodi v cºng sü v• mỉ phäng hai chiãu, tữỡng tỹ hai chiãu v hồc khĂi niằm c¡c LGMT [33, 68, 70, 43, 30, 34, 56, 32, 67] cn ữổc tip tửc ữổc phƠn tch sƠu s›c hìn nh‹m n¥ng cao k‚t qu£ cıa c¡c cỉng tr…nh cỉng bŁ cıa lu“n ¡n 128 Danh mưc c¡c cỉng tr…nh khoa håc cıa t¡c gi£ li¶n quan ‚n lu“n ¡n [NTHKhanh1] Thi Hong Khanh Nguyen, Quang-Thuy Ha A Learning Method based on Bisimulation in the Inconsistent Knowledge Systems ICARCV-2018 (Scopus, DBLP) [NTHKhanh2] Quang-Thuy Ha, Linh Anh Nguyen, Thi Hong Khanh Nguyen and Thanh-Luong Tran Fuzzy Bisimulations in Fuzzy Description Logics under the Godel Semantics IJCRS 2018: 559-572 (Scopus, DBLP) [NTHKhanh3] Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc Thanh Nguyen, Quang-Thuy Ha Bisimilarity for paraconsistent description logics Journal of Intelligent and Fuzzy Systems 32(2): 1203-1215, 2017 (SCIE Journal) [NTHKhanh4] Thi Hong Khanh Nguyen, Trong Hieu Tran, Tran Van Nguyen, Thi Thanh Luu Le Merging Possibilistic Belief Bases by Argumentation ACIIDS 2017: 24-34 (Scopus, DBLP) [NTHKhanh5] Quoc Bao Vo, Trong Hieu Tran, Thi Hong Khanh Nguyen On the Use of Surplus Division to Facilitate Efficient Negotiation in the Presence of Incomplete Information KES 2016: 295-304 (Scopus, DBLP) [NTHKhanh6] Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc Thanh Nguyen, Quang-Thuy Ha Bisimilarity for paraconsistent description logics SMC 2016: 4694-4699 (Scopus, DBLP) 129 Danh möc c¡c cỉng tr…nh khoa håc cıa t¡c gi£ li¶n quan ‚n lu“n ¡n [NTHKhanh7] Trong Hieu Tran, Quoc Bao Vo, Thi Hong Khanh Nguyen On the Belief Merging by Negotiation KES 2014: 147-155 (Scopus, DBLP) Danh möc n y gỗm 07 cổng trnh 130 T ILI UTHAMKH O [1] L Aceto, A Ingolfsdottir, and J Srba Chapter the algorithmics of bisimilarity In J R Davide Sangiorgi, editor, Advanced Topics in bisimulation and Coinduction, pages 100 172 Cambridge University Press, 2012 [2] L Amgoud and C Cayrol Inferring from inconsistency in preference-based argumentation frameworks International Journal of Automated Reasoning, 29:125 169, 2002 [3] S Amo and M Pais A paraconsistent logic approach for querying inconsistent databases International Journal of Approximate Reasoning, 46:366 386, 2007 [4] H Andreas Modular semantics for theories: An approach to paraconsistent reasoning J Philosophical Logic, 47(5):877 912, 2018 [5] F Baader, I Horrocks, C Lutz, and U Sattler An Introduction to Description Logic Cambridge University Press, 2017 [6] F Baader, I Horrocks, and U Sattler Chapter description logics In F van Harmelen, V Lifschitz, and B Porter, editors, Handbook of Knowledge Representation, volume of Foundations of Artificial Intelligence, pages 135 179 Elsevier, 2008 [7] R A Baeza-Yates and B A Ribeiro-Neto Modern Information Retrieval ACM Press Addison-Wesley, 1999 [8] T H B‹ng T‰ch hổp ontology mớ dỹa trản lỵ thuyt ỗng thun PhD thesis, Lu“n ¡n ti‚n sÿ, ⁄i håc CNTT, ⁄i håc Quc gia TP Hỗ Ch Minh, 2016 131 T i li»u tham kh£o [9] N D Belnap Useful four-valued logic In Dunn J.M., Epstein G (eds) Modern Uses of Multiple-Valued Logic Episteme, Springer, pages 37, 1977 [10] S Benferhat, D Dubois, C Cayrol, J Lang, and H Prade Inconsistency management and prioritized syntax-based entailment In IJ-CAI93, pages 640 645, 1993 [11] S Benferhat, D Dubois, S Kaci, and H Prade Possibilistic merging and distance-based fusion of propositional information Annals of Mathematics and Artificial Intelligence, 34:217 252, 2002 [12] S Benferhat, D Dubois, H Prade, and M Williams A practical approach to fusing and revising prioritized belief bases In Proceedings of EPIA 99, LNAI 1695, Springer Verlag, pages 222 236, 1999 [13] F Berto How to Sell a Contradiction: The Logic and Metaphysics of Inconsistency College Publications, 2007 [14] L E Bertossi, A Hunter, and T Schaub Introduction to inconsistency tolerance In Inconsistency Tolerance [result from a Dagstuhl seminar], pages 14, 2005 [15] J.-Y B†ziau, W Carnielli, and D Gabbay, editors Handbook of Para-consistency, volume of Logic and cognitive systems College Publi-cations, 2007 [16] F Bobillo, M Delgado, J Gâmez-Romero, and U Straccia Fuzzy description logics under Godel semantics Int J Approx Reasoning, 50(3):494 514, 2009 [17] R Booth A negotiation-style framework for non-prioritised revision In Proceedings of the 8th Conference on Theoretical Aspects of Ratio-nality and Knowledge, TARK ’01, pages 137 150, 2001 [18] R Booth Social contraction and belief negotiation Inf Fusion, 7:19 34, 2006 [19] Bouraoui Inconsistency and uncertainty handling in lightweight description logics PhD thesis, 2015 132 T i li»u tham kh£o [20] G Brewka A rank based description language for qualitative prefer-ences In ECAI, pages 303 307, 2004 [21] J W Carl Hewitt Inconsistency Robustness 2015 [22] W A Carnielli, M Coniglio, and I M L Dottaviano Paraconsistency - The Logical Way to Inconsistency CRC Press, 2002 [23] M Ciric, J Ignjatovic, N Damljanovic, and M Basic Bisimulations for fuzzy automata Fuzzy Sets and Systems, 186(1):100 139, 2012 [24] W W Cohen and H Hirsh Learning the classic description logic: Theoretical and experimental esults In Proceedings of the 4th Inter-national Conference on Principles of Knowledge Representation and Reasoning (KR’94) Bonn, Germany, May 2427, 1994., pages 121 133, 1994 [25] N C A da Costa On the theory of inconsistent formal systems Notre Dame Journal of Formal Logic, 15(4):497 510, 1974 [26] N C A da Costa and V S Subrahmanian Paraconsistent logics as a formalism for reasoning about inconsistent knowledge bases Artificial Intelligence in Medicine, 1(4):167 174, 1989 [27] S de Amo, W A Carnielli, and J Marcos A logical framework for integrating inconsistent information in multiple databases In FoIKS 2002, volume 2284, pages 67 84 Springer, 2002 [28] C A D Deagustini, M V Mart‰nez, M A Falappa, and G R Simari Inconsistency resolution and global conflicts In ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intel-ligent Systems (PAIS 2014), pages 991 992, 2014 [29] C A D Deagustini, M V Martinez, M A Falappa, and G R Simari How does incoherence affect inconsistency-tolerant semantics for datalog ? Ann Math Artif Intell., 82(1-3):43 68, 2018 [30] A Divroodi Bisimulation Equivalence in Description Logics and Its Applications PhD thesis, University of Warsaw, 2015 133 T i li»u tham kh£o [31] A Divroodi, Q.-T Ha, L Nguyen, and H Nguyen On c-learnability in description logics In Proceedings of ICCCI2012(1), pages 230 238, 2012 [32] A Divroodi, Q.-T Ha, L Nguyen, and H Nguyen On the possibility of correct concept learning in description logics Vietnam J Computer Science, 5(1):3 14, 2018 [33] A Divroodi and L Nguyen On bisimulations for description logics In Proceedings of CSP2011, pages 99 110, 2011 [34] A Divroodi and L Nguyen On bisimulations for description logics Information Sciences, 295:465 493, 2015 [35] D Dubois, J Lang, and H Prade Possibilistic logic In Handbook of Logic in Artificial Intelligence and Logic Programming, D Gabbay et al., eds, pages 439 513, 1994 [36] P M Dung On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and nperson games Artificial Intelligence, 77:321 357, 1995 [37] A El-Roby Web Data Integration for Non-Expert Users PhD thesis, University of Waterloo, Ontario, Canada, 2018 [38] P Eleftheriou, C Koutras, and C Nomikos Notions of bisimulation for Heyting-valued modal languages J Log Comput., 22(2):213 235, 2012 [39] T.-F Fan Fuzzy bisimulation for Godel modal logic IEEE Trans Fuzzy Systems, 23(6):2387 2396, 2015 [40] N Fanizzi, C d’Amato, and F Esposito DL-FOIL concept learning in description logics In Inductive Logic Programming, 18th International Conference, ILP 2008, Prague, Czech Republic, September 10-12, 2008, Proceedings, pages 107 121, 2008 [41] M Fitting Paraconsistent logic, evidence, and justification Studia Logica, 105(6):1149 1166, 2017 134 T i li»u tham kh£o [42] S Gao Integration, Provenance, and Temporal Queries for LargeScale Knowledge Bases PhD thesis, University of California, Los An-geles, USA, 2016 [43] Q.-T Ha, T.-L.-G Hoang, L Nguyen, H Nguyen, A Szalas, and T.L Tran A bisimulation-based method of concept learning for knowledge bases in description logics In Proc of SoICT’2012, pages 241 249 ACM, 2012 [44] P H¡jek Making fuzzy description logic more general Fuzzy Sets and Systems, 154(1):1 15, 2005 [45] A Haret, S Rummele, and S Woltran Merging in the horn fragment In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 3041 3047, 2015 [46] M Hennessy and R Milner On observing nondeterminism and con-currency In 7th International Conference of Automata, Languages and Programming (ICALP), pages 299 309, 1980 [47] I Horrocks, O Kutz, and U Sattler The even more irresistible SROIQ In Proc of KR’2006, pages 57 67 AAAI Press, 2006 [48] A Hunter Paraconsistent Logics, pages 11 36 Springer Netherlands, 1998 [49] B Jayakumar Handling Inconsistency in Knowledge Bases PhD thesis, Georgia State University, 2017 [50] S Konieczny Belief base merging as a game Journal of Applied Non-Classical Logics, 14(3):275 294, 2004 [51] S Konieczny, J Lang, and P Marquis Da2 merging operators Artif Intell., 157:49 79, August 2004 [52] S Konieczny and R P P†rez Merging information under constraints: a logical framework Journal of Logic and Computation, 12(5):773 808, 2002 135 T i li»u tham kh£o [53] J Lehmann and P Hitzler Concept learning in description logics using refinement operators Machine Learning, 78(1-2):203 250, 2010 [54] M S Lew, N Sebe, C Djeraba, and R Jain Content-based multimedia information retrieval: State of the art and challenges ACM Trans Multimedia Comput Commun Appl., 2(1):1 19, Feb 2006 [55] J Lin Integration of weighted knowledge bases Artif Intell., 83:363 378, June 1996 [56] T T L÷ìng Håc kh¡i ni»m cho c¡c h» thŁng thỉng tin düa tr¶n logic mỉ t£ PhD thesis, Lu“n ¡n Ti‚n sÿ, Tr÷íng ⁄i håc Khoa håc, ⁄i håc Hu‚, 2015 [57] Y Ma and P Hitzler Paraconsistent reasoning for OWL In A Polleres and T Swift, editors, Proc of Web Reasoning and Rule Systems, volume 5837 of LNCS, pages 197 211 Springer, 2009 [58] Y Ma, P Hitzler, and Z Lin Paraconsistent reasoning for expressive and tractable description logics In Proc of Description Logics, 2008 [59] M Maleszka and N T Nguyen Integration computing and collective intelligence Expert Syst Appl., 42(1):332 340, 2015 [60] J Maluszynski and A Szalas Computational aspects of paraconsis-tent query language 4QL Journal of Applied Nonclassical Logics, 21(2):211 232, 2011 [61] J Maluszynski, A Szalas, and A Vitâria Paraconsistent logic pro- grams with four-valued rough sets In C.-C Chan, J GrzymalaBusse, and W Ziarko, editors, Proc of RSCTC’2008, volume 5306 of LNAI, pages 41 51, 2008 [62] M V Martinez Personalizable knowledge integration PhD Thesis, University of Maryland, College Park, 2011 [63] J J Merelo, F Liberatore, A Fern¡ndez-Ares, R H Garc‰a-Ortega, and Z Chelly The uncertainty quandary: A study in the context of the evolutionary optimization in games and other uncertain environments Trans Computational Collective Intelligence, 24:40 60, 2016 136 T i li»u tham kh£o [64] M Minsky A framework for representing knowledge Technical Report (MIT-AI Laboratory Memo 306), 1974 [65] J Nash The bargaining problem Econometrica, 18(2):155 162, April 1950 [66] L Nguyen Paraconsistent and approximate semantics for the OWL Web Ontology Language In Proc of RSCTC’2010, volume 6086 of LNAI, pages 710 720 Springer, 2010 [67] L Nguyen Computing bisimulation-based comparisons Fundam Inform., 157(4):385 401, 2018 [68] L Nguyen and A Szalas Paraconsistent reasoning for semantic web agents T Computational Collective Intelligence, 6:36 55, 2012 [69] L Nguyen and A Szalas Three-valued paraconsistent reasoning for Semantic Web agents In P J et al., editor, Proc of KESAMSTA 2010, Part I, volume 6070 of LNAI, pages 152 162 Springer, 2010 [70] L Nguyen and A Szalas Logic-based roughification In A Skowron and Z Suraj, editors, Rough Sets and Intelligent Systems (To the Memory of Professor Zdzislaw Pawlak), Vol 1, pages 529 556 Springer, 2012 [71] N T Nguyen Advanced Methods for Inconsistent Knowledge Man-agement Advanced Information and Knowledge Processing Springer, 2008 [72] V D Nguyen and N T Nguyen An influence analysis of diversity and collective cardinality on collective performance Inf Sci., 430:487 503, 2018 [73] R Olfati-Saber, J A Fax, and R M Murray Consensus and cooperation in networked multi-agent systems Proceedings of the IEEE, 95(1):215 233, 2007 [74] G Priest The logic of paradox J Philosophical Logic, 8(1):219 241, 1979 137 T i li»u tham kh£o [75] G Qi, W Liu, and D A Bell Merging stratified knowledge bases under constraints In AAAI, pages 281 286 AAAI Press, 2006 [76] M R Quillian Semantic memory In M L Minsky, editor, Semantic Information Processing, pages 227 270 MIT, 1968 [77] G R Ralph M Stair, editor Principles of Information Systems (13th edition) Course Technology, 2018 [78] D Ratcliffe OWL-Miner Concept Induction in OWL Knowledge Bases PhD thesis, The Australian National University, 2018 [79] P Z Revesz On the semantics of arbitration International Journal of Algebra and Computation, 7:133 160, 1995 [80] S Rudolph Foundations of description logics In Reasoning Web Se-mantic Technologies for the Web of Data - 7th International Summer School 2011, Galway, Ireland, August 23-27, 2011, Tutorial Lectures, pages 76 136, 2011 [81] D Sangiorgi Chapter origins of bisimulation and coinduction In J R Davide Sangiorgi, editor, Advanced Topics in bisimulation and Coinduction, pages 37 Cambridge University Press, 2012 [82] D Sangiorgi and R (Eds.) Advanced Topics in Bisimulation and Coinduction Cambridge Tracts in Theoretical Computer Science Cambridge University Press, 2011 [83] D F Savo Dealing with Inconsistencies and Updates in Description Logic Knowledge Bases PhD thesis, Sapienza University of Rome, 2013 [84] L K Spendier Tools for the Investigation of Substructural, Interme-diate and Paraconsistent Logics PhD thesis, Technische Universitat Wien, 2015 [85] M Sridharan and M Gelfond Using knowledge representation and reasoning tools in the design of robots In Proceedings of the Work-shop on Knowledge-based Techniques for Problem Solving and Reason-ing colocated with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York City, USA, July 10, 2016., 2016 138 T i li»u tham kh£o [86] C Stirling Chapter bisimulation and logic In J R Davide Sangiorgi, editor, Advanced Topics in bisimulation and Coinduction, pages 173 196 Cambridge University Press, 2012 [87] U Straccia A sequent calculus for reasoning in fourvalued description logics In TABLEAUX97, pages 343 357 Springer, 1997 [88] T H Tran, N T Nguyen, and Q B Vo Axiomatic characterization of belief merging by negotiation Multimedia Tools and Applications, 65:133 159, 2013 [89] T.-L Tran, Q.-T Ha, T.-L.-G Hoang, L Nguyen, and H Nguyen Bisimulation-based concept learning in description logics Fundam Inform., 133(2-3):287 303, 2014 [90] T.-L Tran, Q.-T Ha, T.-L.-G Hoang, L Nguyen, H Nguyen, and A Szalas Concept learning for description logic-based information systems In Proc of KSE 2012, pages 65 73 Springer, 2012 [91] T.-L Tran, L Nguyen, and T.-L.-G Hoang Bisimulation-based concept learning for information systems in description logics Vietnam J Computer Science, 2(3):149 167, 2015 [92] N V Trung Mºt s phữỡng phĂp xò lỵ tri thức khổng nhĐt quĂn ontology PhD thesis, Lu“n ¡n Ti‚n sÿ, Tr÷íng ⁄i håc Khoa håc, ⁄i håc Hu‚, 2018 [93] A Vitâria, J Maluszynski, and A Szalas Modeling and reasoning in paraconsistent rough sets Fundamenta Informaticae, 97(4):405 438, 2009 [94] Y M X Zhang, G Qi and Z Lin Quasi-classical semantics for expressive description logics In Proc of Description Logics Springer, 2009 [95] I A Zadeh Fuzzy sets Information and Control, pages 338 353, 1965 [96] D Zhang A logic-based axiomatic model of bargaining Artif Intell., 174:1307 1322, November 2010 139 T i li»u tham kh£o [97] C Zins Conceptual approaches for defining data, information, and knowledge JASIST, 58(4):479 493, 2007 140 ... quát sở tri thức, logic mô tả, logic mô tả para -nhất quán, logic khả xử lý không quán dựa logic CHƯƠNG GIỚI THIỆU CHUNG VỀ QUẢN LÝ KHÔNG NHẤT QUÁN Tiếp cận Tiếp cận dựa logic mô tả dựa logic khả... HỌC CÔNG NGHỆ NGUYỄN THỊ HỒNG KHÁNH XỬ LÝ KHÔNG NHẤT QUÁN TRONG TÍCH HỢP TRI THỨC DỰA TRÊN LOGIC Chuyên ngành: Hệ thống thông tin Mã số: 9480104.01 LUẬN ÁN TIẾN SĨ NGÀNH CÔNG NGHỆ THÔNG TIN NGƯỜI... Hennessy-Milner tính qn thơng tin CHƯƠNG LOGIC MÔ tranh luận hướng sở tri thức có ưu tiên, khung tranh luận giải khơng quán CHƯƠNG LOGIC MÔ TẢ PARA-NHẤT QUÁN BỐN GIÁ TRỊ: MƠ PHỎNG HAI CHIỀU, TÍNH