Pages that link to "Item:Q2786908"
From MaRDI portal
The following pages link to Compactly generating all satisfying truth assignments of a Horn formula (Q2786908):
Displaying 8 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Counting or producing all fixed cardinality transversals (Q472469) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Compressed representation of learning spaces (Q1679036) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
- Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function (Q2513325) (← links)
- On generating all solutions of generalized satisfiability problems (Q4389761) (← links)