Polynomial certificates for propositional classes
From MaRDI portal
Publication:2495655
Recommendations
Cites work
- A theory of the learnable
- Algorithmic Learning Theory
- Conjunctions of unate DNF formulas: Learning and structure
- Exact learning of DNF formulas using DNF hypotheses
- First-order \(jk\)-clausal theories are PAC-learnable
- How many queries are needed to learn?
- scientific article; zbMATH DE number 1104356 (Why is no real title available?)
- scientific article; zbMATH DE number 1453030 (Why is no real title available?)
- Inductive Logic Programming
- Knowledge compilation and theory approximation
- Learnability and the Vapnik-Chervonenkis dimension
- Learning closed Horn expressions
- Learning conjunctions of Horn clauses
- Learning function-free Horn expressions
- Learning to reason with a restricted view
- Logical settings for concept-learning
- On sentences which are true of direct unions of algebras
- Polynomial certificates for propositional classes.
- Queries and concept learning
- Queries revisited.
- Reasoning with models
- The decision problem for some classes of sentences without quantifiers
Cited in
(5)
This page was built for publication: Polynomial certificates for propositional classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495655)