... operators [A] and A , where A is a finite automaton over alphabet R We call [A] (resp A ) a universal (resp existential) automaton-modal operator Automaton-modal operators were used earlier, among ... assertions of the form A( a) or r (a, b) A knowledge base R, T , A is called a Horn- RegI knowledge base if T is a Horn- RegI TBox and A is a Horn- RegI ABox When T is a clausal Horn- RegI TBox and A is a reduced ... Nguyen, A Szałas, ExpTime tableau decision procedures for regular grammar logics with converse, Studia Logica 98 (3) (2011) 387–428 [22] L Nguyen, A Szałas, On the Horn fragments of serial regular...