3793 search results - page 749 / 759 » Expressive Description Logics |
117
click to vote
CCA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
DBPL
1995
Springer
15 years 1 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
ISPW
1991
IEEE
15 years 1 months ago
1991
IEEE
product and the project as well as to define synchronization (or interaction) abstractions; activity definitions are used to model the process activities that transform the produ...
MFCS
1991
Springer
15 years 1 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
HT
1987
ACM
15 years 1 months ago
1987
ACM
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...