1302 search results - page 113 / 261 » Fair Equivalence Relations |
169
click to vote
ECSQARU
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
156
click to vote
FOSSACS
2000
Springer
15 years 9 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
194
click to vote
JELIA
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
178
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...