首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4611篇
  免费   12篇
  国内免费   1篇
  2018年   113篇
  2017年   96篇
  2016年   185篇
  2015年   96篇
  2014年   34篇
  2013年   59篇
  2012年   257篇
  2011年   255篇
  2010年   21篇
  2009年   27篇
  2008年   35篇
  2007年   34篇
  2006年   45篇
  2005年   1322篇
  2004年   659篇
  2003年   451篇
  2002年   141篇
  2001年   30篇
  2000年   14篇
  1999年   25篇
  1998年   5篇
  1997年   9篇
  1996年   7篇
  1995年   8篇
  1994年   18篇
  1992年   27篇
  1991年   44篇
  1990年   58篇
  1989年   47篇
  1988年   27篇
  1987年   42篇
  1986年   40篇
  1985年   29篇
  1984年   26篇
  1983年   22篇
  1979年   33篇
  1978年   10篇
  1977年   7篇
  1976年   10篇
  1975年   28篇
  1974年   32篇
  1973年   30篇
  1972年   25篇
  1971年   25篇
  1970年   17篇
  1969年   19篇
  1968年   16篇
  1967年   17篇
  1966年   16篇
  1965年   7篇
排序方式: 共有4624条查询结果,搜索用时 15 毫秒
181.
182.
183.
Object Exploration and a Problem with Reductionism   总被引:1,自引:1,他引:0  
The purpose of this paper is to use neuroscientific evidence to address the philosophical issue of intertheoretic reduction. In particular, we present a literature review and a new experiment to show that the reduction of cognitive psychology to neuroscience is implausible. To make this case, we look at research using object exploration, an important experimental paradigm in neuroscience, behavioral genetics and psychopharmacology. We show that a good deal of object exploration research is potentially confounded precisely because it assumes that psychological generalizations can be reduced to neuroscientific ones.  相似文献   
184.
185.
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).  相似文献   
186.
187.
In this paper, we present three main results on orthologics. Firstly, we give a sufficient condition for an orthologic to have variable separation property and show that the orthomodular logic has this property. Secondly, we show that the class of modular orthologics has an infinite descending chain. Finally we show that there exists a continuum of orthologics.  相似文献   
188.
189.
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.  相似文献   
190.
In this paper we present the syntax and semantics of a temporal action language named Alan, which was designed to model interactive multimedia presentations where the Markov property does not always hold. In general, Alan allows the specification of systems where the future state of the world depends not only on the current state, but also on the past states of the world. To the best of our knowledge, Alan is the first action language which incorporates causality with temporal formulas. In the process of defining the effect of actions we define the closure with respect to a path rather than to a state, and show that the non-Markovian model is an extension of the traditional Markovian model. Finally, we establish relationship between theories of Alan and logic programs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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