Computer Science ›› 2020, Vol. 47 ›› Issue (4): 164-168.doi: 10.11896/jsjkx.190600171

• Artificial Intelligence • Previous Articles     Next Articles

R-Calculi For L3-Valued Propositional Logic

CAO Cun-gen1, HU Lan-xi1,2, SUI Yue-fei1,2   

  1. 1 Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100190,China;
    2 School of Computer Science and Technology,University of Chinese Academy of Sciences,Beijing 101408,China
  • Received:2019-06-27 Online:2020-04-15 Published:2020-04-15
  • Contact: HU Lan-xi,born in 1980,master,engineer.Her main research interests include foundation of large-scale know-ledge process.
  • About author:CAO Cun-gen,born in 1964,Ph.D,professor,Ph.D supervisor,is a member of CCF.His main research interests include large-scale knowledge process.
  • Supported by:
    This work was supported by the National Key R&D Program of China (2017YFC1700300)

Abstract: In L3-valued propositional logic,the Gentzen deduction system G for sequents is monotonic, and the one G for co-sequents is nonmonotonic.Based on G and G, an R- calculus S is given so that any reduction Δ|A⇒Δ,C is valid if and only if it is provable in S.Therefore,S is monotonic inrestraining A from entering Δ,and nonmonotonic in adding A into Δ.

Key words: Belief-revision, Co-sequent, Gentzen deduction system, Nonmonotonicity, R-calculus

CLC Number: 

  • TP301
[1]LI W.Mathematical logic,foundations for information science[M]//Progress in Computer Science and Applied Logic.Birkhauser,2010.
[2]TAKEUTI G.Proof theory(Second Edition)[M].Mineola,New York:Dover Publications,2013.
[3]CAO C G,SUI Y F,WANG Y.The nonmonotonic propositional logics [J].Artificial Intelligence Research,2016,5:111-120.
[4]REITER R.A logic for default reasoning [J].Artificial Intelligence,1980,13:81-132.
[5]ALCHOURRÒN C E,GARDENFORS P,MAKINSON D.On the logic of theory change:partial meet contraction and revision functions [J].The Journal of Symbolic Logic,1985,50:510-530.
[6]BOCHMAN A.A foundational theory of belief and belief change[J].Artificial Intelligence,1999,108:309-352.
[7]FERMÉ E,HANSSON S O.AGM 25 years:twenty-five years of research in belief change [J].Journal of Philosophical Logic,2011,40(2):295-331.
[8]LI W.R-calculus:An inference system for belief revision [J].The Computer Journal,2007,50:378-390.
[9]DARWICHE A,PEARL J.On the logic of iterated belief revision [J].Artificial Intelligence,1997,89:1-29.
[10]FRIEDMAN N,HALPERN J Y.Belief revision:a critique[C]//Principles of Knowledge Representation and Reasoning:proceedings of the 5th International Conference.1996:421-431.
[11]AVRON A.Natural 3-valued logics-characterization and prooftheory [J].Journal of Symbolic Logic,1991,56:276-294.
[12]GOTTWALD S.A treatise on many-valued logics [M].Research Studies Press,2001.
[13]AVRON A.On the expressive power of three-valued and four-valued languages [J].Journal of Logic and Computation,1999,9:977-994.
[14]HANSSON S O.Theory contraction and base contraction unified [J].The Journal of Symbolic Logic,1993,58:602-625.
[15]HERZIG A,RIFI O.Propositional belief base update and minimal change [J].Artificial intelligence,1999,115:107-138.
[16]PYNKO A P.Implicational classes of demorg-an lattices [J].Discrete Mathematics,1999,205:171-181.
[17]SATOH K.Nonmonotonic reasoning by minimal belief revision [C]//Proceedings of the international conference on FifthGe-neration Computer Systems.Tokyo,1988:455-462.
[18]URQUHART A.Basic many-valued logic(2nd Edition)[M]//Handbook of Philosophical Logic.Kluwer Academic Publishers,2001:249-295.
[1] LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Federated Learning Based on Stratified Sampling Optimization for Heterogeneous Clients [J]. Computer Science, 2022, 49(9): 183-193.
[2] SHAO Zi-hao, YANG Shi-yu, MA Guo-jie. Foundation of Indoor Information Services:A Survey of Low-cost Localization Techniques [J]. Computer Science, 2022, 49(9): 228-235.
[3] ZHANG Yuan, KANG Le, GONG Zhao-hui, ZHANG Zhi-hong. Related Transaction Behavior Detection in Futures Market Based on Bi-LSTM [J]. Computer Science, 2022, 49(7): 31-39.
[4] SUN Gang, WU Jiang-jiang, CHEN Hao, LI Jun, XU Shi-yuan. Hidden Preference-based Multi-objective Evolutionary Algorithm Based on Chebyshev Distance [J]. Computer Science, 2022, 49(6): 297-304.
[5] WANG Yong, CUI Yuan. Cutting Edge Method for Traveling Salesman Problem Based on the Shortest Paths in Optimal Cycles of Quadrilaterals [J]. Computer Science, 2022, 49(6A): 199-205.
[6] LI Dan-dan, WU Yu-xiang, ZHU Cong-cong, LI Zhong-kang. Improved Sparrow Search Algorithm Based on A Variety of Improved Strategies [J]. Computer Science, 2022, 49(6A): 217-222.
[7] LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Clustered Federated Learning Methods Based on DBSCAN Clustering [J]. Computer Science, 2022, 49(6A): 232-237.
[8] HU Cong, HE Xiao-hui, SHAO Fa-ming, ZHANG Yan-wu, LU Guan-lin, WANG Jin-kang. Traffic Sign Detection Based on MSERs and SVM [J]. Computer Science, 2022, 49(6A): 325-330.
[9] YANG Jian-nan, ZHANG Fan. Classification Method for Small Crops Combining Dual Attention Mechanisms and Hierarchical Network Structure [J]. Computer Science, 2022, 49(6A): 353-357.
[10] ZHANG Jia-hao, LIU Feng, QI Jia-yin. Lightweight Micro-expression Recognition Architecture Based on Bottleneck Transformer [J]. Computer Science, 2022, 49(6A): 370-377.
[11] WANG Fang-hong, FAN Xing-gang, YANG Jing-jing, ZHOU Jie, WANG De-en. Strong Barrier Construction Algorithm Based on Adjustment of Directional Sensing Area [J]. Computer Science, 2022, 49(6A): 612-618.
[12] TIAN Zhen-zhen, JIANG Wei, ZHENG Bing-xu, MENG Li-min. Load Balancing Optimization Scheduling Algorithm Based on Server Cluster [J]. Computer Science, 2022, 49(6A): 639-644.
[13] LIU Jian-mei, WANG Hong, MA Zhi. Optimization for Shor's Integer Factorization Algorithm Circuit [J]. Computer Science, 2022, 49(6A): 649-653.
[14] CHEN Bo-chen, TANG Wen-bing, HUANG Hong-yun, DING Zuo-hua. Pop-up Obstacles Avoidance for UAV Formation Based on Improved Artificial Potential Field [J]. Computer Science, 2022, 49(6A): 686-693.
[15] ZHANG Zhi-long, SHI Xian-jun, QIN Yu-feng. Diagnosis Strategy Optimization Method Based on Improved Quasi Depth Algorithm [J]. Computer Science, 2022, 49(6A): 729-732.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!