140 search results - page 6 / 28 » On Expressive Number Restrictions in Description Logics |
EACL
2003
ACL Anthology
13 years 9 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
CAV
1999
Springer
13 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
DLOG
2011
12 years 11 months ago
2011
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
DLOG
2007
13 years 10 months ago
2007
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...