6167 search results - page 1119 / 1234 » Can Refinement be Automated |
165
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
156
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
153
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
139
click to vote
DFG
2009
Springer
15 years 9 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
124
Voted
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We address the problem of providing a logical characterization of reasoning based on stereotypes. Following [6] we take a semantic perspective and we base our model on a ...