6274 search results - page 156 / 1255 » Proofs, Programs, Processes |
209
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
170
click to vote
JSAT
2008
15 years 6 months ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
184
click to vote
WOLLIC
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
148
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known...
156
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...