NIPS
2001
14 years 28 days ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
ICFP
2003
ACM
14 years 11 months ago
2003
ACM
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...