Simplifying Binary Propositional Theories into Connected Components Twice as Fast
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Polynomial certificates for propositional classes
Information and Computation
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
New Algorithms for k-Center and Extensions
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Polynomial certificates for propositional classes
Information and Computation
Minimum 2CNF resolution refutations in polynomial time
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A new bound for an NP-hard subclass of 3-SAT using backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On weighted efficient total domination
Journal of Discrete Algorithms
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |