| Publication | Date of Publication | Type |
|---|
Computationally hard problems for logic programs under answer set semantics
ACM Transactions on Computational Logic | 2024-11-12 | Paper |
Capturing the polynomial hierarchy by second-order revised Krom logic
Logical Methods in Computer Science | 2023-08-26 | Paper |
| NP-logic systems and model-equivalence reductions | 2021-02-16 | Paper |
| A Logic that Captures $\beta$P on Ordered Structures | 2019-12-08 | Paper |
Reasoning about actions with loops via Hoare logic
Frontiers of Computer Science | 2019-01-22 | Paper |
| Unsatisfiable hitting clause-sets with three more clauses than variables | 2016-04-05 | Paper |
Proof systems for planning under 0-approximation semantics
Science China Information Sciences | 2015-11-20 | Paper |
| Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses | 2015-05-09 | Paper |
| Bounds for variables with few occurrences in conjunctive normal forms | 2014-08-04 | Paper |
On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Theoretical Computer Science | 2014-01-10 | Paper |
On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Jordan Areas and Grids
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Complexity of operators on compact sets
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Complexity and expressive power of second-order extended Horn logic
Mathematical Logic Quarterly | 2013-04-09 | Paper |
| Resolution for quantified monosigned formulae | 2011-09-29 | Paper |
On variables with few occurrences in conjunctive normal forms
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Transformations into normal forms for quantified circuits
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| Resolution on quantified generalized clause-sets | 2011-06-14 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
| Computable operators on co-regular subsets | 2009-07-22 | Paper |
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Linear CNF formulas and satisfiability
Discrete Applied Mathematics | 2009-06-30 | Paper |
| Computability of co-regular subsets on metric spaces | 2009-03-06 | Paper |
| Integrating nonmonotonic and temporal constraint reasoning | 2009-03-06 | Paper |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Theoretical Computer Science | 2008-11-18 | Paper |
| An extension of deficiency and minimal unsatisfiability of quantified Boolean formulas | 2008-06-11 | Paper |
| Representations of co-regular subsets on Euclidean spaces | 2008-01-14 | Paper |
| The complexity of some subclasses of minimal unsatisfiable formulas. | 2007-10-09 | Paper |
Minimal False Quantified Boolean Formulas
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Boolean functions as models for quantified Boolean formulas
Journal of Automated Reasoning | 2007-08-17 | Paper |
| Complexity results on minimal unsatisfiable formulas | 2007-05-02 | Paper |
Logic versus Approximation
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Extension and equivalence problems for clause minimal formulae
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2097605 (Why is no real title available?) | 2004-09-07 | Paper |
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics | 2003-09-15 | Paper |
Fixed-parameter tractability of disjunction-free default reasoning
Journal of Computer Science and Technology | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1876863 (Why is no real title available?) | 2003-06-02 | Paper |
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 2032416 (Why is no real title available?) | 2003-01-01 | Paper |
The complexity of read-once resolution
Annals of Mathematics and Artificial Intelligence | 2002-08-20 | Paper |
Consistency argument and classification problem in \(\lambda\)-calculus
Science in China. Series E | 2002-08-18 | Paper |
| scientific article; zbMATH DE number 1735624 (Why is no real title available?) | 2002-04-29 | Paper |
\(Y_C \Omega_{2n}\) are easy terms
Chinese Science Bulletin | 2002-02-18 | Paper |
| Satisfiable formulas closed under replacement | 2001-09-24 | Paper |
Complexity results for 2CNF default theories
Fundamenta Informaticae | 2001-07-23 | Paper |
Complexity results for restricted credulous default reasoning
AI Communications | 2001-03-19 | Paper |
More on bounding introspection in modal nonmonotonic logics
Acta Mathematica Sinica, English Series | 2001-03-12 | Paper |
Two tractable subclasses of minimal unsatisfiable formulas
Science in China. Series A | 2000-02-28 | Paper |
| scientific article; zbMATH DE number 1296809 (Why is no real title available?) | 1999-06-08 | Paper |
| scientific article; zbMATH DE number 1004160 (Why is no real title available?) | 1997-09-02 | Paper |
Axiom of choice in the model \(C\)
Chinese Science Bulletin | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 24341 (Why is no real title available?) | 1992-06-26 | Paper |
A consistency result of the system Z \(+\) the replacement axiom schema of \(\Sigma_ n\)-formulas
Chinese Science Bulletin | 1990-01-01 | Paper |
The consistencies ofMA, SOCA, OCA andISA withKT(ω2)
Acta Mathematica Sinica, English Series | 1990-01-01 | Paper |
