全文获取类型
收费全文 | 188篇 |
免费 | 6篇 |
国内免费 | 3篇 |
出版年
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 16篇 |
2012年 | 5篇 |
2011年 | 9篇 |
2010年 | 3篇 |
2009年 | 17篇 |
2008年 | 22篇 |
2007年 | 17篇 |
2006年 | 9篇 |
2005年 | 12篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 9篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
21.
Jeff Blee David Billington Guido Governatori Abdul Sattar 《Journal of Applied Logic》2011,9(4):250-273
The use of rational agents for modelling real world problems has both been heavily investigated and become well accepted, with BDI (Beliefs, Desires, and Intentions) Logic being a widely used architecture to represent and reason about rational agency. However, in the real world, we often have to deal with different levels of confidence in the beliefs we hold, desires we have, and intentions that we commit to. This paper extends our previous framework that integrated qualitative levels of beliefs, desires, and intentions into BDI Logic. We describe an expanded set of axioms and properties of the extended logic. We present a modular structure for the semantics which involves a non-normal Kripke type semantics that may be used for other agent systems. Further, we demonstrate the usefulness of our framework with a scheduling task example. 相似文献
22.
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since justification logics are newer and less well known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here. 相似文献
23.
Epistemic naturalism holds that the results or methodologies from the cognitive sciences are relevant to epistemology, and
some have maintained that scientific methods are more compatible with externalist theories of justification than with internalist
theories. But practically all discussions about naturalized epistemology are framed exclusively in terms of cognitive psychology,
which is only one of the cognitive sciences. The question addressed in this essay is whether a commitment to naturalism really
does favor externalism over internalism, and we offer reasons for thinking that naturalism in epistemology is compatible with
both internalist and externalist conceptions of justification. We also argue that there are some distinctively internalist
aims that are currently being studied scientifically and these notions, and others, should be studied by scientific methods.
This essay is dedicated to Deborah Mayo, who has long advocated using error statistical techniques to analyze and resolve
epistemological puzzles in the philosophy of science. This essay follows the same spirit by advocating that computational
concepts and techniques be applied within the heart of traditional, analytic epistemology. 相似文献
24.
Kamel Jedidi 《Journal of mathematical psychology》2008,52(4):241-249
A lexicographic rule orders multi-attribute alternatives in the same way as a dictionary orders words. Although no utility function can represent lexicographic preference over continuous, real-valued attributes, a constrained linear model suffices for representing such preferences over discrete attributes. We present an algorithm for inferring lexicographic structures from choice data. The primary difficulty in using such data is that it is seldom possible to obtain sufficient information to estimate individual-level preference functions. Instead, one needs to pool the data across latent clusters of individuals. We propose a method that identifies latent clusters of subjects, and estimates a lexicographic rule for each cluster. We describe an application of the method using data collected by a manufacturer of television sets. We compare the predictions of the model with those obtained from a finite-mixture, multinomial-logit model. 相似文献
25.
Jeremy Morris 《Argumentation》2008,22(2):205-216
Self-defeating and self-justifying expressions are reflexive insofar as they pertain to themselves. However, the reflexivity
involved is often pragmatic, i.e., does not entirely depend upon the logical properties of what is expressed but also upon
the expressive act. In this paper I present a general account of pragmatic reflexivity and apply it to some familiar self-defeating
and self-justifying expressions in epistemology. This application indicates some important, if often neglected features of
the epistemological issues involved. The account I defend suggests that epistemology is particularly sensitive to pragmatic
reflexivity since what epistemologists do, i.e., inquire, theorize, and defend theories, is also the subject of the inquiry
and resultant theories.
相似文献
Jeremy MorrisEmail: |
26.
Jean-Paul Doignon Samuel Fiorini Gwenaël Joret 《Journal of mathematical psychology》2006,50(3):251-262
The binary choice polytope appeared in the investigation of the binary choice problem formulated by Guilbaud and Block and Marschak. It is nowadays known to be the same as the linear ordering polytope from operations research (as studied by Grötschel, Jünger and Reinelt).The central problem is to find facet-defining linear inequalities for the polytope. Fence inequalities constitute a prominent class of such inequalities (Cohen and Falmagne; Grötschel, Jünger and Reinelt). Two different generalizations exist for this class: the reinforced fence inequalities of Leung and Lee, and independently Suck, and the stability-critical fence inequalities of Koppen. Together with the fence inequalities, these inequalities form the fence family. Building on previous work on the biorder polytope by Christophe, Doignon and Fiorini, we provide a new class of inequalities which unifies all inequalities from the fence family. The proof is based on a projection of polytopes. The new class of facet-defining inequalities is related to a specific class of weighted graphs, whose definition relies on a curious extension of the stability number. We investigate this class of weighted graphs which generalize the stability-critical graphs. 相似文献
27.
Liza Verhoeven 《Journal of Philosophical Logic》2007,36(3):339-366
In this paper Grice’s requirements for assertability are imposed on the disjunction of Classical Logic. Defining material
implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of
the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance
to Schurz’s conclusion-relevant consequence relation. 相似文献
28.
Michelle Montague 《Philosophical Studies》2009,145(2):171-192
My concern in this paper is with the intentionality of emotions. Desires and cognitions are the traditional paradigm cases
of intentional attitudes, and one very direct approach to the question of the intentionality of emotions is to treat it as
sui generis—as on a par with the intentionality of desires and cognitions but in no way reducible to it. A more common approach seeks
to reduce the intentionality of emotions to the intentionality of familiar intentional attitudes like desires and cognitions. In this
paper, I argue for the sui generis approach.
相似文献
Michelle MontagueEmail: |
29.
Giorgi Japaridze 《Studia Logica》2009,91(1):1-24
Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic
calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An
at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The
present article shows that turning the logic of the first sort of reduction into the logic of the second sort of reduction
takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first (Turing) sort
of interactive reduction is also shown to come in three natural versions. While those three versions are very different from
each other, their logical behaviors (in isolation) turn out to be indistinguishable, with that common behavior being precisely
captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction
of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations.
Presented by Robert Goldblatt 相似文献
30.
Thomas Ågotnes Wiebe Van der Hoek Juan A. Rodríguez-Aguilar Carles Sierra Michael Wooldridge 《Studia Logica》2009,92(1):1-26
We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E
δ
and A
δ
where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As
expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that the logic is decidable and that its satisfiability problem
is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic.
Presented by Jacek Malinowski 相似文献