Abstract
The previous two chapters discussed the development and key mathematical properties of some branch-and-bound (B&B) branch-and-bound (B&B) approaches for inferring a Boolean function in the form of a compact (i.e., with as few clauses as possible) CNF or DNF expression from two collections of disjoint examples. As was described in Chapters 2 and 3, the B&B approaches may take a long time to run (actually, they are of exponential time complexity).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Triantaphyllou, E. (2010). Some Fast Heuristics for Inferring a Boolean Function from Examples. In: Data Mining and Knowledge Discovery via Logic-Based Methods. Springer Optimization and Its Applications, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1630-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1630-3_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1629-7
Online ISBN: 978-1-4419-1630-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)