首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
    
Separation logic is a successful logical system for formal reasoning about programs that mutate their data structures. Team semantics, on the other side, is the basis of modern logics of dependence and independence. Separation logic and team semantics have been introduced with quite different motivations, and are investigated by research communities with rather different backgrounds and objectives. Nevertheless, there are obvious similarities between these formalisms. Both separation logic and logics with team semantics involve the manipulation of second-order objects, such as heaps and teams, by first-order syntax without reference to second-order variables. Moreover, these semantical objects are closely related; it is for instance obvious that a heap can be seen as a team, and the separating conjunction of separation logic is (essentially) the same as the team-semantical disjunction. Based on such similarities, the possible connections between separation logic and team semantics have been raised as a question at several occasions, and lead to informal discussions between these research communities. The objective of this paper is to make this connection precise, and to study its potential but also its obstacles and limitations.  相似文献   

2.
    
Directed acyclic graphs (DAGs) constitute a qualitative representation for conditional independence (CI) properties of a probability distribution. It is known that every CI statement implied by the topology of a DAG is witnessed over it under a graph-theoretic criterion of d-separation. Alternatively, all such implied CI statements are derivable from the local independencies encoded by a DAG using the so-called semi-graphoid axioms. We consider Labeled Directed Acyclic Graphs (LDAGs) modeling graphically scenarios exhibiting context-specific independence (CSI). Such CSI statements are modeled by labeled edges, where labels encode contexts in which the edge vanishes. We study the problem of identifying all independence statements implied by the structure and the labels of an LDAG. We show that this problem is coNP-hard for LDAGs and formulate a sound extension of the semi-graphoid axioms for the derivation of such implied independencies. Finally we connect our study to certain qualitative versions of independence ubiquitous in database theory and teams semantics.  相似文献   

3.
    
In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.  相似文献   

4.
    
Tail dependence refers to clustering of extreme events. In the context of financial risk management, the clustering of high-severity risks has a devastating effect on the well-being of firms and is thus of pivotal importance in risk analysis.When it comes to quantifying the extent of tail dependence, it is generally agreed that measures of tail dependence must be independent of the marginal distributions of the risks but rather solely copula-dependent. Indeed, all classical measures of tail dependence are such, but they investigate the amount of tail dependence along the main diagonal of copulas, which has often little in common with the concentration of extremes in the copulas’ domain of definition.In this paper we urge that the classical measures of tail dependence may underestimate the level of tail dependence in copulas. For the Gaussian copula, however, we prove that the classical measures are maximal. The implication of the result is two-fold: On the one hand, it means that in the Gaussian case, the (weak) measures of tail dependence that have been reported and used are of utmost prudence, which must be a reassuring news for practitioners. On the other hand, it further encourages substitution of the Gaussian copula with other copulas that are more tail dependent.  相似文献   

5.
    
A correlation coefficient taking positive values is introduced. It is more easily understood than other correlation measures especially in social science contexts. Estimation issues are addressed. A data application is given.  相似文献   

6.
    
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics. To this end, we define inquisitive and dependence algebras and we investigate their model-theoretic properties. We then focus on finite, core-generated, well-connected inquisitive and dependence algebras: we show they witness the validity of formulas true in inquisitive algebras, and of formulas true in well-connected dependence algebras. Finally, we obtain representation theorems for finite, core-generated, well-connected, inquisitive and dependence algebras and we prove some results connecting team and algebraic semantics.  相似文献   

7.
    
  相似文献   

8.
    
Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural fragment of existential second-order logic with additive real arithmetic that captures exactly the expressivity of probabilistic inclusion logic. We furthermore relate these formalisms to linear programming, and doing so obtain PTIME data complexity for the logics. Moreover, on finite structures, we show that the full existential second-order logic with additive real arithmetic can only express NP properties. Lastly, we present a sound and complete axiomatization for probabilistic inclusion logic at the atomic level.  相似文献   

9.
Models characterizing the asymptotic dependence structures of bivariate distributions have been introduced by Ledford and Tawn (1996), among others, and diagnostics for such dependence behavior are presented in Coles et al. (1999). The following pages are intended as a supplement to the papers of Ledford and Tawn and Coles et al. In particular we focus on the coefficient of tail dependence, which we evaluate for a wide range of bivariate distributions. We find that for many commonly employed bivariate distributions there is little flexibility in the range of limiting dependence structure accommodated. Many distributions studied have coefficients of tail dependence corresponding to near independence or a strong form of dependence known as asymptotic dependence.  相似文献   

10.
沪深股市收益率的尾部相关函数   总被引:2,自引:0,他引:2  
尾部相关性是相关性分析中重要的一类,利用度量尾部相关性的指标χ,χ-以及尾部相关函数ρ(θ)来分析尾部相关性,并给出ρ(θ)的一种非参数估计方法.通过这两种方法研究上证综合指数和深证成分指数日收盘指数对数收益率在损失情况下的尾部相关性,结果表明两市指数日对数收益率具有很强的尾部相关性.  相似文献   

11.
A measure of pairwise extremal dependence for spatial processes, that is marginally invariant, is introduced. This measure enables decisions to be made about whether a spatial process is asymptotically dependent, asymptotically independent or independent for any pair of locations, thus it provides fundamental diagnostic information for understanding or modeling the extreme values of a spatial process. We illustrate the properties and use of this measure through theoretical examples and applications in hydrology and oceanography.  相似文献   

12.
    
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under the Boolean negation. Our logics employ new probabilistic atoms that resemble so-called extended atoms from the team semantics literature. We also define counterparts of our logics over metafinite structures and show that all of our logics can be translated into functional fixed point logic implying a polynomial time upper bound for data complexity with respect to BSS-computations.  相似文献   

13.
    
In this paper, we introduce and study a framework that is inspired by the team semantics for propositional dependence logic but deviates from it in several respects. Most importantly, instead of the two semantic layers used in dependence logic – possible worlds and teams – a whole hierarchy of contexts is introduced and different types of formulas are evaluated at different levels of this hierarchy. This leads to a rich stratification of informational types. In this framework, the dependence operator of dependence logic can be defined by the standard propositional connectives (negation, conjunction, disjunction and implication). We explore the formal aspects of this approach and apply it to a number of puzzling phenomena related to modalities and conditionals.  相似文献   

14.
A Comparison of Methods for Estimating the Extremal Index   总被引:1,自引:0,他引:1  
The extremal index, (01), is the key parameter when extending discussions of the limiting behavior of the extreme values from independent and identically distributed sequences to stationary sequences. As measures the limiting dependence of exceedances over a threshold u, as u tends to the upper endpoint of the distribution, it may not always be informative about the extremal dependence at levels of practical interest. Therefore we also consider a threshold-based extremal index, (u). We compare the performance of a range of different estimators for and (u) covering processes with < 1 and = 1. We find that the established methods for estimating actually estimate (u), so perform well only when (u) . For Markov processes, we introduce an estimator which is as good as the established methods when (u) but provides an improvement when (u) < = 1. We illustrate our methods using simulated data and daily rainfall measurements.  相似文献   

15.
    
We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.  相似文献   

16.
向量组线性相关性的教学方法与技巧   总被引:3,自引:0,他引:3  
向量组线性相关性是线性代数教学中的一项重要内容.由于概念比较抽象、定理难以理解,因此一直是线性代数教学环节中的一项难点.通过对向量组线性相关性的定义以及判断方法进行了形象的描述,建立向量组线性相关性与矩阵、线性方程组之间的关系,有利于学生理解向量组线性相关性的真正内涵与简便求解方法.  相似文献   

17.
    
  相似文献   

18.
The well-known M4 processes of Smith and Weissman are very flexible models for asymptotically dependent multivariate data. Extended M4 of Heffernan et al. allows to also account for asymptotic independence. In this paper we introduce a more general multivariate model comprising asymptotic dependence and independence, which has the extended M4 class as a particular case. We study properties of the proposed model. In particular, we compute the multivariate extremal index, tail dependence and extremal coefficients.  相似文献   

19.
In this paper the generalized Mahler type number Mh(g;A,T) is defined, and in the case of multiplicatively dependent parameters gi, hi(1 ≤ i ≤ s) the algebraic independence of the numbers Mhi (gi; A, T)(1 ≤ i ≤ s) is proved, where A and T are certain infinite sequences of non-negative integers and of positive integers, respectively. Furthermore, the algebraic independence result on values of a certain function connected with the generalized Mahler type number and its derivatives at algebraic numbers is also given.  相似文献   

20.
For a collection ofE-functions which is algebraically dependent over the field of rational functions, theorems on the algebraic independence of values of subcollections at algebraic points are proved. Translated fromMatematicheskie Zametki, Vol. 66, No. 3, pp. 452–458, September, 1999.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号