全文获取类型
收费全文 | 99篇 |
免费 | 1篇 |
国内免费 | 3篇 |
专业分类
化学 | 5篇 |
力学 | 2篇 |
综合类 | 2篇 |
数学 | 89篇 |
物理学 | 5篇 |
出版年
2022年 | 11篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2014年 | 6篇 |
2012年 | 2篇 |
2011年 | 6篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 1篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1992年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有103条查询结果,搜索用时 15 毫秒
21.
22.
We prove that the class of stable models is incomplete with respect to pure λ-calculus. More precisely, we show that no stable model has the same theory as the strongly stable version of Park's model. This incompleteness proof can be adapted to the continuous case, giving an incompleteness proof for this case which is much simpler than the original proof by Honsell and Ronchi della Rocca. Moreover, we isolate a very simple finite set,
, of equations and inequations, which has neither a stable nor a continuous model, and which is included in
and in
, the contextual theory induced by the set of essentially λI-closed terms. Finally, using an approximation theorem suitable for a large class of models (in particular stable and strongly stable non-sensible models like
and
), we prove that
and
are included in
, giving an operational meaning to the equality in these models. 相似文献
23.
Claudia Zepeda José Luis Carballido 《Journal of Algorithms in Cognition, Informatics and Logic》2009,64(1):41-50
The research community has long recognized the study of non-monotonic reasoning (NMR) as a promising approach to model features of commonsense reasoning. We study one of the semantics that are useful to formalize NMR, called the p-stable semantics. We introduce three different formats for normal programs: negative normal programs, restricted negative normal programs and strong kernel programs. These forms help to simplify the search of p-stable models of the original program. One of the main results of this paper indicates that the p-stable semantics for strong kernel programs is the same as the stable semantics. This way, all the applications based on stable semantics for those kernel programs (defined in [S. Costantini, A. Provetti, Normal forms for answer set programming, J. Theory Pract. Log. Program. 5 (2005) 747-760]) that are strong kernel programs can also be based on the p-stable semantics. 相似文献
24.
The theory of prototypes provides a new semantic interpretation of vague concepts. In particular, the calculus derived from this interpretation results in the same calculus as label semantics proposed by Lawry. In the theory of prototypes, each basic linguistic label L has the form ‘about P’, where P is a set of prototypes of L and the neighborhood size of the underlying concept is described by the word ‘about’ which represents a probability density function δ on [0,+∞). In this paper we propose an approach to vague information coarsening based on the theory of prototypes. Moreover, we propose a framework for linguistic modelling within the theory of prototypes, in which the rules are concise and transparent. We then present a linguistic rule induction method from training data based on information coarsening and data clustering. Finally, we apply this linguistic modelling method to some benchmark time series prediction problems, which show that our linguistic modelling and information coarsening methods are potentially powerful tools for linguistic modelling and uncertain reasoning. 相似文献
25.
软件Agent遇到语义二义性时无法正确地为用户解决矛盾问题.利用本体支持语义互操作的特点,在软件Agent策略生成机制中引入复合元本体,加入Agent智能引导的人机交互方法,实现了具有语义歧义消除能力的可拓策略生成系统.当用户输入的问题信息语义模糊时,Agent根据本体中的知识与用户交互,逐步理解用户的信息语义,直到能为用户生成解决矛盾问题的策略.以旅游与购物问题为例进行了实验,结果表明了软件Agent策略生成的语义互操作能力得到了提高. 相似文献
26.
Reiko Heckel Hartmut Ehrig Uwe Wolter Andrea Corradini 《Applied Categorical Structures》2001,9(1):83-110
The classical algebraic approach to graph transformation is a mathematical theory based on categorical techniques with several interesting applications in computer science. In this paper, a new semantics of graph transformation systems (in the algebraic, double-pushout (DPO) approach) is proposed in order to make them suitable for the specification of concurrent and reactive systems. Classically, a graph transformation system comes with a fixed behavioral interpretation. Firstly, all transformation steps are intended to be completely specified by the rules of the system, that is, there is an implicit frame condition: it is assumed that there is a complete control about the evolution of the system. Hence, the interaction between the system and its (possibly unknown) environment, which is essential in a reactive system, cannot be modeled explicitly. Secondly, each sequence of transformation steps represents a legal computation of the system, and this makes it difficult to model systems with control. The first issue is addressed by providing graph transformation rules with a loose semantics, allowing for unspecified effects which are interpreted as activities of the environment. This is formalized by the notion of double-pullback transitions, which replace (and generalize) the well-known double-pushout diagrams by allowing for spontaneous changes in the context of a rule application. Two characterizations of double-pullback transitions are provided: the first one describes them in terms of extended direct DPO derivations, and the second one as incomplete views of parallel or amalgamated derivations. The issue of constraining the behavior of a system to transformation sequences satisfying certain properties is addressed instead by introducing a general notion of logic of behavioral constraints, which includes instances like start graphs, application and consistency conditions, and temporal logic constraints. The loose semantics of a system with restricted behavior is defined as a category of coalgebras over a suitable functor. Such category has a final object which includes all finite and infinite transition sequences satisfying the constraints. 相似文献
27.
知识精英以多种不同形式参与国家与社会治理在中国有着悠久的历史传统。官僚知识体系的固化、基层运作机制的碎片化与行动者(居民)参与的乏力的相互叠加与彼此强化,共同造成了当代中国城市基层治理的困境。专家学者通过深度介入的方式,帮助基层党委和政府在基层治理中“找回居民”,推动以居民参与和社区协商的方式回应居民需求,进而实现城市基层运作机制和治理体系的创新,是城市基层治理模式创新的一大新动向。专家学者以居民需求与基层治理为导向,基于专业知识和社会声望,有效地实现了社区行动者参与、基层运作机制和基层官僚知识体系的重构,进而形塑了一种新型城市基层整体治理模式。 相似文献
28.
Kurt Engesser 《Mathematical Logic Quarterly》1995,41(1):49-64
We study modal logics based on neighbourhood semantics using methods and theorems having their origin in topological model theory. We thus obtain general results concerning completeness of modal logics based on neighbourhood semantics as well as the relationship between neighbourhood and Kripke semantics. We also give a new proof for a known interpolation result of modal logic using an interpolation theorem of topological model theory. 相似文献
29.
《Annals of Pure and Applied Logic》2022,173(10):103063
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. 相似文献
30.
《Annals of Pure and Applied Logic》2022,173(10):103104
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. 相似文献