全文获取类型
收费全文 | 964篇 |
免费 | 34篇 |
国内免费 | 20篇 |
出版年
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 16篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 9篇 |
2016年 | 38篇 |
2015年 | 11篇 |
2014年 | 26篇 |
2013年 | 48篇 |
2012年 | 13篇 |
2011年 | 11篇 |
2010年 | 14篇 |
2009年 | 45篇 |
2008年 | 76篇 |
2007年 | 73篇 |
2006年 | 61篇 |
2005年 | 72篇 |
2004年 | 59篇 |
2003年 | 60篇 |
2002年 | 61篇 |
2001年 | 42篇 |
2000年 | 58篇 |
1999年 | 39篇 |
1998年 | 34篇 |
1997年 | 34篇 |
1996年 | 22篇 |
1995年 | 20篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1985年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有1018条查询结果,搜索用时 15 毫秒
931.
Jan Plaza 《Synthese》2007,158(2):165-179
Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static
states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper
(part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with
public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results
and formulate a general method that solves certain kind of problems involving public communications—among them well known
puzzles of Muddy Children and Mr. Sum & Mr. Product. As the paper gives a formal logical treatment of the operation of restriction
of the universe of a Kripke model, it contributes also to investigations of semantics for modal logics.
This paper was originally published as Plaza, J. A. (1989). Logics of public communications. In M. L. Emrich, M. S. Pfeifer,
M. Hadzikadic, & Z.W. Ras (Eds.), Proceedings of the fourth international symposium on methodologies for intelligent systems:
Poster session program (pp. 201–216). Publisher: Oak Ridge National Laboratory, ORNL/DSRD-24. Research partly supported by NSF Grant CCR-8702307
and PSC-CUNY Grant 668283. 相似文献
932.
A Note on Binary Inductive Logic 总被引:3,自引:1,他引:2
We consider the problem of induction over languages containing binary relations and outline a way of interpreting and constructing
a class of probability functions on the sentences of such a language. Some principles of inductive reasoning satisfied by
these probability functions are discussed, leading in turn to a representation theorem for a more general class of probability
functions satisfying these principles. 相似文献
933.
Paolo Liberatore 《Studia Logica》2007,86(1):89-110
A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency
defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The
logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default
logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of consistency
defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form.
Presented by Melvin Fitting 相似文献
934.
Broda Krysia; Ma Jiefei; Sinnadurai Gabrielle; Summers Alexander 《Logic Journal of the IGPL》2007,15(4):293-304
Pandora is a tool for supporting the learning of first ordernatural deduction. It includes a help window, an interactivecontext sensitive tutorial known as the "e-tutor" and facilitiesto save, reload and export to LATEX. Every attempt to applya natural deduction rule is met with either success or a helpfulerror message, providing the student with instant feedback.Detailed electronic logs of student usage are recorded for evaluationpurposes. This paper describes the basic functionality, thee-tutor, our experiences of using the tool in teaching and ourfuture plans. 相似文献
935.
936.
Abduction is or subsumes a process of inference. It entertains possible hypotheses and it chooses hypotheses for further scrutiny.
There is a large literature on various aspects of non-symbolic, subconscious abduction. There is also a very active research
community working on the symbolic (logical) characterisation of abduction, which typically treats it as a form of hypothetico-deductive
reasoning. In this paper we start to bridge the gap between the symbolic and sub-symbolic approaches to abduction. We are
interested in benefiting from developments made by each community. In particular, we are interested in the ability of non-symbolic
systems (neural networks) to learn from experience using efficient algorithms and to perform massively parallel computations
of alternative abductive explanations. At the same time, we would like to benefit from the rigour and semantic clarity of
symbolic logic. We present two approaches to dealing with abduction in neural networks. One of them uses Connectionist Modal
Logic and a translation of Horn clauses into modal clauses to come up with a neural network ensemble that computes abductive
explanations in a top-down fashion. The other combines neural-symbolic systems and abductive logic programming and proposes
a neural architecture which performs a more systematic, bottom-up computation of alternative abductive explanations. Both
approaches employ standard neural network architectures which are already known to be highly effective in practical learning
applications. Differently from previous work in the area, our aim is to promote the integration of reasoning and learning
in a way that the neural network provides the machinery for cognitive computation, inductive learning and hypothetical reasoning,
while logic provides the rigour and explanation capability to the systems, facilitating the interaction with the outside world.
Although it is left as future work to determine whether the structure of one of the proposed approaches is more amenable to
learning than the other, we hope to have contributed to the development of the area by approaching it from the perspective
of symbolic and sub-symbolic integration.
相似文献
John WoodsEmail: |
937.
This paper presents a new theory of vagueness, which is designed to retain the virtues of the fuzzy theory, while avoiding the problem of higher-order vagueness. The theory presented here accommodates the idea that for any statement S
1 to the effect that Bob is bald is x true, for x in [0,1], there should be a further statement S
2 which tells us how true S
1 is, and so on – that is, it accommodates higher-order vagueness – without resorting to the claim that the metalanguage in which the semantics of vagueness is presented is itself vague, and without requiring us to abandon the idea that the logic – as opposed to the semantics – of vague discourse is classical. I model the extension of a vague predicate P as a blurry set, this being a function which assigns a degree of membership or degree function to each object o, where a degree function in turn assigns an element of [0,1] to each finite sequence of elements of [0,1]. The idea is that the assignment to the sequence 0.3,0.2, for example, represents the degree to which it is true to say that it is 0.2 true that o is P to degree 0.3. The philosophical merits of my theory are discussed in detail, and the theory is compared with other extensions and generalisations of fuzzy logic in the literature. 相似文献
938.
The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of Sugihara algebras, this corresponds to a distinction between strong and weak congruence properties. The distinction is explored here. A result of Avron is used to provide a local deduction-detachment theorem for the fragments without disjunction. Together with results of Sobociski, Parks and Meyer (which concern theorems only), this leads to axiomatizations of these entire fragments — not merely their theorems. These axiomatizations then form the basis of a proof that all of the basic fragments of RM with implication are finitely axiomatized consequence relations.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
939.
940.
This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are synonymous or translationally equivalent. We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals are drawn concerning the possibility of having two logical systems that are empirically distinct but are both translationally equivalent to a common logic. 相似文献