检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

492 篇 会议
29 篇 期刊文献
24 册 图书

馆藏范围

545 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

382 篇 工学
- 347 篇 计算机科学与技术...
- 220 篇 软件工程
- 60 篇 控制科学与工程
- 40 篇 电气工程
- 22 篇 信息与通信工程
- 11 篇 电子科学与技术（可...
- 9 篇 机械工程
- 9 篇 建筑学
- 8 篇 力学（可授工学、理...
- 8 篇 土木工程
- 8 篇 生物医学工程（可授...
- 7 篇 材料科学与工程（可...
- 7 篇 交通运输工程
- 5 篇 仪器科学与技术
- 5 篇 生物工程
- 4 篇 化学工程与技术
113 篇 理学
- 93 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 10 篇 生物学
29 篇 管理学
- 17 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 8 篇 工商管理
12 篇 医学
- 10 篇 基础医学(可授医学...
- 10 篇 临床医学
- 7 篇 药学(可授医学、理...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 教育学
- 4 篇 教育学
2 篇 农学

主题

88 篇 logic programmin...
24 篇 computer circuit...
20 篇 fuzzy logic
16 篇 semantics
15 篇 programming
15 篇 mathematical log...
15 篇 logics and meani...
14 篇 artificial intel...
13 篇 programming lang...
12 篇 linear programmi...
12 篇 programming tech...
11 篇 formal logic
11 篇 software enginee...
10 篇 logic gates
10 篇 logic
9 篇 genetic programm...
9 篇 algebra
9 篇 functional progr...
8 篇 web services
7 篇 programmable log...

机构

3 篇 cwi p.o. box 940...
2 篇 sri int menlo pk...
2 篇 huelva universit...
2 篇 department of co...
2 篇 trinity coll dub...
2 篇 ctr wiskunde & i...
2 篇 computer science...
2 篇 hanoi univ techn...
2 篇 department of me...
2 篇 università di pi...
2 篇 applied mathemat...
2 篇 fujitsu laborato...
2 篇 dept. of informa...
2 篇 industrial depar...
2 篇 department of ma...
2 篇 department of el...
2 篇 univ munich inst...
2 篇 faculty of elect...
2 篇 univ kent canter...
2 篇 vienna univ tech...

作者

3 篇 osorio m
2 篇 riedl l
2 篇 ortiz m
2 篇 yu yong
2 篇 kurz a
2 篇 casadei roberto
2 篇 kahl wolfram
2 篇 schobbens pierre...
2 篇 hennicker r
2 篇 ray oliver
2 篇 le van hung
2 篇 kifer michael
2 篇 bidoit m
2 篇 lin ying
2 篇 zhao na
2 篇 moto-oka t.
2 篇 stehr mark-olive...
2 篇 zhang xuan
2 篇 pianini danilo
2 篇 jaffar joxan

语言

537 篇 英文
7 篇 其他
1 篇 中文

检索条件"任意字段=4th International Conference on Algebraic and Logic Programming"

共 545 条记录，以下是291-300 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

NEURAL-NETWORK SOLUTIONS TO logic PROGRAMS WIth GEOMETRIC CONSTRAINTS 4

NEURAL-NETWORK SOLUTIONS TO LOGIC PROGRAMS WITH GEOMETRIC CO...

引用

4th international conference on Applications of Artificial Neural Networks

作者： PARIKH, JA WERKHEISER, A SUBRAHMANIAN, VS SO CONNECTICUT STATE UNIV DEPT COMP SCINEW HAVENCT 06515

ISBN: (纸本)0819412015

Hybrid knowledge bases (HKBs), proposed by Nerode and Subrahmanian, provide a uniform theoretical framework for dealing with the mixed data types and multiple reasoning modes required for solving logical deployment problems. Algorithms based on mixed integer linear programming techniques have been developed for the syntactic subset of HKBs corresponding to function-free Prolog-like logic programs. In this study, we examine the ability of neural networks to solve a more comprehensive set of problems expressed within the hybrid knowledge base framework. the objective of this research is to design and implement a nonlinear optimization procedure for solving extended logic programs with neural networks. We focus upon two types of extensions which are typically required in the formulation of logical deployment problems. the first type of extension, which we shall refer to as a Type I extension, consists of embedding numerical and geometric constraints into logic programs. the second type of extension, which we shall call a Type II extension, consists of incorporating optimization problems into logic clauses.

关键词： logic Neural networks Computer programming Artificial neural networks System identification Algorithm development Optimization (mathematics) Head Computer programming languages Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

the completion of typed logic programs and SLDNF-resolution 4th

引用

4th international conference on logic programming and Automated Reasoning, LPAR 1993

作者： Hill, P.M. School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom

ISBN: (纸本)9783540569442

We consider logic programming languages with a parametric type system, first described by Mycroft and O’Keefe, that allows generic polymorphism. It is well known that provided certain conditions hold typed definite logic programs do not go wrong under SLD-resolution. Previous work has looked at how these conditions may be avoided by adding run-time type checking to the SLD-resolution. However, only definite programs have been considered and the program’s theory was assumed to be given by the statements of the program and not its completion. this paper establishes results showing that the conditions are also necessary for almost all typed logic programs if the declarative semantics is the completion semantics and the procedural semantics is based on SLDNF-resolution. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A note on the elementary execution unit in a parallel inference machine 4th

引用

4th international conference on logic programming, 1985

作者： Maruyama, T. Hirata, K. Tanaka, H. Moto-oka, T. Department of Electrical Engineering The University of Tokyo Bunkyoku Tokyo113 Japan

ISBN: (纸本)9783540164791

When we design a parallel inference machine which executes logic programs, there are some important problems that greatly influence the machine performance. the most important problem is how to decide the elementary execution unit (granule). the less the size of the elementary execution unit is, the less is the overhead of copying and transferring, but the control among the units becomes more complicated. Until now, a few models of parallel inference machines have been proposed. However, we think that this problem is not discussed enough in these models. In this paper, we discuss the problem in detail. © 1986, Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Applications of Declarative programming and Knowledge Management 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Dietmar Seipel Michael Hanus Ulrich Geske Oskar Bartenstein

ISBN: (数字)9783540321248

ISBN: (纸本)9783540255604

this volume contains a selection of papers presented at the 15th international conference on Applications of Declarative programming and Knowledge M- agement, INAP 2004, and the 18th Workshop on logic programming, WLP 2004, which were held jointly in Potsdam, Germany, from March 4th to 6th, 2004. Declarative programming is an advanced paradigm for the modeling and solving of complex problems. this speci?cation method has become more and more attractive in recent years, for example, in the domains of databases, for the processing of natural language, for the modeling and processing of combinatorial problems, and for establishing knowledge-based systems for the Web. the INAP conferences provide a forum for intensive discussions of appli- tions of important technologies around logic programming, constraint problem solving, and closely related advanced software. they comprehensively cover the impact of programmable logic solvers in the Internet society, its underlying te- nologies, and leading-edge applications in industry, commerce, government, and social services. the Workshops on logic programming are the annual meeting of the Society for logic programming (GLP e.V.). they bring together researchers interested in logic programming, constraint programming, and related areas like databases and arti?cial intelligence. Previous workshops have been held in Germany, A- tria, and Switzerland. thetopicsoftheselectedpapersofthisyear’sjointconferenceconcentrateon three currently important ?elds: knowledge management and decision support, constraint programming and constraint solving, and declarative programming and Web-based systems.

关键词： programming Languages, Compilers, Interpreters Artificial Intelligence programming Techniques

来源：评论

学校读者我要写书评

暂无评论

Mixing metafor 4th

引用

4th international conference on logic programming and Automated Reasoning, LPAR 1993

作者： Nualláin, Breanndán Ó. Center for Computer Science and Organization Management Universiteit van Amsterdam Oude Turfmarkt 151 Amsterdam1012 GC Netherlands

ISBN: (纸本)9783540569442

Metafor is a general purpose Automated theorem Proving (ATP) system for First Order Predicate logic (FOPL) with equality. It is in daily use as a tool aiding researchers working in the field of theory building in the social sciences. It is based on model generation with a ground term rewrite system incorporated for the handling of equality. It effects partial deduction on Horn clauses as a preprocessing step which provides information which allows heuristics to be applied to the selection of moves in the proof search. Also, metafor allows the user to provide certain meta-information by giving type constraints on predicate slots or certain properties of binary relations. the CCSOM implementation of metafor consists of approximately 4500 lines of PROLOG and currently runs on Prolog by BIM on a Sun Sparcstation network. © Springer-Verlag Berlin Heidelberg 1993.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

the program characteristics in logic programming language ESP 4th

引用

4th international conference on logic programming, 1985

作者： Yamamoto, Akira Mitsui, Masaki Yoshida, Hiroyuki Yokota, Minoru Nakajima, Katsuto Systems Laboratory Oki Electric Co. Ltd. 10-12 Shibaura 4-chome Minato-ku Tokyo Japan Institute for New Generation Computer Technology Mita-Kokusai Bldg. 21F 4-28 Mita 1-chome Minato-ku Tokyo Japan Information Systems and Electronics Development Laboratory Mitsubishi Electric Corp. 5-1-1 Oofuna Kamakura City Kanagawa-Ken Japan

ISBN: (纸本)9783540164791

this paper describes static and dynamic characteristics of programs written in ESP (Extended Self-contained Prolog) running on PSI (Personal Sequential Inference machine). All the software modules on PSI are written in ESP. Four actual programs are chosen to measure the number of arguments, alternatives, the ratios of built-in predicate calls to all other calls, and so forth. the results of this measurement are summarized and evaluated. © 1986, Springer-Verlag.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Two instances of peirce's reduction thesis

引用

4th international conference on Formal Concept Analysis, ICFCA 2006

作者： Dau, Frithjof Correia, Joachim Hereth Technische Universität Dresden Institut für Algebra D-01062 Dresden

ISBN: (纸本)3540322035

A main goal of Formal Concept Analysis (FCA) from its very beginning has b'een the support of rational communication by formalizing and visualizing concepts. In the last years, this approach has been extended to traditional logic based on the doctrines of concepts, judgements and conclusions, leading to a framework called Contextual logic. Much of the work on Contextual logic has been inspired by the Existential Graphs invented by Charles 3. Peirce at the end of the 19th century. While his graphical logic system is generally believed to be equivalent to first order logic, a proof in the strict mathematical sense cannot be given, as Peirce's description of Existential Graphs is vague and does not suit the requirements of contemporary mathematics. In his book 'A Peircean Reduction thesis: the Foundations of topological logic', Robert Burch presents the results of his project to reconstruct in an algebraic precise manner Peirce's logic system. the resulting system is called Peircean algebraic logic (PAL). He also provides a proof of the Peircean Reduction thesis which states that all relations can be constructed from ternary relations in PAL, but not from unary and binary relations alone. Burch's proof relies on a major restriction on the allowed construction of graphs. Removing this restriction renders the proof much more complicated. In this paper, a new approach to represent an arbitrary graph by a relational normal form is introduced. this representation is then used to prove the thesis for infinite and two-element domains. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

4th international Meeting of Young Computer Scientists, 1986

引用

4th international Meeting of Young Computer Scientists, 1986

ISBN: (纸本)9783540185352

the proceedings contain 13 papers. the special focus in this conference is on Young Computer Scientists. the topics include: A formal model of knowledge-based systems;basic complexity analysis of hypothesis formation;perspectives of logic programming;the equivalence of mappings on languages;kleene’s theorem revisited;some combinatorial problems concerning finite languages;a connection between descriptional complexity of context-free grammars and grammar form theory;basic ideas of selective substitution grammars;some recent restrictions in the derivation of context-free grammars;recent results on the theory of homogeneous structures;A note on the ratio function in DOL systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of Fuzzy logic Controllers based on Evolvable Hardware platform

Design of Fuzzy Logic Controllers based on Evolvable Hardwar...

引用

international conference on Genetic and Evolutionary Computing

作者： Yu, HuaYun Zhang, DaBin College of Computer Science Yangtze University Jingzhou Hubei China Dept. of Information Management HuaZhong Normal University Wuhan Hubei China

ISBN: (纸本)9780769542812

Fuzzy logic Controllers (FLCS) are rule-based system that successfully incorporate the flexibility of human-decision making by means of the use of fuzzy set theory. this paper provides an overview on evolutionary learning methods for the automated design and optimization of fuzzy logic controllers. A three-stage evolution framework that uses Genetic programming (GP) and Genetic Algorithms (GAS) evolves rule-base and membership function parameters of FLCS. For hardware implement of FLCS, We propose an Evolvable Hardware (EHW) platform for the design of fuzzy logic controllers. A simulation experiment is shown though this hybrid model in the design of fuzzy control systems. In the experiment, membership functions of input and output variables are defined by three parameters, called geometric proportional factors, adding with the scaling factors, which are adjusted to maximize the performance index by using the Genetic Algorithm. the fuzzy controller is designed to be more capability. © 2010 IEEE.

关键词： Membership functions

来源：评论

学校读者我要写书评

暂无评论

Organic ferroelectric non-volatile memory transistors 4

Organic ferroelectric non-volatile memory transistors

引用

4th IEEE international Flexible Electronics Technology conference

作者： Xia, Jiangnan Hu, Yuanyuan Hunan Univ Sch Phys & Elect Changsha 410082 Peoples R China Hunan Univ Shenzhen Res Inst Shenzhen 518063 Peoples R China

ISBN: (数字)9781665469685

ISBN: (纸本)9781665469685

A non-volatile memory transistor based on an air-stable p-type polymer semiconductor (PDVT-10) and organic ferroelectric polymer (PVDF-TrFE) is developed. the solution-processed memory transistor, which can operate well in air, has extremely stable storage properties with a 100 V memory window when the gate voltage sweeps in the range of +/- 80 V. the programming and erasing behavior of air-stable memory device are demonstrated. Although the retention behaviors and cyclic stability of the ferroelectric memory devices remain to be further improved and optimized, their capability

关键词： Nonvolatile memory Ferroelectric materials Voltage programming logic gates Behavioral sciences Transistors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共55页 << < 26 27 28 29 30 31 32 33 34 35 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：