scientific article; zbMATH DE number 3894495
From MaRDI portal
Publication:5186757
An elementary algorithm is presented which constructs a propositional formula \[ (1)\quad A_ 1\vee A_ 2\vee...\vee A_ n\leftrightarrow B \] characterizing an event B by a disjunction of sufficient conditions \(A_ i\) in such a way that (1) is true in a set of learning examples.
Recommendations
- scientific article; zbMATH DE number 863013
- scientific article; zbMATH DE number 2100042
- Automated constructivization of proofs
- scientific article; zbMATH DE number 4117898
- Automating theories in intuitionistic logic
- Automatic theorem proving in paraconsistent logics: Theory and implementation
- scientific article; zbMATH DE number 4164174
- scientific article; zbMATH DE number 63734
- scientific article; zbMATH DE number 6938205
- scientific article; zbMATH DE number 978243
Cited in
(6)- Rapid construction of algebraic axioms from samples
- A learning procedure for mathematics.
- The study on algorithm \(\text{AE}_{11}\) of learning from examples
- scientific article; zbMATH DE number 2100042 (Why is no real title available?)
- Automated generation of analytic calculi for logics with linearity
- scientific article; zbMATH DE number 6938205 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5186757)