中文版

Curriculum Vitae

Professor Dr. Xishun Zhao

Institute of Logic and Cognition

Sun Yat-Sen University

135 West Xingang road, 510275 Guangzhou, P.R. China

 

Telephone: 0086-20-84114036　

Fax: 0086-20-84110298

Email: ; hsszxs@mail.sysu.edu.cn;

 

Xishun Zhao (Ph.D. in Mathematics, Nanjing University, 1999) is Full Professor of Institute of Logic and Cognition at Sun Yat-Sen University. 　Since 1989, Xishun Zhao has been engaged in mathematical logic and theoretical research in Computer Science and Artificial Intelligence.

 

 

 

 

 

==================================================================================

 

Date and Place of Birth

14, Oct 1964, Henan Province, People’s Republic of China.

 

Nationality

People’s Republic of China.

 

Marital Status

Married

 

Education

1.      Bachelor Science Degree in Mathematics, September 1985, Henan Normal University, China

2.      Master Science Degree in Mathematics, June 1988, Institute of Software, Chinese Academy of Science, China

3.      Ph. D in Mathematics, December 1999, Nanjing University, China

 

Experience

1.      1988–1991, Lecturer, Henan Normal University, Department of Mathematics.

2.      1992–1996, Associate Professor, Henan Normal University, Department of Mathematics.

3.      1995–1996, Visiting Scholar, Institute of Software, Chinese Academy of Science.

4.      January 1999–March 1999, Visiting Scholar, Paderborn University, Department of Mathematics and Computer Science, Germany.

5.      January 2000, Professor, Henan Normal University, Department of Mathematics.

6.      April 2000–March 2001, Scientific Researcher, Paderborn University, Department of Mathematics and Computer Science, Germany.

7.      May 2001–, Professor, Sun Yat-sen University, Institute of Logic and Cognition.

8.      September 2002, Guest professor, International graduate school of Paderborn University, Germany.

9.      September 2003– November 2003, Scientific Researcher, Computer Science Department, Hongkong University of Science and Technology.

10.  July 2004–August 2004, Guest professor, Department of Electronic Engineering, Paderborn University, Germany.

 

Research grants

1.      Computational Complexity of Numerical Computing, National Natural Science Foundation of China.

2.      Computational Complexity of Intelligent Reasoning, The National Research Foundation for the Doctoral Program of Higher Education of China.

3.      Studies of Cognitive Logics, National Social Science Foundation of China.

4.      How to Extract Priorities from Knowledge Bases, a project from Sun Yat-Sen University.

5.      Fundamental Researches into Intelligent Logics, a project from 985 program of National Education Ministry of China.

6.      Hard Problems in Computer Science, National Natural Science Foundation of China.

7.      Researches into Chang’s Model C, National Natural Science Foundation of China.

 

Invited Contributions

1.      H, Kleine Buening, Xishun Zhao, Models for Quantified Boolean Formulas, …

2.      Xishun Zhao, Complexity Results on Minimal Unsatisfied Formulas, the 9th Asian Logic Conference, Russia, August 2005.

 

Professional Services

1.      Editor, Journal on Satisfiability, Boolean Modeling and Computation. http://www.isa.ewi.tudelft.nl/Jsat/

2.      Editor, Information Technology Journal, http://www.ansinet.org/c4p.php?j_id=itj

3.      Organizer: Guangzhou Symposium on Satisfiability and its Aplications.

4.      Referee/Reviewer: IJCAI2003, Journal of Computer Science and Technology, etc.

 

Selected Publications

  • NP-completeness of LCNF≥ k

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

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

  •  Fangzhen Lin, Zhao Xishun On Odd and Even Cycles in Normal Logic Programs, Proceedings of AAAI2004, 80-85.

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

  •  H. Kleine Buning, Xishun Zhao, Read–Once Unit Resolution, In Lecture Notes in Computer Science 2919, 356-369, Springer-Verlag, 2004.

  •  H. Kleine Buning, K. Subramani, Xishun Zhao, On Boolean Models for Quantified Boolean Horn Formulas, In Lecture Notes in Computer Scence 2919, 93-104, Springer-Verlag, 2004.

  •  H. Kleine Buning, Xishun Zhao, On the Structure of Some Classes of Minimal Unsatisfiable formulas, Discrete Applied Mathematics, 130 (2003), No.2, 185-207.

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

  •  Xishun Zhao, Complexity of Argument-Based Default Reasoning with Specificity, AI Communications, 16(2003), No.2, 107-119.

  • Xishun Zhao, Ding Decheng, On the Fixed Parameter Tractability of Disjunction-Free Default Reasoning, Journal of Computer Science and Technology, 18 (2003), 118-124.

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

  •  H. Kleine Buning, Xishun Zhao, Polynomial Time Algorithms for Computing a Representation for Minimal Unsatisfiable Formulas with Fixed Deficiency, Information Processing Letters, 84 (2002), 147-151.

  • H. Kleine Buning, Xishun Zhao, The Complexity of Read–Once Resolution, Annals of Mathematics and Artificial Intelligence, 36 (2002), 419-435.

  • H. Kleine Buening, Xishun Zhao, Satisfiable Formulas Closed under Replacement, Electronic Notes in Discrete Mathematics, vol. 9, Elsever Sceience, 2002.

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

  • Ding Decheng, H. Kleine Buening, Xishun Zhao, Minimal Falsity for QBF with Fixed Deficiency, In: Proc. of International Conference on Quantified Boolean Formulas, 21–28, Siena, Italy, 2001.

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

  • Xishun Zhao, Ding Decheng, More on Bounding Introspection in Modal Nonmonotonic Logic, Acta Math. Sinica, 16(2000), 555-564.

  • Xishun Zhao, Ding Decheng, et al, Complexity Results for Restricted Credulous Default Reasoning, AI Communications, 13(2000), 249-257.

  • Xishun Zhao, Ding decheng, Two Tractable Subclasses of Minimal Unsatisfiable formulas, Science in China, Series A, 42(1999), 720-731.

  • Xishun Zhao, Wang Ju, (Ycω2n) Are Easy Terms, Chinese Science Bulletin, 43(1998), 1707-1709.

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

  • Xishun Zhao, Ding Decheng, A Generalization to the Theory of Nonmonotonic Rule Systems, Journal of Chinese Advanced Software Research, 6 (1999), 292–304.

  • Xishun Zhao, Wang Ju, Large Cardinals and Model C (in Chinese), Chinese Advances in Mathematics, 25(1996), 525-531.

  • Xishun Zhao, Wang Ju, ω1-Ordinal Definable Sets and Chang’s Model C, Chinese Quarterly Journal of Mathematics, 13(1998), 98–106.

  • Wang Ju, Xishun Zhao An Extension Theorem on Finitely Axiomatizable Algebraic Equation Systems (in Chinese), Journal of Software, 10 (1999), No.3.

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

  •  Xishun Zhao, ω2-Aronszajn Trees and Martin’s Axiom (in Chinese), Acta Mathematics Sinica, 34(1991), 372–377.

  •  Xishun Zhao, The Consistencies of MA, SOCA, OCA and ISA with KT(ω2), Acta Mathematics Sinica, 6(1990), 42–46.

  • Xishun Zhao, 2^{ω0}–Trees in the Model C (in Chinese), Chinese Science Bulletin, 35(1990), 881-883.

  • Xishun Zhao, A Consistent Result for System Z+the Replacement Axiom Schema of Σn–formulas, Chinese Science Bulletin, 35 (1990), 979–980. The full version of this paper appears in Chinese Annals of Pure and Applied logic, 1(1989), 43-52.

  • Xishun Zhao, Wang Ju, Infinite Divergent Terms and Easy Terms (in Chinese), Chinese Science Bulletin, 40 (1995), 1819-1820.

  • Huang Qieyuan, Jian Ying, Xishun Zhao, Wang Ju, U-cyclic Terms and Easy Terms (in Chinese), Journal of Software, 7 (1996), 178-183.