2501 search results - page 459 / 501 » Logics with Rank Operators |
141
click to vote
POPL
1998
ACM
15 years 8 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
154
click to vote
RSCTC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Institutional databases can be instrumental in understanding a business process, but additional data may broaden the empirical perspective on the investigated process. We...
176
click to vote
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
136
click to vote
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Robots are autonomous agents whose actions are performed in the real world during a period of time. There are a number of general constraints on such actions, for example that the ...
125
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...