29 search results - page 4 / 6 » Deciding ALBO with Tableau |
LICS
1991
IEEE
13 years 9 months ago
1991
IEEE
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 ...
TABLEAUX
1998
Springer
13 years 10 months ago
1998
Springer
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 ...
JAR
2007
13 years 6 months ago
2007
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...
JAR
2007
13 years 6 months ago
2007
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...
DALT
2009
Springer
13 years 11 months ago
2009
Springer
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...