The Complexity of Resolution with Generalized Symmetry Rules
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
Annals of Mathematics and Artificial Intelligence
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Discrete Applied Mathematics
A Propositional Proof System with Quantification Over Permutations
Fundamenta Informaticae
A Propositional Proof System with Quantification Over Permutations
Fundamenta Informaticae
Hi-index | 0.00 |