Born

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

Nationality

•People's Republic of China.

Marital Satus

•Married.

Current Position

•Professor, Institute of Logic and Cognition, Sun Yat-sen University

Current Research Interests

  • Expressive Power and Computational Complexity
  • Satisfiability
  • Timed Action Language

Address

Xishun Zhao
Institute of Logic and Cognition
Sun Yat-sen University
135 West Xingang Road
Guangzhou, 510275

P. R. China

Tel: 0086–20–84037271 (Home)
0086–20–84114036 (Office)
Fax: 0086–20–84110298
Email: hsszxs(a)mail.sysu.edu.cn

Education

  • 1997–1999, Ph. D. in Mathematics, Nanjing University, China.
  • 1985–1988, Master Science Degree in Mathematics, Institute of Software, Chinese Academy of Science.
  • 1981–1985, Bachelor Science Degree in Mathematics, Henan Normal University, China.

Experience

  • August 2007–October 2007, Visiting Professor, Department of Computer Science, Trier University, Germany.
  • December 2005–February 2006, Visiting Professor, Department of Theoretical Computer Science, Hagen University, Germany.
  • October 2005–November 2005, Guest Professor, Department of Computer Science, Paderborn University, Germany.
  • July 2004–August 2004, Guest Professor, Department of Electronic Engineering, Paderborn University, Germany.
  • September 2003– November 2003, Scientific Researcher, Computer Science Department, Hongkong University of Science and Technology.
  • September 2002, Guest Professor, International graduate school of Paderborn University, Germany.
  • September 2002, Guest Professor, International graduate school of Paderborn University, Germany.
  • May 2001–, Professor, Sun Yat-sen University, Institute of Logic and Cognition.
  • April 2000–March 2001, Scientific Researcher, Paderborn University, Department of Mathematics and Computer Science, Germany.
  • January 2000, Professor, Henan Normal University, Department of Mathematics
  • January 1999–March 1999, Visiting Scholar, Paderborn University, Department of Mathematics and Computer Science, Germany.
  • 1995–1996, Visiting Scholar, Institute of Software, Chinese Academy of Science.
  • 1992–1996, Associate Professor, Department of Mathematics, Henan Normal University, China.
  • 1988–1991, Lecturer, Department of Mathematics, Henan Normal University, China.

Research Grants

  • 2006–2008, Algorithmic and Theoretical Researches into Quantified Boolean Formulas, Natural Science Foundation of China (NFSC No. 60573011).
  • 2006–2008, Expressive Power and Computation Complexity, a MOE Project for Key Institutes of China (No. 05JJD72040122).
  • 2005–2007, Computational Complexity of Numerical Computing, National Natural Science Foundation of China (No. 10410638).
  • 2002–2004, Computational Complexity of Intelligent Reasoning, The National Research Foundation for the Doctoral Program of Higher Education of China.
  • 2002–2004, Studies of Cognitive Logics, National Social Science Foundation of China.
  • 2002–2006, Fundamental Researches into Intelligent Logics, a project from 985 program of National Education Ministry of China.
  • 2003–2005, Hard Problems in Computer Science, National Natural Science Foundation of China.
  • 2001–2003, How to Extract Priorities from Knowledge Bases, a project from Sun Yat-Sen University.
  • 1992–1994, Researches into Changs Model C, National Natural Science Foundation of China.

Invited Contributions

  • Xishun Zhao, Complexity Results on Minimal Unsatisfied Formulas, the 9th Asian Logic Conference, Russia, August 2005.
  • Xishun Zhao, Model Theoryand Complexity of Quantified Boolean Formulas, International Conference on Computability, Complexity and Randomness (CCR08), Nanjing, China, 2008.

Professional Services

  • co-Editor of Lecture Notes in Computer Science 4996, Springer, 2008.
  • co-Chair, The 11th International Conference on Theory and Applications of SatisfiabilityTesting (SAT08), May12–15, Guangzhou, China.
  • Organizer, Guangzhou Symposium on Satisfiabilityin Logic-Based Modeling, 2006.
  • Editor, Journal on Satisfiability, Boolean Modeling and Computation.
    http://www.isa.ewi.tudelft.nl/Jsat/
  • Editor, Information TechnologyJournal.
  • Organizer: Guangzhou Symposium on Satisfiability and its Applications, 2004.
  • Referee/Reviewer: IJCAI2003, Journal of Computer Science and Technology, etc.

Publications

[44] Hans Kleine Buening, Xishun Zhao,Computational Complexity of Quantified Boolean Formulas with Fixed Maximal Deficiency, Theoretical Computer Science, in press (see doi:10.11016/j.tcs.2008.07.022).

[43] Stefan Porshen, Ewald Speckenmeyer, Xishun Zhao, Linear CNF Formulas and Satisfiability, Discrete Applied Mathematics, in press (see doi:10.1016/j.dam.2008.03.031).

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

[41] 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.

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

[39]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.

[38]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.

[37] Hans Kleine Buneing, Xishun Zhao, Minimal False Quantified Boolean Formulas, In Lecture Notes in Computer Science 4121, 339-352, Springer, 2006.

[36] Yuping Shen, Xishun Zhao, Real-time Answer Set Programming, KR2006, Poster.

[35] Xishun Zhao, Hans Kleine Buning, Model-equivalent Reductions, In Lecture Notes in Computer Science 3569, 355-370, Springer-Verlag, 2005

[34]Uwe Bubeck, Hans Kleine Buning, Xishun Zhao, Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas, In Lecture Notes in Computer Science 3569, 386-392, Springer-Verlag, 2005

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

[32] H. Kleine Buning, Xishun Zhao, Equivalence Models for Quantified Boolean Formulas, In Lecture Notes in Computer Science 3542, 224-234, Springer-Verlag, 2005.

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

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

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

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

[27] 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.

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

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

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

[23] Xishun Zhao, DingDecheng, On the Fixed Parameter Tractability of Disjunction-Free Default Reasoning, Journal of Computer Science and Technology, 18(2003), 118-124.

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

[21]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.

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

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

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

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

[16] MR 1 813 451 Xishun Zhao, DingDecheng, More on Bounding Introspection in Modal Nonmonotonic Logic, Acta Math. Sinica, 16(2000), 555-564

[15]MR 2001m:68160 Xishun Zhao, Ding Decheng, et al, Complexity Results for Restricted Credulous Default Reasoning, AI Communications, 13(2000), 249-257

[14] MR 2000g:68059 Xishun Zhao, Ding decheng, Two Tractable Subclasses of Minimal Unsatisfiable formulas, Science in China, Series A, 42(1999), 720-731

[13] MR 2000b:03053 Xishun Zhao, Wang Ju, (YcΩ2n)Are Easy Terms, Chinese Science Bulletin, 43(1998), 1707-1709

[12]MR 2000k:03039 WangJu, Xishun Zhao, et al, Consistency Argument and Classification Problem in Lambda-Calculas, Science in China, Series E, 42(1999), 502–506

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

[10] MR 98c:03104 Xishun Zhao, Wang Ju, Large Cardinals and Model C (in Chinese), Chinese Advances in Mathematics, 25(1996), 525-531

[9] MR 2001a:03105 Xishun Zhao, WangJu, ω1-Ordinal Definable Sets and Chang's Model C, Chinese Quarterly Journal of Mathematics, 13(1998), 98–106.

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

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

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

[5]MR 92h:03079 Xishun Zhao, ω2-Aronszajn Trees and Martin's Axiom (in Chinese), Acta Mathematics Sinica, 34(1991), 372–377.

[4] MR 94j:03110 Xishun Zhao, Axiom of Choice in the Model C, Chinese Science Bulletin, 35(1990), 1849–1852.

[3] MR 91k:03131 Xishun Zhao, The Consistencies of MA, SOCA, OCAand ISAwith KT(ω2), Acta Mathematics Sinica, 6(1990), 42–46.

[2] MR 1 142 004 Xishun Zhao, 2ω0–Trees in the Model C(in Chinese), Chinese Science Bulletin, 35(1990), 881-883.

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

2008-10-25 10:49:23