Maximum renamable Horn sub-CNFs

Authors:
Endre Boros
Affiliations:
-
Venue:
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Year:
1999

Pseudo-boolean optimization

Discrete Applied Mathematics
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

Annals of Mathematics and Artificial Intelligence
On the size of maximum renamable Horn sub-CNF

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Domain permutation reduction for constraint satisfaction problems

Artificial Intelligence
On the size of maximum renamable Horn sub-CNF

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Horn upper bounds and renaming

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing

Hi-index	0.00