1274 search results - page 108 / 255 » New Proofs for |
196
Voted
COMMA
2010
14 years 7 months ago
2010
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
CMA
2010
14 years 10 months ago
2010
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
SRDS
2006
IEEE
15 years 6 months ago
2006
IEEE
Distributed snapshots are an important building block for distributed systems, and, among other applications, are useful for constructing efficient checkpointing protocols. In ad...
85
Voted
TIT
2002
15 years 12 days ago
2002
Abstract--In this paper, we establish a one-to-one correspondence between information inequalities and group inequalities. The major implication of our result is that we can prove ...
108
click to vote
POPL
2010
ACM
15 years 29 days ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...