2841 search results - page 9 / 569 » A Call to Order |
RTA
2004
Springer
15 years 3 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we present a new approach to data modelling, called the concept-oriented model (CoM), and describe its main features and characteristics including data semantics and ...
ICEC
1994
14 years 11 months ago
1994
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...
97
Voted
CTRS
1992
15 years 1 months ago
1992
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
RSFDGRC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we propose a logical framework for reasoning about uncertain belief fusion. The framework is a combination of multi-agent epistemic logic and possibilistic...