Generating logical expressions from positive and negative examples via a branch-and-bound approach
- 28 February 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (2) , 185-197
- https://doi.org/10.1016/0305-0548(94)90051-5
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Modeling and integer programming techniques applied to propositional calculusComputers & Operations Research, 1990
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Computation-oriented reductions of predicate to propositional logicDecision Support Systems, 1988
- Resolution vs. cutting plane solution of inference problems: Some computational experienceOperations Research Letters, 1988
- Induction of decision treesMachine Learning, 1986
- Some results and experiments in programming techniques for propositional logicComputers & Operations Research, 1986
- A theory of the learnableCommunications of the ACM, 1984
- Inductive learning of structural descriptions: Evaluation criteria and comparative review of selected methodsArtificial Intelligence, 1981