全文获取类型
收费全文 | 402篇 |
免费 | 22篇 |
国内免费 | 12篇 |
专业分类
电工技术 | 6篇 |
综合类 | 16篇 |
化学工业 | 5篇 |
金属工艺 | 1篇 |
机械仪表 | 10篇 |
建筑科学 | 13篇 |
能源动力 | 1篇 |
武器工业 | 1篇 |
无线电 | 14篇 |
一般工业技术 | 7篇 |
冶金工业 | 2篇 |
原子能技术 | 1篇 |
自动化技术 | 359篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 3篇 |
2015年 | 8篇 |
2014年 | 16篇 |
2013年 | 13篇 |
2012年 | 7篇 |
2011年 | 21篇 |
2010年 | 17篇 |
2009年 | 29篇 |
2008年 | 25篇 |
2007年 | 33篇 |
2006年 | 33篇 |
2005年 | 30篇 |
2004年 | 23篇 |
2003年 | 21篇 |
2002年 | 19篇 |
2001年 | 13篇 |
2000年 | 12篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 7篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1985年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有436条查询结果,搜索用时 15 毫秒
1.
2.
We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-calledterminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets. 相似文献
3.
MARCO SCHAERF 《Computational Intelligence》1991,7(3):154-159
The use of multivalued logics for knowledge representation and nonmonotonic reasoning has often been advocated, in particular within the general framework proposed by Ginsberg in his paper "Multivalued logics: a uniform approach to reasoning in artificial intelligence." His system is based on a multivalued logic with an arbitrary number of truth values classified with respect to two partial orders, a truth order and a knowledge order. This classification is very interesting and gives an intuitive appeal to the framework. In this paper the work by Ginsberg is critically reviewed, pointing out some flaws and ways to overcome them. Moreover, we present some ideas on how to modify the original schema in order to obtain a more semantically well-founded framework.
L'utilisation de la Iogique multivalente pour la représentation des connaissances et le raisonnement non monotone a souvent été préconisée, en particulier à l'intérieur du cadre général proposé par Ginsberg dans son article intitulé〘 Multivalued logics: a uniform approach to reasoning in artificial intelligence 〙 Son système est basé sur une logique multivalente comportant un nombre arbitraire de valeurs de vérité classées selon deux ordres partiels: un ordre de vérité et un ordre de connaissances. Cette classification est très intéressante et donne un attrait intuitif au cadre. Dans cet article, l'auteur examine le travail de Ginsberg, y relève des lacunes et propose des moyens de les corriger. De plus, il expose certaines idées en vue de modifier le schéma original et ainsi obtenir un meilleur cadre du point de vue de la sémantique. 相似文献
L'utilisation de la Iogique multivalente pour la représentation des connaissances et le raisonnement non monotone a souvent été préconisée, en particulier à l'intérieur du cadre général proposé par Ginsberg dans son article intitulé〘 Multivalued logics: a uniform approach to reasoning in artificial intelligence 〙 Son système est basé sur une logique multivalente comportant un nombre arbitraire de valeurs de vérité classées selon deux ordres partiels: un ordre de vérité et un ordre de connaissances. Cette classification est très intéressante et donne un attrait intuitif au cadre. Dans cet article, l'auteur examine le travail de Ginsberg, y relève des lacunes et propose des moyens de les corriger. De plus, il expose certaines idées en vue de modifier le schéma original et ainsi obtenir un meilleur cadre du point de vue de la sémantique. 相似文献
4.
In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics. 相似文献
5.
Kosta Došen 《Journal of Logic, Language and Information》1992,1(3):173-201
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory. 相似文献
6.
研究倒立摆复杂系统优化控制问题,传统优化控制要建立精确数学模型,但与实际不符。对复杂系统采用具有认知和仿人功能、适应不确定环境等特性的智能控制方法较传统控制方法更具优势。为此,提出一种柔性泛逻辑学的智能控制模型,具有三个典型参数(e、h、k),分别反映了控制过程中的决策门限、被控量之间的关系和测量误差,能更好地掌握控制的思路。对三级倒立摆的控制采用上述方法进行仿真,实验证明了模型的正确性和有效性,并且具有良好的抗干扰能力,为复杂系统控制寻求了一种新的有效途径。 相似文献
7.
There is a growing body of research on the successes and failures of information and communications technology (ICT) projects in the public sector. However, this literature has rarely addressed the question of why some projects persist and continue despite functioning poorly in several areas. In this paper, we suggest that the notions of institutional logics and status differences provide useful insights into the structure and trajectory of this type of continuity. We build our arguments through an in-depth qualitative case study of a public information and communications technology (PICT) project in India. From our findings, we develop a process model of PICT project continuity. We explain how the employment of bureaucratic posturing – a manifestation of bureaucratic logic – as a tactic by high status groups could lead to poor performance on several fronts. The paper elaborates on two levels of continuity: policy-level continuity, which in our case was enabled by the logics of decentralization and technocracy, and operational-level continuity, which was achieved when groups with contrasting status-related motivations supported the project. 相似文献
8.
在智能家居的自适应软件设计中,往往采用传统的模块构建技术。但由于其适应逻辑存在着低复用性、高复杂度等问题,很难验证模块组合后的正确性及有效性。为了满足开发过程中用户的增量性需求,针对适应逻辑的组合难题,提出把部分行为模型的形式化方法引入到适应行为的描述中。通过三值逻辑KMTS模型描述语言,提出一致性模型的判断方法以及融合算法,以提供明确的适应模型在线融合支持。最后通过智能家居中的一个模型实例来分析并验证融合后的适应逻辑。 相似文献
9.
Hypersequent calculi, introduced independently by Pottinger and Avron, provide a powerful generalization of ordinary sequent calculi. In the paper we present a proof of eliminability of cut in hypersequent calculi for three modal logics of linear frames: K4.3, KD4.3 and S4.3. Our cut-free calculus is based on Avron's HC formalization for Gödel–Dummett's logic. The presented proof of eliminability of cut is purely syntactical and based on Ciabattoni, Metcalfe, Montagna's proof of eliminability of cut for hypersequent calculi for some fuzzy logics with modalities. 相似文献
10.