We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...