Sciweavers

66 search results - page 5 / 14
» The Conservation Theorem revisited
Sort
View
KBSE
2009
IEEE
14 years 2 months ago
Service Substitution Revisited
The current state of the art concerning the problem of service substitution raises the following issue: the complexity of the substitution process scales up with the number of ava...
Dionysis Athanasopoulos, Apostolos Zarras, Val&eac...
DMTCS
2010
128views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach
Using the saddle point method, we obtain from the generating function of the Stirling numbers of the first kind n j and Cauchy's integral formula, asymptotic results in centr...
Guy Louchard
CADE
2008
Springer
14 years 7 months ago
THF0 - The Core of the TPTP Language for Higher-Order Logic
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
Christoph Benzmüller, Florian Rabe, Geoff Sut...
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 7 months ago
A Note on Integer Factorization Using Lattices
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
Antonio Ignacio Vera
ICLP
1994
Springer
13 years 11 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner