Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach |
scientific article; zbMATH DE number 617063
| 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; zbMATH DE number 617063 |
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
0 references
0 references
0 references
0 references
