151 search results - page 15 / 31 » Parallel computable higher type functionals (Extended Abstra... |
DLOG
2010
13 years 6 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
RTA
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
CG
2000
Springer
14 years 29 days ago
2000
Springer
Abstract. Over the years, various research projects have attempted to develop a chess program that learns to play well given little prior knowledge beyond the rules of the game. Ea...
ALP
1992
Springer
14 years 21 days ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....