1054 search results - page 158 / 211 » A Logic Language of Granular Computing |
121
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
136
Voted
REX
1991
15 years 6 months ago
1991
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
159
click to vote
SAC
2008
ACM
15 years 2 months ago
2008
ACM
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
152
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
135
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...