C-CLASSIC is a variant of CLASSIC in which concept learning is theoretically tractable (following the PAC-learning settings). C-CLASSIC is an extension of C-CLASSIC with the connec-tives (default) and (exception) allowing to incorpore default knowledge within concept denitions. Previous work was concerned with both deductive aspects (semantics, subsumption) and in-ductive aspects (PAC-learnabil...

[This corrects the article DOI: 10.4103/1008-682X.153543.] In published paper by Watanabe, the [Figure 3] on page 905 is incorrect, because of a mistake on computer processing. The correct [Figure 3] follows. The author apologizes to the readers for this careless mistake.

We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = Õ ( 1 t ) where t is the number of trials. The lower bound for the mistake probability is [HLW94]

JEL code: C72 keywords: evolution, mutation rates, mistakes ¤The authors are grateful for helpful comments from one referee and one associate editor of this journal, as well as from Sjaak Hurkens, Jens Josephson, Alexander Matros, Arthur Robson, Maria Saez-Marti and Philippe Solal, and participants at seminars at the London School of Economics, the EEA 1999 congress in Santiago di Compostela, a...

Moreover, I also demonstrate that the available data are consistent with the view that at birth the only difference between the hemispheres is that the left hemisphere has more computational power. This implies that the evolution of asymmetries could be the direct result of the evolution of a general physical asymmetry (in size at birth, oxygenization, metabolic rate, perinatal maturation rate)...

We study the problem of completing a binary matrix in an online learning setting. On each trial we predict a matrix entry and then receive the true entry. We propose a Matrix Exponentiated Gradient algorithm [1] to solve this problem. We provide a mistake bound for the algorithm, which scales with the margin complexity [2, 3] of the underlying matrix. The bound suggests an interpretation where ...

I explore the effect of accounting complexity on misreporting using a setting of revenue restatements. I measure revenue recognition complexity using a factor score based on the number of words and revenue recognition methods from the revenue recognition disclosure in the 10-K just prior to the restatement announcement. Results are consistent with revenue recognition complexity increasing the p...

The original version of this article unfortunately contained a mistake.