首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   192篇
  免费   18篇
  国内免费   22篇
  2022年   2篇
  2021年   3篇
  2020年   6篇
  2019年   5篇
  2018年   4篇
  2017年   14篇
  2016年   11篇
  2015年   8篇
  2014年   10篇
  2013年   15篇
  2012年   3篇
  2011年   3篇
  2010年   3篇
  2009年   8篇
  2008年   13篇
  2007年   10篇
  2006年   14篇
  2005年   19篇
  2004年   10篇
  2003年   12篇
  2002年   11篇
  2001年   5篇
  2000年   9篇
  1999年   1篇
  1998年   6篇
  1997年   6篇
  1996年   5篇
  1995年   3篇
  1994年   1篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1989年   1篇
  1988年   2篇
  1983年   1篇
  1980年   2篇
  1975年   1篇
排序方式: 共有232条查询结果,搜索用时 15 毫秒
1.
Hájek  Petr 《Studia Logica》1997,58(1):129-141
A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.  相似文献   
2.
飞行错觉水平评定方法的初步研究   总被引:7,自引:0,他引:7  
本文从飞行错觉发生的类型和频率出发,尝试对飞行员在实际飞行中所产生的错觉水平或空间定向能力做出基本的评定。本研究采用区间模糊统计的方法,对飞行错觉的类型(倾斜错觉、俯仰错觉、方位错觉、反旋转错觉和倒飞错觉)和频率(从无、偶尔、时有、经常、总是)做了经验的赋值工作,分别计算出了这些模糊概念(除从无外)的心理量表值和模糊度。同时我们认为,飞行错觉水平是频率与类型的函数,其数学表达式为:,并将这一表达式作为评定飞行员飞行错觉水平的基本模型。  相似文献   
3.
4.
In multiple-objective programming, a knowledge of the structure of the non-dominated set can aid in generating efficient solutions. We present new concepts which allow for a better understanding of the structure of the set of non-dominated solutions for non-convex bicriteria programming problems. In particular, a means of determining whether or not this set is connected is examined. Both supersets and newly defined subsets of the non-dominated set are utilized in this investigation. Of additional value is the use of the lower envelope of the set of outcomes in classifying feasible points as (properly) non-dominated solutions.  相似文献   
5.
In this paper the view is developed that classes should not be understood as individuals, but, rather, as classes as many of individuals. To correlate classes with individuals labelling and colabelling functions are introduced and sets identified with a certain subdomain of the classes on which the labelling and colabelling functions are mutually inverse. A minimal axiomatization of the resulting system is formulated and some of its extensions are related to various systems of set theory, including nonwellfounded set theories.  相似文献   
6.
We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction.This paper is an extended version of a paper presented at the Nineteenth Conference on Uncertainty in Arti.cial Intelligence (UAI’03).  相似文献   
7.
Andrzej Kisielewicz has proposed three systems of double extension set theory of which we have shown two to be inconsistent in an earlier paper. Kisielewicz presented an argument that the remaining system interprets ZF, which is defective: it actually shows that the surviving possibly consistent system of double extension set theory interprets ZF with Separation and Comprehension restricted to 0 formulas. We show that this system does interpret ZF, using an analysis of the structure of the ordinals.  相似文献   
8.
On Some Varieties of MTL-algebras   总被引:1,自引:0,他引:1  
  相似文献   
9.
The Hybrid Logic of Linear Set Spaces   总被引:1,自引:0,他引:1  
  相似文献   
10.
A considerable gap exists between the behavioral paradigm of choice set formation in route choice and its representation in route choice modeling. While travelers form their viable choice set by retaining routes that satisfy spatiotemporal constraints, existing route generation techniques do not account for individual-related spatiotemporal constraints. This paper reduces the gap by proposing a route choice model incorporating spatiotemporal constraints and latent traits. The proposed approach combines stochastic route generation with a latent variable semi-compensatory model representing constraint-based choice set formation followed by compensatory choice. The model is applied to data focusing on habitual commuting route choice behavior in morning peak hours. Results show (i) the possibility of inferring spatiotemporal constraints from considered routes, (ii) the importance of incorporating spatiotemporal constraints and latent traits in route choice models, and (iii) the linkage between spatiotemporal constraints and time saving, spatial and mnemonic abilities.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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