Abstract
The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use non-simple roles - that is, transitive roles or their super-roles - in number restrictions. When modeling composite objects, for example in bio-medical ontologies, this restriction can pose problems.X Therefore, we take a closer look at the problem of counting over non-simple roles. On the one hand, we sharpen the known undecidability results and demonstrate that: (i) for DLs with inverse roles, counting over non-simple roles leads to undecidability even when there is only one role in the language; (ii) for DLs without inverses, two transitive and an arbitrary role are sufficient for undecidability. On the other hand, we demonstrate that counting over non-simple roles does not compromise decidability in the absence of inverse roles provided that certain restrictions on role inclusion axioms are satisfied. © Springer-Verlag Berlin Heidelberg 2007.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
Publisher | Springer Nature |
Pages | 303-317 |
Number of pages | 14 |
Volume | 4790 |
ISBN (Print) | 9783540755586 |
Publication status | Published - 2007 |
Event | 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2007 - Yerevan Duration: 1 Jul 2007 → … http://www.cs.man.ac.uk/ sattler/publications/KaSZ-LPAR07.pdf |
Publication series
Name | LNCS |
---|
Conference
Conference | 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2007 |
---|---|
City | Yerevan |
Period | 1/07/07 → … |
Internet address |