The following pages link to Maximum renamable Horn sub-CNFs (Q1961445):
Displaying 6 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- On the size of maximum renamable Horn sub-CNF (Q2387435) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)