Pages that link to "Item:Q4896432"

The following pages link to A Relationship Between CNF and DNF Systems Derivable from Examples (Q4896432):

Displaying 7 items.

• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions (Q969776) (← links)
• Generating logical expressions from positive and negative examples via a branch-and-bound approach (Q1318514) (← links)
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
• A heuristic for mining association rules in polynomial time. (Q1410915) (← links)
• An approach to guided learning of Boolean functions (Q1910784) (← links)
• On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
• An incremental learning algorithm for constructing Boolean functions from positive and negative examples (Q1941951) (← links)