1322 search results - page 142 / 265 » Unsound Theorem Proving |
137
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
138
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
132
click to vote
MKM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...
130
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
130
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...