1916 search results - page 180 / 384 » Reasoning with class algebra |
105
click to vote
CSL
2000
Springer
15 years 8 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
121
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
115
click to vote
ESSLLI
1999
Springer
15 years 8 months ago
1999
Springer
We recall the concept of a linguistic variable and the representation of its values (i.e. linguistic terms) by means of fuzzy sets. In this framework adverbs are represented by fuz...
TIME
1999
IEEE
15 years 8 months ago
1999
IEEE
In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to ha...
126
click to vote
WADT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured spe...