全文获取类型
收费全文 | 4503篇 |
免费 | 377篇 |
国内免费 | 253篇 |
专业分类
电工技术 | 282篇 |
综合类 | 232篇 |
化学工业 | 159篇 |
金属工艺 | 155篇 |
机械仪表 | 507篇 |
建筑科学 | 134篇 |
矿业工程 | 70篇 |
能源动力 | 76篇 |
轻工业 | 75篇 |
水利工程 | 5篇 |
石油天然气 | 34篇 |
武器工业 | 34篇 |
无线电 | 1090篇 |
一般工业技术 | 261篇 |
冶金工业 | 66篇 |
原子能技术 | 68篇 |
自动化技术 | 1885篇 |
出版年
2024年 | 5篇 |
2023年 | 32篇 |
2022年 | 43篇 |
2021年 | 70篇 |
2020年 | 59篇 |
2019年 | 33篇 |
2018年 | 57篇 |
2017年 | 66篇 |
2016年 | 73篇 |
2015年 | 114篇 |
2014年 | 226篇 |
2013年 | 224篇 |
2012年 | 271篇 |
2011年 | 359篇 |
2010年 | 252篇 |
2009年 | 243篇 |
2008年 | 254篇 |
2007年 | 269篇 |
2006年 | 308篇 |
2005年 | 304篇 |
2004年 | 246篇 |
2003年 | 230篇 |
2002年 | 204篇 |
2001年 | 178篇 |
2000年 | 136篇 |
1999年 | 135篇 |
1998年 | 141篇 |
1997年 | 115篇 |
1996年 | 102篇 |
1995年 | 54篇 |
1994年 | 74篇 |
1993年 | 68篇 |
1992年 | 37篇 |
1991年 | 29篇 |
1990年 | 34篇 |
1989年 | 20篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 10篇 |
1985年 | 15篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1975年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有5133条查询结果,搜索用时 0 毫秒
61.
We describe how Intuitionistic Linear Logic can be used to provide a unified logical account for agents to find and execute
plans. This account supports the modelling of agent interaction, including dialogue; allows agents to be robust to unexpected
events and failures; and supports significant reuse of agent specifications. The framework has been implemented and several
case studies have been considered. Further applications include human–computer interfaces as well as agent interaction in
the semantic web. 相似文献
62.
63.
64.
针对常识推理的非单调和异常问题,构建了基于改进的主动逻辑与元认知环的机器人常识推理框架。首先,针对机器人在执行任务时易受异常情况干扰的问题,引入元认知环对异常进行监视和评估并引导机器人。其次,对主动逻辑进行改进,定义了事实、常识,及它们相互之间的蕴含、否定和无关三种关系,给出了详细的矛盾知识的发生的条件和定义,并给出了对应的矛盾知识的处理方法,提出在主动逻辑中事实包含关系的传递性及推理的非直接传递性以有效检测和处理矛盾。最后,设计的Pr2机器人取书的实验进一步验证了元认知环以及主动逻辑在机器人执行任务时对异常情况和矛盾知识处理的有效性。 相似文献
65.
随着数字IC的规模和复杂性不断增加,数字IC设计的难度也在加大,为了更好地进行数字IC设计,业界普遍采用了自动化的设计方式,通过应用工具软件,将IC设计的效率极大地提高.主要探讨了在IC设计当中逻辑综合方面的问题. 相似文献
66.
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds. Although in some settings these approaches are equi-expressive and can capture all epistemic states, in other settings of interest (especially with probability in the picture), we show that they are not equi-expressive. We then consider the pragmatics of dealing with logical omniscience—how to choose an approach and construct an appropriate model. 相似文献
67.
We present the RFuzzy framework, a Prolog-based tool for representing and reasoning with fuzzy information. The advantages of our framework in comparison to previous tools along this line of research are its easy, user-friendly syntax, and its expressivity through the availability of default values and types.In this approach we describe the formal syntax, the operational semantics and the declarative semantics of RFuzzy (based on a lattice). A least model semantics, a least fixpoint semantics and an operational semantics are introduced and their equivalence is proven. We provide a real implementation that is free and available. (It can be downloaded from http://babel.ls.fi.upm.es/software/rfuzzy/.) Besides implementation details, we also discuss some actual applications using RFuzzy. 相似文献
68.
Correcting design decay in source code is not a trivial task. Diagnosing and subsequently correcting inconsistencies between a software system’s code and its design rules (e.g., database queries are only allowed in the persistence layer) and coding conventions can be complex, time-consuming and error-prone. Providing support for this process is therefore highly desirable, but of a far greater complexity than suggesting basic corrective actions for simplistic implementation problems (like the “declare a local variable for non-declared variable” suggested by Eclipse).We present an abductive reasoning approach to inconsistency correction that consists of (1) a means for developers to document and verify a system’s design and coding rules, (2) an abductive logic reasoner that hypothesizes possible causes of inconsistencies between the system’s code and the documented rules and (3) a library of corrective actions for each hypothesized cause. This work builds on our previous work, where we expressed design rules as equality relationships between sets of source code artifacts (e.g., the set of methods in the persistence layer is the same as the set of methods that query the database). In this paper, we generalize our approach to design rules expressed as user-defined binary relationships between two sets of source code artifacts (e.g., every state changing method should invoke a persistence method).We illustrate our approach on the design of IntensiVE, a tool suite that enables defining sets of source code artifacts intensionally (by means of logic queries) and verifying relationships between such sets. 相似文献
69.
论述了逻辑程序设计中剪枝算子的作用及传统剪枝算子的过程性语义和说明性语义不一致问题;介绍了新型逻辑程序语言〔淑划中的COTRTT11t剪枝算子;通过引入一组定义描述其过程语义,并进一步阐述了剪枝算子和延迟计算规则之间的关系,讨论了Godel语言的剪枝策略及控制机制,从而为逻辑程序语言的实现提供了依据。 相似文献
70.