The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xishun Zhao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fangzhen Lin, Xishun Zhao
    On Odd and Even Cycles in Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:80-85 [Conf]
  2. Hans Kleine Büning, Xishun Zhao
    On Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    Logic versus Approximation, 2004, pp:18-32 [Conf]
  3. Uwe Bubeck, Hans Kleine Büning, Xishun Zhao
    Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:386-392 [Conf]
  4. Hans Kleine Büning, K. Subramani, Xishun Zhao
    On Boolean Models for Quantified Boolean Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:93-104 [Conf]
  5. Hans Kleine Büning, Xishun Zhao
    Read-Once Unit Resolution. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:356-369 [Conf]
  6. Hans Kleine Büning, Xishun Zhao
    Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  7. Hans Kleine Büning, Xishun Zhao
    Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:224-234 [Conf]
  8. Hans Kleine Büning, Xishun Zhao
    Minimal False Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:339-352 [Conf]
  9. Xishun Zhao, Hans Kleine Büning
    Model-Equivalent Reductions. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:355-370 [Conf]
  10. Xishun Zhao
    Complexity of argument-based default reasoning with specificity. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2003, v:16, n:2, pp:107-119 [Journal]
  11. Xishun Zhao, Decheng Ding, Hans Kleine Büning
    Complexity Results for Restricted Credulous Default Reasoning. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:4, pp:249-258 [Journal]
  12. Hans Kleine Büning, Xishun Zhao
    The Complexity of Read-Once Resolution. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2002, v:36, n:4, pp:419-435 [Journal]
  13. Hans Kleine Büning, Xishun Zhao
    Extension and equivalence problems for clause minimal formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:295-306 [Journal]
  14. Hans Kleine Büning, Xishun Zhao
    On the structure of some classes of minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:185-207 [Journal]
  15. Xishun Zhao, Decheng Ding
    Complexity Results for 2CNF Default Theories. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:4, pp:393-404 [Journal]
  16. Xishun Zhao, Paolo Liberatore
    Complexity of the Unique Extension Problem in Default Logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:53, n:1, pp:79-104 [Journal]
  17. Xishun Zhao, Decheng Ding
    Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:48, n:1, pp:93-106 [Journal]
  18. Hans Kleine Büning, Xishun Zhao
    Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:147-151 [Journal]
  19. Xishun Zhao
    Regular Disjunction-Free Default Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2004, v:19, n:3, pp:329-340 [Journal]
  20. Xishun Zhao, Decheng Ding
    Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2003, v:18, n:1, pp:118-124 [Journal]
  21. Hans Kleine Büning, K. Subramani, Xishun Zhao
    Boolean Functions as Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:39, n:1, pp:49-75 [Journal]

  22. Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. [Citation Graph (, )][DBLP]


  23. NP-Logic Systems and Model-Equivalence Reductions [Citation Graph (, )][DBLP]


  24. Linear CNF formulas and satisfiability. [Citation Graph (, )][DBLP]


  25. Complexity of Operators on Compact Sets. [Citation Graph (, )][DBLP]


  26. Jordan Areas and Grids. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002