Sciweavers

518 search results - page 26 / 104
» Automating Proofs in Category Theory
Sort
View
DAC
2002
ACM
16 years 21 days ago
Watermarking integer linear programming solutions
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...
Seapahn Megerian, Milenko Drinic, Miodrag Potkonja...
90
Voted
CSL
2001
Springer
15 years 4 months ago
Life without the Terminal Type
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
Lutz Schröder
90
Voted
LICS
2008
IEEE
15 years 6 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
JUCS
2007
71views more  JUCS 2007»
14 years 11 months ago
Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
Laurentiu Leustean
LORI
2009
Springer
15 years 6 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss