Sciweavers

425 search results - page 11 / 85
» The TPS Theorem Proving System
Sort
View
100
Voted
PPCP
1993
15 years 1 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
JAT
2006
66views more  JAT 2006»
14 years 9 months ago
An extrapolation theorem for nonlinear approximation and its applications
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
Feng Dai
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
15 years 4 months ago
Applications of the general Lyapunov ISS small-gain theorem for networks
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
Sergey Dashkovskiy, Björn Rüffer, Fabian...
JSYML
2008
73views more  JSYML 2008»
14 years 9 months ago
Examining fragments of the quantified propositional calculus
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
Steven Perron
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
15 years 3 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner