Inference of a minimum size boolean function from examples by using a new efficient branch-and-bound approach
- 1 July 1994
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 5 (1) , 69-94
- https://doi.org/10.1007/bf01097004
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Generating logical expressions from positive and negative examples via a branch-and-bound approachComputers & Operations Research, 1994
- A continuous approach to inductive inferenceMathematical Programming, 1992
- An interior point algorithm to solve computationally difficult set covering problemsMathematical Programming, 1991
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Modeling and integer programming techniques applied to propositional calculusComputers & Operations Research, 1990
- Computational limitations on learning from examplesJournal of the ACM, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Some results and experiments in programming techniques for propositional logicComputers & Operations Research, 1986
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983
- A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant TableIEEE Transactions on Electronic Computers, 1965