 | 2009 |
|---|
| 30 |       | Hans Kleine Büning,
Xishun Zhao,
Uwe Bubeck:
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.
SAT 2009: 391-397 |
| 29 | | Stefan Porschen,
Ewald Speckenmeyer,
Xishun Zhao:
Linear CNF formulas and satisfiability.
Discrete Applied Mathematics 157(5): 1046-1068 (2009) |
| 2008 |
|---|
| 28 |  | Hans Kleine Büning,
Xishun Zhao:
Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
Springer 2008 |
| 27 | | Xishun Zhao,
Norbert Th. Müller:
Complexity of Operators on Compact Sets.
Electr. Notes Theor. Comput. Sci. 202: 101-119 (2008) |
| 26 | | Norbert Th. Müller,
Xishun Zhao:
Jordan Areas and Grids.
Electr. Notes Theor. Comput. Sci. 221: 191-206 (2008) |
| 25 | | 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) |
| 2007 |
|---|
| 24 | | Hans Kleine Büning,
K. Subramani,
Xishun Zhao:
Boolean Functions as Models for Quantified Boolean Formulas.
J. Autom. Reasoning 39(1): 49-75 (2007) |
| 23 | | Hans Kleine Büning,
Xishun Zhao:
The Complexity of Some Subclasses of Minimal Unsatis able Formulas.
JSAT 3(1-2): 1-17 (2007) |
| 22 | | 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 |
|---|
| 21 | | Hans Kleine Büning,
Xishun Zhao:
Minimal False Quantified Boolean Formulas.
SAT 2006: 339-352 |
| 2005 |
|---|
| 20 | | Xishun Zhao,
Hans Kleine Büning:
Model-Equivalent Reductions.
SAT 2005: 355-370 |
| 19 | | Uwe Bubeck,
Hans Kleine Büning,
Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.
SAT 2005: 386-392 |
| 18 | | Hans Kleine Büning,
Xishun Zhao:
Extension and equivalence problems for clause minimal formulae.
Ann. Math. Artif. Intell. 43(1): 295-306 (2005) |
| 2004 |
|---|
| 17 | | Fangzhen Lin,
Xishun Zhao:
On Odd and Even Cycles in Normal Logic Programs.
AAAI 2004: 80-85 |
| 16 | | Hans Kleine Büning,
Xishun Zhao:
On Models for Quantified Boolean Formulas.
Logic versus Approximation 2004: 18-32 |
| 15 | | Hans Kleine Büning,
Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas.
SAT 2004 |
| 14 | | Hans Kleine Büning,
Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas.
SAT (Selected Papers 2004: 224-234 |
| 13 | | Xishun Zhao:
Regular Disjunction-Free Default Theories.
J. Comput. Sci. Technol. 19(3): 329-340 (2004) |
| 2003 |
|---|
| 12 | | Hans Kleine Büning,
Xishun Zhao:
Read-Once Unit Resolution.
SAT 2003: 356-369 |
| 11 | | Hans Kleine Büning,
K. Subramani,
Xishun Zhao:
On Boolean Models for Quantified Boolean Horn Formulas.
SAT 2003: 93-104 |
| 10 | | Xishun Zhao:
Complexity of argument-based default reasoning with specificity.
AI Commun. 16(2): 107-119 (2003) |
| 9 | | Hans Kleine Büning,
Xishun Zhao:
On the structure of some classes of minimal unsatisfiable formulas.
Discrete Applied Mathematics 130(2): 185-207 (2003) |
| 8 | | Xishun Zhao,
Decheng Ding:
Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.
J. Comput. Sci. Technol. 18(1): 118-124 (2003) |
| 2002 |
|---|
| 7 | | Hans Kleine Büning,
Xishun Zhao:
The Complexity of Read-Once Resolution.
Ann. Math. Artif. Intell. 36(4): 419-435 (2002) |
| 6 | | Xishun Zhao,
Paolo Liberatore:
Complexity of the Unique Extension Problem in Default Logic.
Fundam. Inform. 53(1): 79-104 (2002) |
| 5 | | 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 |
|---|
| 4 | | Hans Kleine Büning,
Xishun Zhao:
Satisfiable Formulas Closed Under Replacement.
Electronic Notes in Discrete Mathematics 9: 48-58 (2001) |
| 3 | | Xishun Zhao,
Decheng Ding:
Complexity Results for 2CNF Default Theories.
Fundam. Inform. 45(4): 393-404 (2001) |
| 2 | | Xishun Zhao,
Decheng Ding:
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.
Fundam. Inform. 48(1): 93-106 (2001) |
| 2000 |
|---|
| 1 | | Xishun Zhao,
Decheng Ding,
Hans Kleine Büning:
Complexity Results for Restricted Credulous Default Reasoning.
AI Commun. 13(4): 249-258 (2000) |
