131 search results - page 20 / 27 » An Equational Re-engineering of Set Theories |
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we introduce a novel approach for simultaneous restoration and segmentation of blurred, noisy images by approaching a variant of the Mumford-Shah functional from a ...
TACS
1991
Springer
15 years 28 days ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
ENTCS
2006
14 years 9 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
104
click to vote
CCS
2005
ACM
15 years 3 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...