Results 1  10
of
15,752
Range Restriction for General Formulas
 Proc. 22nd Workshop on (Constraint) Logic Programming, WLP
, 2009
"... Abstract. Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time
A general formula for the WACC
 International Journal of Business
, 2006
"... Abstract Recent controversies testify that the tax shield valuation remains a hot topic in the financial literature. Basically, two methods have been proposed to incorporate the tax benefit of debt in the present value computation: The adjusted present value (APV), and the classical weighted averag ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
average cost of capital (WACC). This note clarifies the relationship between these two apparently different approaches by offering a general formula for the WACC. This formula encompasses earlier results obtained by
A GENERALIZED FORMULA OF HARDY
, 1992
"... ABSTRACT. We give new formulae applicable to the theory of partitions. Recent work suggests they also relate to quasicrystal structure and selfsimilarity. Other recent work has given continued fractions for the type of functions herein. Hardy originally gave such formulae as ours in early work on ..."
Abstract
 Add to MetaCart
ABSTRACT. We give new formulae applicable to the theory of partitions. Recent work suggests they also relate to quasicrystal structure and selfsimilarity. Other recent work has given continued fractions for the type of functions herein. Hardy originally gave such formulae as ours in early work
1 given by the general formula
, 1999
"... Let g = (gij) and ¯g = (¯gij) be C 2 –smooth metrics on the same manifold M n. Definition 1. The metrics g and ¯g are geodesically equivalent, if they have the same geodesics (considered as unparameterized curves). This is rather classical material. The first nontrivial examples of geodesically equi ..."
Abstract
 Add to MetaCart
Let g = (gij) and ¯g = (¯gij) be C 2 –smooth metrics on the same manifold M n. Definition 1. The metrics g and ¯g are geodesically equivalent, if they have the same geodesics (considered as unparameterized curves). This is rather classical material. The first nontrivial examples of geodesically equivalent metrics were constructed in 1865 by Beltrami see [2, 3]. In 1869 Dini [6] formulated the problem of local classification of geodesically equivalent metrics, and solved it for dimension two. In 1896 LeviCivita [7] obtained a local description of geodesically equivalent metrics on manifolds of arbitrary dimension. Many interesting results in this area were obtained by P. Painlevé, H. Weyl, E. Cartan, P. A. Shirokov, S. Kobayashi, N. S. Sinyukov, A. Z. Petrov, P. Venzi, J. Mikeˇs, A. V. Aminova, see [1, 11] for references. The main tool they used was tensor analysis, and the most results were local. The approach we would like to suggest is more global; in particular it helps to find an answer for the following questions: • What closed manifolds admit geodesically equivalent metrics? [10] • How many metrics are there geodesically equivalent to a given one? [11] Our approach is based on the following theorem. Denote by G: TM n → TM n the fiberwiselinear mapping given by the tensor g −1 ¯g = (g iα ¯gαj). In invariant terms, for any x0 ∈ M n the restriction of the mapping G to the tangent space Tx0M n is the linear transformation of Tx0M n such that for any vectors ξ, ν ∈ Tx0M n the dot product g(G(ξ), ν) of the vectors G(ξ) and ν in the metric g is equal to the dot product ¯g(ξ, ν) of the vectors ξ and ν in the metric ¯g. Consider the characteristic polynomial det(G − µE) = c0µ n + c1µ n−1 +... + cn. The coefficients c1,.., cn are smooth functions on the manifold M n, and c0 ≡ (−1) n. Consider the fiberwiselinear mappings
Learnability of relatively quantified generalized formulas
 In Proceedings of the 15th International Conference on Algorithmic Learning Theory (ALT 2004), volume 3244 of Lecture Notes in Computer Science
, 2004
"... Abstract. In this paper we study the learning complexity of a vast class of quantifed formulas called Relatively Quantified Generalized Formulas. This class of formulas is parameterized by a set of predicates, called a basis. We give a complete classification theorem, showing that every basis gives ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. In this paper we study the learning complexity of a vast class of quantifed formulas called Relatively Quantified Generalized Formulas. This class of formulas is parameterized by a set of predicates, called a basis. We give a complete classification theorem, showing that every basis gives
A General Formula for the Generation Time
"... We show that the generation time – a notion usually described in a biological context – can be defined in a general way as a return time in a conveniently constructed finite Markov chain. The simple formula we obtain agrees with previous results derived for structured populations projected in discre ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that the generation time – a notion usually described in a biological context – can be defined in a general way as a return time in a conveniently constructed finite Markov chain. The simple formula we obtain agrees with previous results derived for structured populations projected
A General Formula for Channel Capacity
"... AbstractA formula for the capacity of arbitrary singleuser channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the inputoutput inf information rate defined as the liminf in probability of ..."
Abstract
 Add to MetaCart
AbstractA formula for the capacity of arbitrary singleuser channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the inputoutput inf information rate defined as the liminf in probability
Results 1  10
of
15,752