全文获取类型
收费全文 | 287篇 |
免费 | 20篇 |
国内免费 | 20篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 14篇 |
2015年 | 11篇 |
2014年 | 11篇 |
2013年 | 31篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 4篇 |
2009年 | 11篇 |
2008年 | 20篇 |
2007年 | 18篇 |
2006年 | 12篇 |
2005年 | 16篇 |
2004年 | 13篇 |
2003年 | 9篇 |
2002年 | 14篇 |
2001年 | 11篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 1篇 |
排序方式: 共有327条查询结果,搜索用时 15 毫秒
121.
Olga T. Yokoyama 《Argumentation》1988,2(1):133-151
Disbelief, lies, and manipulations have been objects of scholarly consideration from widely different perspectives: historical, sociological, philosophical, ethical, logical, and pragmatic. In this paper, these notions are re-examined in the framework of a Transactional Discourse Model which operates in terms of the location and relocation of various knowledge items within two sets of knowledge, A and B, representing two interlocators A and B, and two of their subsets Ca and Cb, which constitute the sets of the matters of A's and B's current concern. This approach reveals certain formal features shared by lies, disbelief, and manipulations that indicate that these three types of discourse behavior constitute a deviation from successful interpersonal communication as defined in the proposed model. The model, moreover, enables us to explicitly capture both the similarities and the differences of lies and manipulations with other pragmatic phenomena, such as jokes, impersonating, role-acting, memory failure, politeness expressions, and tact; the comparison suggests that certain modifications of Gricean conversational maxims may be in order. 相似文献
122.
One of the major reasons for the success of answer set programmingin recent years was the shift from a theorem proving to a constraintprogramming view: problems are represented such that stablemodels, respectively answer sets, rather than theorems correspondto solutions. This shift in perspective proved extremely fruitfulin many areas. We believe that going one step further from a"hard" to a "soft" constraint programming paradigm, or, in otherwords, to a paradigm of qualitative optimization, will proveequally fruitful. In this paper we try to support this claimby showing that several generic problems in logic based problemsolving can be understood as qualitative optimization problems,and that these problems have simple and elegant formulationsgiven adequate optimization constructs in the knowledge representationlanguage. 相似文献
123.
The Logic and Meaning of Plurals. Part II 总被引:2,自引:1,他引:1
Byeong-uk Yi 《Journal of Philosophical Logic》2006,35(3):239-288
In this sequel to “The logic and meaning of plurals. Part I”, I continue to present an account of logic and language that
acknowledges limitations of singular constructions of natural languages and recognizes plural constructions as their peers.
To this end, I present a non-reductive account of plural constructions that results from the conception of plurals as devices
for talking about the many. In this paper, I give an informal semantics of plurals, formulate a formal characterization of
truth for the regimented languages that results from augmenting elementary languages with refinements of basic plural constructions
of natural languages, and account for the logic of plural constructions by characterizing the logic of those regimented languages.
相似文献
Byeong-uk YiEmail: |
124.
There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with approximately 26 or fewer objects because of computer memory limitations. We present some new branch-and-bound procedures that improve computational efficiency, and enable guaranteed globally optimal solutions to be obtained for matrices with up to 35 objects. Experimental tests were conducted to compare the relative performances of the new procedures, a previously published branch-and-bound algorithm, and a dynamic programming solution strategy. These experiments, which included both synthetic and empirical dissimilarity matrices, yielded the following findings: (a) the new branch-and-bound procedures were often drastically more efficient than the previously published branch-and-bound algorithm, (b) when computationally feasible, the dynamic programming approach was more efficient than each of the branch-and-bound procedures, and (c) the new branch-and-bound procedures require minimal computer memory and can provide optimal solutions for matrices that are too large for dynamic programming implementation.The authors gratefully acknowledge the helpful comments of three anonymous reviewers and the Editor. We especially thank Larry Hubert and one of the reviewers for providing us with the MATLAB files for optimal and heuristic least-squares unidimensional scaling methods.This revised article was published online in June 2005 with all corrections incorporated. 相似文献
125.
126.
Graeme S. Halford John D. Bain Murray T. Maybery Glenda Andrews 《Cognitive psychology》1998,35(3):201-245
Five experiments were performed to test whether participants induced a coherent representation of the structure of a task, called a relational schema, from specific instances. Properties of a relational schema include: An explicit symbol for a relation, a binding that preserves the truth of a relation, potential for higher-order relations, omnidirectional access, potential for transfer between isomorphs, and ability to predict unseen items in isomorphic problems. However relational schemas are not necessarily coded in abstract form. Predictions from relational schema theory were contrasted with predictions from configural learning and other nonstructural theories in five experiments in which participants were taught a structure comprised of a set of initial-state,operator → end-state instances. The initial-state,operator pairs were presented and participants had to predict the correct end-state. Induction of a relational schema was achieved efficiently by adult participants as indicated by ability to predict items of a new isomorphic problem. The relational schemas induced showed the omnidirectional access property, there was efficient transfer to isomorphs, and structural coherence had a powerful effect on learning. The “learning to learn” effect traditionally associated with the learning set literature was observed, and the long-standing enigma of learning set acquisition is explained by a model composed of relational schema induction and structure mapping. Performance was better after reversal of operators than after shift to an alternate structure, even though the latter entailed more overlap with previously learned tasks in terms of the number of configural associations that were preserved. An explanation for the reversal shift phenomenon in terms of induction and mapping of a relational schema is proposed. The five experiments provided evidence supporting predictions from relational schema theory, and no evidence was found for configural or nonstructural learning theories. 相似文献
127.
Masaru Shirahata 《Studia Logica》1996,56(3):361-392
In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF–
i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF–. This implies that LZF is a conservative extension of ZF– and therefore the former is consistent relative to the latter.
Hiroakira Ono 相似文献
128.
129.
Lot Sternheim Maureen van der Burgh Lotte J. Berkhout Maria R. Dekker Channah Ruiter 《Scandinavian journal of psychology》2014,55(6):573-577
Research indicates that people with obsessive‐compulsive disorder (OCD) have poor cognitive flexibility. However, studies have largely focused on actual abilities and while individuals' emotional responses may be just as important, little is known about how those with OCD experience a situation that requires cognitive flexibility. It is furthermore largely unknown whether cognitive flexibility may also be important for people with OCD symptoms, rather than only to those with full blown disorders. This study investigates the relationship between cognitive flexibility, and the experience thereof in female students with and without OCD symptoms. It was expected that poor cognitive flexibility would be positively associated to OCD symptoms, and that those with OCD symptoms would display poor cognitive flexibility, and experience situations requiring cognitive flexibility as more difficult, than those without OCD symptoms. Participants completed a measure for OCD symptoms, a neuropsychological task to measure cognitive flexibility, and a self‐report measure assessing emotional experience of situations requiring cognitive flexibility. Positive associations between OCD symptoms and both poor cognitive flexibility and negative experience of situations requiring cognitive flexibility were found. Furthermore, those with OCD symptoms performed poorer on the cognitive flexibility task than those without OCD symptoms, and reported higher scores on the cognitive inflexibility questionnaire. Results confirm a relation between OCD symptoms and poor cognitive flexibility in a subclinical sample and identify a relation between OCD symptoms and a negative experience of situations that require cognitive flexibility. Overall findings suggest that poor cognitive flexibility may be an important part of OCD symptomatology. 相似文献
130.