Sciweavers

4324 search results - page 166 / 865
» A Generalized Representer Theorem
Sort
View
JUCS
2008
166views more  JUCS 2008»
15 years 4 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
JAR
2002
83views more  JAR 2002»
15 years 4 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter
JUCS
2010
106views more  JUCS 2010»
15 years 3 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
TCS
2010
15 years 3 months ago
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
Michele Pagani, Lorenzo Tortora de Falco
ICFP
2012
ACM
13 years 7 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens