Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coupon-collector problem revisited — a survey of engineering problems and computational methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sigma* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking function synthesis for bit-vector relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lower bound on the number of examples needed for learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory revision with queries: Horn, read-once, and parity formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On PAC learning algorithms for rich Boolean function classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining AI decisions using efficient methods for learning sparse Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of formal synthesis via inductive learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided quantifier instantiation for synthesis in SMT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic invariant generation for hybrid systems using ideal fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing invariants for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112634 / rank
 
Normal rank

Latest revision as of 19:33, 20 July 2024

scientific article
Language Label Description Also known as
English
Explaining AI decisions using efficient methods for learning sparse Boolean formulae
scientific article

    Statements

    Explaining AI decisions using efficient methods for learning sparse Boolean formulae (English)
    0 references
    0 references
    25 October 2019
    0 references
    explainable AI
    0 references
    Boolean formula learning
    0 references
    machine learning
    0 references
    formal methods
    0 references
    interpretable AI
    0 references
    sparse learning
    0 references

    Identifiers