Guided inference of nested monotone Boolean functions

DOI10.1016/S0020-0255(03)00062-8MaRDI QIDQ1810471zbMATH OpenOpenAlexFDO

Authors Vetle I. Torvik, Evangelos Triantaphyllou

Publication date 9 June 2003

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(03)00062-8

zbMATH Keywords

Membership queriesAverage query complexityGuided inferenceNested monotone Boolean functionsPartially ordered sets (posets)Query selection criteria

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Database theory (68P15)

Recommendations

• Minimizing the average query complexity of learning monotone Boolean functions
• Exact learning Boolean functions via the monotone theory
• scientific article; zbMATH DE number 1617283
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• A fast and simple algorithm for identifying 2-monotonic positive Boolean functions

Cites work

• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 1453724 (Why is no real title available?)
• scientific article; zbMATH DE number 3297798 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
• A Generalization of Sampling Without Replacement From a Finite Universe
• A theory of the learnable
• Guided inference of nested monotone Boolean functions
• Minimizing the average query complexity of learning monotone Boolean functions
• Monotone Discriminant Functions and Their Applications in Rheumatology
• On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
• On the optimal evaluation of monotonic Boolean functions
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations

Cited in

(4)

• Minimizing the average query complexity of learning monotone Boolean functions
• scientific article; zbMATH DE number 517031 (Why is no real title available?)
• Guided inference of nested monotone Boolean functions
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph

This page was built for publication: Guided inference of nested monotone Boolean functions

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