Discrete decision theory: manipulations

DOI10.1016/0304-3975(87)90130-7zbMath0643.68155OpenAlexW2115218192MaRDI QIDQ1102136

J. Robin B. Cockett

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90130-7

zbMATH Keywords

coalgebrasdecision trees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)

Related Items

Discrete decision theory: manipulations ⋮ Stochastic Decision Theory ⋮ FINDING SMALL EQUIVALENT DECISION TREES IS HARD

Cites Work

• Discrete decision theory: manipulations
• Constructing optimal binary decision trees is NP-complete
• Decision tree reduction
• Varieties of ”If-Then-Else“
• Optimizing decision trees through heuristically guided search
• Diagonal algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete decision theory: manipulations