DKL: an efficient algorithm for learning deterministic Kripke structures
From MaRDI portal
Recommendations
- Learning with Kernels in Description Logics
- Proper learning of \(k\)-term DNF formulas from satisfying assignments
- Exact learning of DNF formulas using DNF hypotheses
- scientific article; zbMATH DE number 4078840
- Learning nearly monotone k-term DNF
- kLog: a language for logical and relational learning with kernels
- Fast learning of \(k\)-term DNF formulas with queries.
- Structure learning of probabilistic logic programs by searching the clause space
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1418458 (Why is no real title available?)
- A note on the number of queries needed to identify regular languages
- Counterexample-guided abstraction refinement for symbolic model checking
- Incremental learning-based testing for reactive systems
- Language identification in the limit
- Learning Meets Verification
- Learning automata from ordered examples
- Learning regular sets from queries and counterexamples
This page was built for publication: DKL: an efficient algorithm for learning deterministic Kripke structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824283)