We introduce and study term functions over fuzzy hyperalgebras. We start from this idea that the set of nonzero fuzzy subsets of a fuzzy hyperalgebra can be organized naturally as...
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
Benjamin Van Durme, Phillip Michalak, Lenhart Schu...
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...