598 search results - page 62 / 120 » Optimized Reasoning in Description Logics Using Hypertableau... |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
105
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
ILP
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
IJCAI
1993
14 years 11 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...