Abstract
This chapter discusses a revised branch-and-bound (B&B) algorithm for inferring a single clause (in CNF or DNF) from two disjoint sets of binary training examples. This algorithm is an extension of the B&B algorithm described in the previous chapter. Now the states of the search space are described by using more information and this seems to be critical in leading to good search results faster. This chapter is based on the developments first presented in [ Triantaphyllou, 1994].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). A Revised Branch-and-Bound Approach 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1630-3_3
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)