Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learnability of quantified formulas
Theoretical Computer Science
SIGACT news complexity theory column 42
ACM SIGACT News
SIGACT news complexity theory column 43
ACM SIGACT News
Implementing a Test for Tractability
Constraints
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Information Processing Letters
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
On a quasi-ordering on Boolean functions
Theoretical Computer Science
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
The complexity of constraint satisfaction games and QCSP
Information and Computation
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Information Processing Letters
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
The complexity of generalized satisfiability for linear temporal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
Generalized modal satisfiability
Journal of Computer and System Sciences
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
On the applicability of Post's lattice
Information Processing Letters
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |