1582 search results - page 71 / 317 » On Higher-Order Description Logics |
DLOG
2010
14 years 8 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
AAAI
2011
13 years 10 months ago
2011
A general game player automatically learns to play arbitrary new games solely by being told their rules. For this purpose games are specified in the game description language GDL...
103
click to vote
AAAI
2007
15 years 6 days ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
JAR
2007
14 years 9 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...
112
click to vote
DLOG
1998
14 years 11 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...