全文获取类型
收费全文 | 95篇 |
免费 | 1篇 |
国内免费 | 1篇 |
专业分类
力学 | 1篇 |
综合类 | 2篇 |
数学 | 89篇 |
物理学 | 5篇 |
出版年
2022年 | 11篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2014年 | 6篇 |
2012年 | 2篇 |
2011年 | 6篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 1篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1992年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有97条查询结果,搜索用时 15 毫秒
71.
Michael Kohlhase 《Mathematics in Computer Science》2008,2(2):279-304
One of the great problems of Mathematical Knowledge Management (MKM) systems is to obtain access to a sufficiently large corpus
of mathematical knowledge to allow the management/search/navigation techniques developed by the community to display their
strength. Such systems usually expect the mathematical knowledge they operate on in the form of semantically enhanced documents,
but mathematicians and publishers in Mathematics have heavily invested into the format and workflow.
We analyze the current practice of semi-semantic markup in documents and extend it by a markup infrastructure that allows to embed semantic annotations into documents without changing their visual appearance. This collection of macro packages is called (semantic ) as it allows to markup documents semantically without leaving the time-tried workflow, essentially turning into an MKM format. At the heart of is a definition mechanism for semantic macros for mathematical objects and a non-standard scoping construct for them, which
is oriented at the semantic dependency relation rather than the document structure.
We evaluate the macro collection on a large case study: the course materials of a two-semester course in Computer Science was annotated semantically
and converted to the OMDoc MKM format by Bruce Miller’s LaTeXML system.
相似文献
72.
Domain理论与拓扑 总被引:9,自引:1,他引:8
Domain理论作为计算机程序设计语言研究的数学基础,序和拓扑的相互结合在这一领域中起着基本而重要的作用,本文力图从Domain理论产生的背景,它在几个方面的发展,反映Domain理论与拓扑的紧密联系,使我们看到序和拓扑的结合怎样应用于程序设计语言研究。 相似文献
73.
信任本体的形式化语义研究 总被引:1,自引:0,他引:1
针对现有的信任模型缺少信任相关概念属性在数理上的定义以及严格可靠的信任语义推理和统一的形式化抽象模型的问题,本文提出形式化动态信任本体的概念,结合本体在语义层次的形式化描述方法,对实体信任、行为信任和区域信任进行本体化,并对三种信任本体进行形式化语义演绎和推理.给出了信任相关属性的形式化理论分析,并通过典型的激发场景实例,有效地验证了信任本体化理论. 相似文献
74.
《Annals of Pure and Applied Logic》2022,173(9):103155
75.
Raine Rönnholm 《Annals of Pure and Applied Logic》2019,170(9):1070-1099
In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence logic. By observing the translations, we see that the expressive power of EXC[k] lies in between k-ary and ()-ary dependence logics. We will show that, at least in the case when , both of these inclusions are proper.In a recent work by the author it was shown that k-ary inclusion-exclusion logic is equivalent with k-ary existential second order logic, ESO[k]. We will show that, on the level of sentences, it is possible to simulate inclusion atoms with exclusion atoms, and in this way express ESO[k]-sentences by using only k-ary exclusion atoms. For this translation we also need to introduce a novel method for “unifying” the values of certain variables in a team. As a consequence, EXC[k] captures ESO[k] on the level of sentences, and we obtain a strict arity hierarchy for exclusion logic. It also follows that k-ary inclusion logic is strictly weaker than EXC[k].Finally we use similar techniques to formulate a translation from ESO[k] to k-ary inclusion logic with an alternative strict semantics. Consequently, for any arity fragment of inclusion logic, strict semantics is strictly more expressive than lax semantics. 相似文献
76.
Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy. 相似文献
77.
Pierre-Louis Curien 《数学进展》2005,34(5):513-544
《线性逻辑和态极逻辑引论》一文概述了由Girard分别于1986和2001所创建的线性逻辑和态极逻辑.线性逻辑和态极逻辑汲取于计算机科学并反之应用于其中,从根本上对数理逻辑进行了彻底的审视.全文分为两部分.本文是文章的第一部分,致力于线性逻辑的联结词、证明规则、可判定性性质和模型.文章的第二部分将研究证明网并简要介绍态极逻辑.证明网是证明的图式表示,是线性逻辑的主要创新之一. 相似文献
78.
We refine implemented backtracking algorithms for a number of problems related to Dung's argumentation frameworks. Under admissible, preferred, complete, stable, semi stable, and ideal semantics we add enhancements, what are so-called global looking-ahead pruning strategies, to the-state-of-the-art implementations of two problems. First, we tackle the extension enumeration problem: constructing some/all set(s) of acceptable arguments of a given argumentation framework. Second, we address the acceptance decision problem: deciding whether an argument is in some/all set(s) of accepted arguments of a given argumentation framework. The experiments that we report show that the speedup gain of the new enhancements is quite significant. 相似文献
79.
We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to the atomic subformulas in a reversible way. The procedure goes from the whole to the parts against the compositionality-principle and gives rise to a semantic characterization for a new form of quantum logic that has been called “Łukasiewicz quantum computational logic”. It is interesting to compare the logic based on qubit-semantics with that on qudit-semantics. Having in mind the relationships between classical logic and Łukasiewicz-many valued logics, one could expect that the former is stronger than the fragment of the latter. However, this is not the case. From an intuitive point of view, this can be explained by recalling that the former is a very weak form of logic. Many important logical arguments, which are valid either in Birkhoff and von Neumann’s quantum logic or in classical logic, are generally violated. 相似文献
80.
In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic programming semantics and argumentation semantics. In particular, we are able to show equivalence between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics. 相似文献