Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
We consider the problem of entity tagging: given one or more named entities from a specific domain, the goal is to automatically associate descriptive phrases, referred to as eta...
Kaushik Chakrabarti, Surajit Chaudhuri, Tao Cheng,...
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Spoken language interfaces based on interactive semantic language models [16, 14] allow probabilities for hypothesized words to be conditioned on the semantic interpretation of th...
Lane Schwartz, Luan Nguyen, Andrew Exley, William ...