Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important r^ole in many important applications of automated deduction. In this paper, we ...
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Abstract. OWL DL, a new W3C ontology language recommendation, is based on the expressive description logic SHOIN. Although the ontology consistency problem for SHOIN is known to be...
We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capt...
Mathijs de Boer, Andreas Herzig, Tiago De Lima, Em...