We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...