Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
On Exact Selection of Minimally Unsatisfiable Subformulae
Annals of Mathematics and Artificial Intelligence
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics
Finding models for blocked 3-SAT problems in linear time by systematical refinement of a sub-model
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
| Hi-index | 0.00 |