Name
Abstract | ||
|---|---|---|
Description Logics (DLs) axe a family of knowledge representation formetlisms mainly chauracterised by constructors to build complex concepts and iroles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ACC extended with transitive eind inverse roles, role hierarchies, and quaJifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ACC extended with just transitive and inverse roles is still in PSPACE. Finally, we investigate the limits of decidability for this family of DLs. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-48242-3_11 | LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning |
Keywords | DocType | Volume |
role hierarchy,transitive eind inverse role,computationally problematical,knowledge representation,inverse role,complex concept,practical reasoning,description logics,expressive role constructor,dl acc,expressive description logics,early experiment,description logic | Conference | cs.LO/0005014 |
ISBN | Citations | PageRank |
3-540-66492-0 | 241 | 41.84 |
References | Authors | |
32 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ian Horrocks | 1 | 11731 | 1086.65 |
| Ulrike Sattler | 2 | 6177 | 478.47 |
| Stephan Tobies | 3 | 1599 | 158.86 |