Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Learning regular sets from queries and counterexamples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queries and concept learning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning conjunctions of Horn clauses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning nearly monotone \(k\)-term DNF / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone term decision lists / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On learning multivalued dependencies with queries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Read-twice DNF formulas are properly learnable / rank | |||
Normal rank |
Revision as of 07:27, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Learning a subclass of \(k\)-quasi-Horn formulas with membership queries |
scientific article |
Statements
Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (English)
0 references
28 March 2013
0 references
query learning
0 references
Boolean formulas
0 references
theory of computation
0 references
0 references