Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach |
scientific article |
Statements
Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (English)
0 references
11 August 1994
0 references
inductive inference
0 references
clause satisfiability problem
0 references
maximum clique
0 references
identifying a hidden Boolean function
0 references
artificial intelligence
0 references
branch- and-bound
0 references
Karmakar's interior point method
0 references
