611 search results - page 17 / 123 » Yuri, Logic, and Computer Science |
119
click to vote
STACS
2007
Springer
15 years 12 months ago
2007
Springer
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
154
click to vote
RELMICS
1998
Springer
15 years 10 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
110
Voted
MFCS
2009
Springer
16 years 10 days ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
156
click to vote
ICCS
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
187
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...