Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Xishun Zhao
2010 – today
- 2013
[j23]Yuping Shen, Xishun Zhao: Proof Systems for Planning Under Cautious Semantics. Minds and Machines 23(1): 5-45 (2013)- [j22]Shiguang Feng, Xishun Zhao: Complexity and expressive power of second-order extended Horn logic. Math. Log. Q. 59(1-2): 4-11 (2013)
- [j21]Oliver Kullmann, Xishun Zhao: On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. 492: 70-87 (2013)
- 2012
- [c14]Oliver Kullmann, Xishun Zhao: On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT 2012: 270-283
- [i3]Oliver Kullmann, Xishun Zhao: On Davis-Putnam reductions for minimally unsatisfiable clause-sets. CoRR abs/1202.2600 (2012)
- 2011
- [c13]Oliver Kullmann, Xishun Zhao: On Variables with Few Occurrences in Conjunctive Normal Forms. SAT 2011: 33-46
- [c12]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck: Transformations into Normal Forms for Quantified Circuits. SAT 2011: 245-258
- [i2]Xishun Zhao, Yuping Shen: Proof System for Plan Verification under 0-Approximation Semantics. CoRR abs/1108.5943 (2011)
- 2010
- [j20]
- [c11]
- [i1]Oliver Kullmann, Xishun Zhao: On variables with few occurrences in conjunctive normal forms. CoRR abs/1010.5756 (2010)
2000 – 2009
- 2009
- [j19]Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao: Linear CNF formulas and satisfiability. Discrete Applied Mathematics 157(5): 1046-1068 (2009)
- [c10]Hans Kleine Büning, Xishun Zhao, Uwe Bubeck: Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. SAT 2009: 391-397
- 2008
- [j18]Xishun Zhao, Norbert Th. Müller: Complexity of Operators on Compact Sets. Electr. Notes Theor. Comput. Sci. 202: 101-119 (2008)
- [j17]Norbert Th. Müller, Xishun Zhao: Jordan Areas and Grids. Electr. Notes Theor. Comput. Sci. 221: 191-206 (2008)
- [j16]Hans Kleine Büning, Xishun Zhao: Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407(1-3): 448-457 (2008)
- [e1]Hans Kleine Büning, Xishun Zhao (Eds.): Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Lecture Notes in Computer Science 4996, Springer 2008, ISBN 978-3-540-79718-0
- 2007
- [j15]Hans Kleine Büning, K. Subramani, Xishun Zhao: Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reasoning 39(1): 49-75 (2007)
- [j14]Hans Kleine Büning, Xishun Zhao: The Complexity of Some Subclasses of Minimal Unsatis able Formulas. JSAT 3(1-2): 1-17 (2007)
- [j13]Hans Kleine Büning, Xishun Zhao: An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. JSAT 3(3-4): 115-123 (2007)
- 2006
- [c9]
- 2005
- [j12]Hans Kleine Büning, Xishun Zhao: Extension and equivalence problems for clause minimal formulae. Ann. Math. Artif. Intell. 43(1): 295-306 (2005)
- [c8]
- [c7]Uwe Bubeck, Hans Kleine Büning, Xishun Zhao: Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. SAT 2005: 386-392
- 2004
- [j11]Xishun Zhao: Regular Disjunction-Free Default Theories. J. Comput. Sci. Technol. 19(3): 329-340 (2004)
- [c6]
- [c5]Hans Kleine Büning, Xishun Zhao: On Models for Quantified Boolean Formulas. Logic versus Approximation 2004: 18-32
- [c4]
- [c3]Hans Kleine Büning, Xishun Zhao: Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers 2004: 224-234
- 2003
- [j10]Xishun Zhao: Complexity of argument-based default reasoning with specificity. AI Commun. 16(2): 107-119 (2003)
- [j9]Hans Kleine Büning, Xishun Zhao: On the structure of some classes of minimal unsatisfiable formulas. Discrete Applied Mathematics 130(2): 185-207 (2003)
- [j8]Xishun Zhao, Decheng Ding: Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. 18(1): 118-124 (2003)
- [c2]Hans Kleine Büning, K. Subramani, Xishun Zhao: On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104
- [c1]
- 2002
- [j7]Hans Kleine Büning, Xishun Zhao: The Complexity of Read-Once Resolution. Ann. Math. Artif. Intell. 36(4): 419-435 (2002)
- [j6]Xishun Zhao, Paolo Liberatore: Complexity of the Unique Extension Problem in Default Logic. Fundam. Inform. 53(1): 79-104 (2002)
- [j5]Hans Kleine Büning, Xishun Zhao: Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Inf. Process. Lett. 84(3): 147-151 (2002)
- 2001
- [j4]Hans Kleine Büning, Xishun Zhao: Satisfiable Formulas Closed Under Replacement. Electronic Notes in Discrete Mathematics 9: 48-58 (2001)
- [j3]Xishun Zhao, Decheng Ding: Complexity Results for 2CNF Default Theories. Fundam. Inform. 45(4): 393-404 (2001)
- [j2]Xishun Zhao, Decheng Ding: Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Inform. 48(1): 93-106 (2001)
- 2000
- [j1]Xishun Zhao, Decheng Ding, Hans Kleine Büning: Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:45 CEST by the dblp team