赵希顺

姓名:赵希顺;籍贯:河南省封丘县; 出生:1964

任职:

教育部重点研究基地中山大学逻辑与认知研究所教授、博士生导师

国际杂志“Journal of Satisifability, Boolean Modeling and Computation”编委

SAT Association 的steering committee成员(2008-2012)

美国加州州立大学数学系兼职教授(2008-2012)

研究兴趣: 

数理逻辑及其在计算机科学和人工智能中的应用

教育背景: 

1985年毕业于河南师范大学数学系学士学位

1988年获中国科学院软件研究所硕士学位

1999年获南京大学数学系博士学位

职业经历: 

1988.6-1997.3, 河南师范大学数学系工作

2000.4-2001.3, 德国Paderborn大学数学与计算机系工作

2001.5至今       中山大学逻辑与认知研究所

主要荣誉: 

2005年,入选教育部“新世纪优秀人才”支持计划

2006年,著作《选择公理》荣获第四届全国高校人文社科优秀成果二等奖

2006年,荣获中山大学文科优秀中青年学者桐山奖

2008年,获教育部高校自然科学奖二等奖

代表性论文: 

1.    Hans Kleine Buening, Xishun Zhao, Uwe Bubeck, Transformations into Normal Forms for Quantified Circuits, To appear in LNCS 6695, Springer.

2.    Oliver Kullmann, Xishun Zhao, On Variables with Fewer Occurrences in CNF, To appear in LNCS 6695, Springer.

3.    Yuping Shen, Guangrui Dang and Xishun Zhao, Reasoning about Action and Change in Timed Domian, Proceedings of NMR2010, Toronto, Canada, May 2010.

4.    Yuping Shen, Xishun Zhao, NP-Logic Systems and Model-Equivalent Reduction, Electronic Proceedings in Theoretical Computer Scicence, 24 (2010), 130-138

5.    Jiwei Jin, Xishun Zhao, Resolution on Quantified Generalized Clause-sets, Journal on Satisfiability, Boolean Modeling and Computation, 7(2010),17-34.

6.    金继伟,赵希顺, 量化单一代表公式的消解,中山大学学报(自然科学版),49(2010),No 1,20-23。

7.    Jin Jiwei, Zhao Xishun, Resolution for Quantified Signed Formulas, 暨南大学学报(自然科学版),30(2009),第5期,487-4493。

8.    Hans Kleine Buening, Xishun Zhao, Uwe Bubeck, Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits, Lecture Notes in Computer Science 5584, 391-397.

9.    Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao, Linear CNF Formulas and Satisfiability, Discrete Applied Mathematics, 157(2009),1046-1068.

10.  Hans Kleine Buening, Xishun Zhao, Computational Complexity of Quantified Boolean Formulas with Fixed Maximal Deficiency, Theoretical Computer Science,407(2008),448-457.

11.   Norbert Mueller, Xishun Zhao, Jordan Areas and Grids, Electronic Notes in Theoretical Computer Science 221(2008),191-206.

12.  Xishun Zhao, Norbert Muller, Complexity of Operators on Compact Sets, Electronic Notes in Computer Science, 202, 101-119, 2008.

13.  Xishun Zhao, Yuping Shen, Comparison of Semantics of Disjunctive Logic Programs Based on Model-equivalent Reduction, Journal of Computer Science and Technology, 22(4), 567-573, 2007.

14.  Yuping Shen, XIshun Zhao, An Answer Set Programming System with Cycle Breaking Heuristic, Journal of oftware, 19(2008), 869-878.

15.  Hans Kleine Buning, K. Subramani, Xishun Zhao, Boolean Functions as Models for Quantified Boolean Formulas, Journal of Automated Reasoning, 39(1), 49-75, 2007.

16.  Hans Kleine Buning, Xishun Zhao, The Complexity of Some Subclasses of Minimal Unsatisfiable Formulas, Journal on Satisfiability, Boolean Modeling and Computation, 3, 1-17, 2007.

17.  Hans Kleine Buning, Xishun Zhao, An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas, Journal on Satisfiability, Boolean Modeling and Computation, 3, 115-123, 2007.

18.  Xishun Zhao, Complexity Results on Minimal Unsatisfiable Formulas, Mathematical Logic in Asia, 301-318, World Scientific, 2006.

19.  H. Kleine Buening, Xishun Zhao, Minimal Fasle Quantified Boolean Formulas, Lecture Notes in Computer Science 4121, Springer, 2006

20.  Xishun Zhao, H. Kleine Buening, Model-Equivalent Reductions, Lecture Notes in Computer Science 3569, Springer, 2005

21.  U. Bubeck, H. Kleine Buening, Xishun Zhao, Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas, Lecture Notes in Computer Science 3569, Springer, 2005.

22.  H. Kleine Buening, Xishun Zhao, Extension and Equivalent Problems for Clause Minimal Formulae, Annals of Mathematics and Artificial Intelligence, 43 (2005),295-306.

23.  H. Kleine Buening, Xishun Zhao, Equivalence Models for Quantified Boolean Formulas, Lecture Notes in Computer Science 3075,  Springer, 2004

24.  H. Kleine Buening, Xishun Zhao, On Models for Quantified Boolean Formulas, Lecture Notes in Computer Science 3075, 18-32, Springer-Verlag, 2004.

25.  Xishun Zhao, Regular Disjunctive-Free Default Theories, Journal of Computer Science and Technology, 19 (2004), 329-340.

26.  Fangzhen Lin, Xishun Zhao,On Odd and Even Cycles in Normal Logic Programs. AAAI2004: 80-85.

27.  H. Kleine Buening, Xishun Zhao, Read-Once Unit Resolution,In Lecture Notes in Computer Science 2919, 356-369, 2004.

28.  H. Kleine Buening, K.Subramani Xishun Zhao, On Boolean Models for Quantified Boolean Horn Formulas,In Lecture Notes in Computer Science 2919, 93-104, 2004. (with H. Kleien Buening)

29.  Xishun Zhao, Complexity of Argument-Based Default Reasoning with Specificity, AI Communications----The European Journal on Artificial Intelligence, 16 (2003), 107-119.

30.  Xishun Zhao, Decheng Ding, A Method of Finding Priorities in Default Theories, Journal of Software, 14 (2003), 1530-1537. (with Decheng Ding)

31.  H. Kleine Buening, Xishun Zhao, On the Structure of Some Classes of Minimal Unsatisfiable Formulas, Discrete Applied Mathematics, 130 (2003), 185-207.

32.  Xishun Zhao, Decheng Ding, On the Fixed Parameterized Complexity of disjunction-free Default Reasoning,J. Computer Science and Technology, 18 (2003), 118-124.

33.  H. Kleine Buening, Xishun Zhao, Complexity of Read-Once Resolution,Annals of Mathematics and Artificial Intelligence, 36 (2002), 435.

34.  Xishun Zhao, P. Liberatore, Complexity of Unique Extension Problem in Default Logic,Fundamenta Informaticae,  53 (2002), 79-104.

35.  H. Kleine Buening, Xishun Zhao, Polynomial Time Algorithms for Computing Representations for Minimal Unsatisfiable Formulas,Information Processing Letters, 84 (2002), 147-151. (with H. Kleine Buening)

36.  Xishun Zhao, Decheng Ding, Some Algorithms for Extension Computation of Nonmonotonic Rule Systems,Fundamenta Informaticae, 48 (2001), 93-106.

37.  H. Kleine Buening, Xishun Zhao, Satisfiable Formulas Closed under Replacement, Electronic Notes in Discrete Mathematics 9, Elservier Science, 2001.

38.  Xishun Zhao, Decheng Ding, Complexity Results for 2CNF Default Theories, Fundamenta Informaticae, 45 (2001), 393-404. (with Decheng Ding)

39.  Xishun Zhao, Decheng Ding, H. Kleine Buening, Complexity Results for Restricted Credulous Default Reasoning, AI Communications----The European Journal of Artificial Intelligence, 13 (2000), 249-257.

40.  Xishun Zhao, Decheng Ding, More on Bounding Introspection in Modal Non-monotonic Logic, Acta Mathematica Sinica, 16 (2000), 555-564.

41.  Xishun Zhao, Decheng Ding, Two Tractable Subclasses of Minimal Unsatisfiable Formulas, Science in China, 42(1999)

42.  Xishun Zhao, Decheng Ding, A Generalization to the Theory of Nonmonotonic Rule Systems, Chinese Journal of Advanved Software Research, 6 (1999).

43.  Wang Ju, Xishun Zhao, et al, Consistency Argument and Classification Problem in Lambda-Calculas, Science in China, Series E, 42 (1999).

44.  Xishun Zhao, Wang Ju, (YcΩ2n) Are Easy Terms, Chinese Science Bulletin, 43 (1998).

45.  Xishun Zhao, Wang Ju, ω1-Definable Sets and Chang’s Model C, Chinese Quarterly Math, 13 (1998).

46.  Zhao Xishun, A Consistency Result of System Z + the Replacement Axiom Schema of Σn-formulas, Chinese Science Bulletin, 35(1990),979-980。

47.  Zhao Xihsun, The Consistency of MA, SOCA, OCA, ISA and ISA with KT(ω2), Acta Mathematica Sinica, 6(1990), 42-46.

48.  Zhao Xishun, Axiom of Choice in the Model C, Chinese Science Bulletin, 35(1990),1849-1852.

49.  赵希顺,王驹,模型C中的大基数,数学进展,25(1996),525-531。

50.  赵希顺,ω2-Aronszajn数与Marin公理,数学学报,34(1991),371-277。

51.  赵希顺,模型C中的2ω-树,科学通报,35(1990),881--883.

出版专(译)著: 

1.选择公理,人民出版社,2003 (独著)

2.数学百科全书(1—5卷), 科学出版社,1992—1997。(翻译44个条目)。

3.  Lecture Notes in Computer Science 4996, Springer (editor)

科研项目: 

1.    二阶逻辑的表达能力与计算复杂性,国家自然科学基金项目(60970040)

2.    度量空间上的计算复杂性理论,国家自然科学基金国际合作项目(11011130039)

3.    计算机科学的数学基础,国家自然科学基金国际合作项目 (10911130012)

4.    量化布尔公式的理论与算法研究,国家自然科学基金项目(60573011)

5.    第11届可满足性问题的理论与应用国际会议国家自然科学基金国际合作项目(60810306006)

6.    表达能力与计算复杂性研究,教育部人文社科基地重大招标项目(05JJD72040122)。

7.    关于数值计算、可计算性及计算复杂性的数学基础,国家自然科学基金重大国际(地区)合作研究项目(10410638),负责子课题:数值计算的复杂性。

8.    教育部“新世纪优秀人才”支持计划,2005

9.    智能逻辑推理的复杂性研究,教育部博士点基金(01JB72040001)

10.  面向认知的逻辑学研究,国家社科规划项目(02BZX046)。

11.   聘请境外专家项目, 教育部, 主持。

12.  智能推理中优先序的获取,中山大学重大发展项目,主持。2002

13.  Chang氏模型C的研究,国家自然科学基金(19101011)(1992-1994)

讲授课程: 

数理逻辑、可计算性理论、模型论、计算复杂性