cnfformula.families package

Submodules

• 3.1.2. cnfformula.families.coloring module
• 3.1.1. cnfformula.families.counting module
• 3.1.3. cnfformula.families.graphisomorphism module
• 3.1.4. cnfformula.families.ordering module
• 3.1.5. cnfformula.families.pebbling module
• 3.1.6. cnfformula.families.pigeonhole module
• 3.1.7. cnfformula.families.ramsey module
• 3.1.8. cnfformula.families.randomformulas module
• 3.1.13. cnfformula.families.simple module
• 3.1.9. cnfformula.families.subgraph module
• 3.1.10. cnfformula.families.subsetcardinality module
• 3.1.12. cnfformula.families.tseitin module

Module contents

Formula families useful in proof complexity

is_cnf_generator(func)

Test whether the object is a registered formula generator

Parameters:

func : a callable argument

the function to be registered.

Returns:

bool

register_cnf_generator(func)

Register the fucntion as a formula generator

This function decorator is used to declare that the function is indeed a formula generator. In this way the fucntion becomes accessible directly from cnfformua.families package.

Parameters:

func : a callable argument

the function to be registered.

Returns:

None

Raises:

AssertionError

when the argument is not a function