An approach to guided learning of boolean functions

Authors:
E. Triantaphyllou;A. L. Soyster
Affiliations:
Department of Industrial and Manufacturing Systems Engineering 3128 CEBA Building, Louisiana State University, Baton Rouge, LA 70803-6409, U.S.A.;Department of Industrial and Management Systems Engineering 207 Hammond Building, Pennsylvania State University, University Park, PA 16802, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 20
Cited 4

A theory of the learnable

Communications of the ACM
Some results and experiments in programming techniques for propositional logic

Computers and Operations Research - Special issue: Applications of integer programming
A quantitative approach to logical inference

Decision Support Systems
Computation-oriented reductions of predicate to propositional logic

Decision Support Systems
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework

Artificial Intelligence
Computational limitations on learning from examples

Journal of the ACM (JACM)
Generalized resolution and cutting planes

Annals of Operations Research
Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
Modeling and integer programming techniques applied to propositional calculus

Computers and Operations Research - Special issue: Expert systems and operations research
Computational experience with an interior point algorithm on the satisfiability problem

Annals of Operations Research
Computational learning theory: survey and selected bibliography

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An interior point algorithm to solve computationally difficult set covering problems

Mathematical Programming: Series A and B - Special issue on interior point methods for linear programming: theory and practice
A continuous approach to inductive inference

Mathematical Programming: Series A and B
Generating logical expressions from positive and negative examples via a branch-and-bound approach

Computers and Operations Research
Learning Conjunctive Concepts in Structural Domains

Machine Learning
Learning Decision Lists

Machine Learning
Induction of Decision Trees

Machine Learning
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Learning disjunction of conjunctions

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

A feature mining based approach for the classification of text documents into disjoint classes

Information Processing and Management: an International Journal
An incremental learning algorithm for constructing boolean functions from positive and negative examples

Computers and Operations Research
Identifying the interacting positions of a protein using Boolean learning and support vector machines

Computational Biology and Chemistry
A Greedy Randomized Adaptive Search Procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

A critical aspect in the problem of inductive inference is the number of examples needed to accurately infer a Boolean function from positive and negative examples. In this paper, we develop an approach for deriving a sequence of examples for this problem. Some computer experiments indicate that, on the average, examples derived according to the proposed approach lead to the inference of the correct function considerably faster than when examples are derived in a random order.