Ph.D. Candidate
Computer Science Department
Stanford University
Using logical constraints to improve the quality of query answers over unreliable data.
Additional interests: data integration & warehousing, possibilistic & probabilistic databases, logical spreadsheets, general game playing, computational law.
J.-Y. Kao, N. Rampersad, J. Shallit, M. Silva. Words avoiding repetitions in arithmetic progressions. Theoretical Computer Science. 410, 47-49 (Nov. 2009), 5010-5021. [abstract|paper|preprint]
J.-Y. Kao. Computing query answers with consistent support - a Ph.D. project proposal. IDAR 2009. [paper|presentation]
T. L. Hinrichs, J.-Y. Kao, and M. Genesereth. Inconsistency-tolerant reasoning with classical logic and large databases. SARA 2009. [abstract|presentation]
J.-Y. Kao, J. Shallit and Z. Xu. The Frobenius Problem in a Free Monoid. STACS 2008. [abstract|paper|preprint|proceedings]
J.-Y. Kao, N. Rampersad, J. Shallit, M. Silva. Words avoiding repetitions in arithmetic progressions. Theoretical Computer Science. 391, 1-2 (Feb. 2008), 126-137. [abstract|paper|preprint]
My Erdős number is 2.