47 search results - page 3 / 10 » Representing Nested Inductive Types Using W-Types |
CATS
2007
13 years 7 months ago
2007
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
IJCAI
1997
13 years 7 months ago
1997
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
ESOP
2009
Springer
13 years 10 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
AAAI
1997
13 years 7 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
ICMAS
2000
13 years 7 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...