An approach to guided learning of Boolean functions

DOI10.1016/0895-7177(95)00234-0MaRDI QIDQ1910784zbMATH OpenOpenAlexFDO

Authors Evangelos Triantaphyllou, Allen L. Soyster

Publication date 20 March 1996

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(95)00234-0

zbMATH Keywords

Boolean functioninductive inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• scientific article; zbMATH DE number 1054681
• An incremental learning algorithm for constructing Boolean functions from positive and negative examples
• Learning Boolean functions with queries

Cites work

• A continuous approach to inductive inference
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• A Relationship Between CNF and DNF Systems Derivable from Examples
• A theory of the learnable
• An interior point algorithm to solve computationally difficult set covering problems
• Bounding sample size with the Vapnik-Chervonenkis dimension
• Computational experience with an interior point algorithm on the satisfiability problem
• Computational limitations on learning from examples
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• scientific article; zbMATH DE number 940825 (Why is no real title available?)
• scientific article; zbMATH DE number 3326167 (Why is no real title available?)
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• Learnability and the Vapnik-Chervonenkis dimension
• Logic-based decision support. Mixed integer model formulation
• Modeling and integer programming techniques applied to propositional calculus
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Queries and concept learning
• Some results and experiments in programming techniques for propositional logic

Cited in

(11)

• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• An incremental learning algorithm for constructing Boolean functions from positive and negative examples
• Learning of bounded-weight Boolean functions
• An Algebraic Perspective on Boolean Function Learning
• LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
• scientific article; zbMATH DE number 2080652 (Why is no real title available?)
• scientific article; zbMATH DE number 6129640 (Why is no real title available?)
• A continuous approach to inductive inference
• Identifying the interacting positions of a protein using Boolean learning and support vector machines
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

This page was built for publication: An approach to guided learning of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910784)