1226 search results - page 81 / 246 » Proofs, Programs and Abstract Complexity |
129
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
140
click to vote
CSR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
130
click to vote
SIROCCO
2010
15 years 4 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
127
Voted
CADE
2001
Springer
16 years 3 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
125
click to vote
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...