Fast theta-subsumption with constraint satisfaction algorithms (Q5894895)

From MaRDI portal
Revision as of 12:38, 8 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2129657
Language Label Description Also known as
English
Fast theta-subsumption with constraint satisfaction algorithms
scientific article; zbMATH DE number 2129657

    Statements

    Fast theta-subsumption with constraint satisfaction algorithms (English)
    0 references
    0 references
    0 references
    19 January 2005
    0 references
    Relational learning
    0 references
    constraint satisfaction
    0 references
    phase transition
    0 references
    meta-learning
    0 references
    \(k\)-locality
    0 references

    Identifiers