An approach to guided learning of Boolean functions

DOI10.1016/0895-7177(95)00234-0zbMath0843.68099OpenAlexW2018219877MaRDI QIDQ1910784

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)

Related Items (4)

Identifying the interacting positions of a protein using Boolean learning and support vector machines ⋮ An incremental learning algorithm for constructing Boolean functions from positive and negative examples ⋮ A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions ⋮ Generating logical expressions from positive and negative examples via a branch-and-bound approach

Cites Work

• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Computational experience with an interior point algorithm on the satisfiability problem
• Modeling and integer programming techniques applied to propositional calculus
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• Some results and experiments in programming techniques for propositional logic
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• An interior point algorithm to solve computationally difficult set covering problems
• Bounding sample size with the Vapnik-Chervonenkis dimension
• Logic-based decision support. Mixed integer model formulation
• 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
• Queries and concept learning
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• A Relationship Between CNF and DNF Systems Derivable from Examples

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