Guided inference of nested monotone Boolean functions

DOI10.1016/S0020-0255(03)00062-8zbMath1012.68668OpenAlexW2057729687MaRDI QIDQ1810471

Evangelos Triantaphyllou, Vetle I. Torvik

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

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

Related Items (2)

Speedup the optimization of maximal closure of a node-weighted directed acyclic graph ⋮ Guided inference of nested monotone Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guided inference of nested monotone Boolean functions
• Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
• On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
• A theory of the learnable
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• Monotone Discriminant Functions and Their Applications in Rheumatology
• A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
• On the optimal evaluation of monotonic Boolean functions
• A Generalization of Sampling Without Replacement From a Finite Universe

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