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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,160 篇 会议
58 册 图书
37 篇 期刊文献

馆藏范围

1,254 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

922 篇 工学
- 870 篇 计算机科学与技术...
- 470 篇 软件工程
- 93 篇 控制科学与工程
- 66 篇 电气工程
- 43 篇 信息与通信工程
- 13 篇 机械工程
- 10 篇 土木工程
- 8 篇 建筑学
- 8 篇 石油与天然气工程
- 7 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 农业工程
242 篇 理学
- 203 篇 数学
- 19 篇 系统科学
- 18 篇 物理学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
97 篇 管理学
- 62 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 37 篇 工商管理
13 篇 教育学
- 12 篇 教育学
11 篇 医学
- 8 篇 基础医学(可授医学...
- 7 篇 临床医学
10 篇 法学
- 6 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 文学
3 篇 哲学

主题

254 篇 logic programmin...
53 篇 artificial intel...
50 篇 fuzzy logic
42 篇 semantics
40 篇 formal logic
40 篇 mathematical log...
32 篇 computer circuit...
31 篇 logics and meani...
27 篇 software enginee...
23 篇 integer programm...
22 篇 temporal logic
21 篇 programming tech...
20 篇 programming lang...
19 篇 programming
19 篇 calculations
19 篇 knowledge repres...
17 篇 computer science
17 篇 logic
17 篇 answer set progr...
14 篇 software enginee...

机构

9 篇 univ bath dept c...
9 篇 vienna univ tech...
5 篇 univ london impe...
5 篇 rhein westfal th...
5 篇 univ london impe...
5 篇 univ texas dept ...
4 篇 tu wien austria
4 篇 simon fraser uni...
4 篇 department of co...
4 篇 guangxi key labo...
4 篇 univ liverpool d...
4 篇 univ potsdam ins...
4 篇 carnegie mellon ...
4 篇 univ glamorgan c...
4 篇 univ potsdam ins...
3 篇 univ potsdam ins...
3 篇 theoretical comp...
3 篇 saitama univ dep...
3 篇 microsoft resear...
3 篇 univ potsdam pot...

作者

12 篇 schaub torsten
12 篇 de vos marina
10 篇 brain martin
9 篇 ricca francesco
8 篇 gebser martin
8 篇 russo alessandra
7 篇 gore rajeev
6 篇 leone nicola
6 篇 andrei voronkov
6 篇 xu yang
6 篇 giesl juergen
5 篇 cliffe owen
5 篇 eiter thomas
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 gupta gopal
5 篇 tompits hans
5 篇 schaub t
4 篇 mileo alessandra
4 篇 chang liang

语言

1,217 篇 英文
30 篇 其他
9 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=7th International Conference on Logic for Programming and Automated Reasoning"

共 1255 条记录，以下是391-400 订阅

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

详细简洁

排序：

the bayesian description logic

引用

7th international Joint conference on automated reasoning, IJCAR 2014, Held as Part of the Vienna Summer of logic, VSL 2014

作者： Ceylan, Ismail Ilkan Peñaloza, Rafael Theoretical Computer Science TU Dresden Germany Center for Advancing Electronics Dresden Germany

ISBN: (纸本)9783319085869

We introduce the probabilistic Description logic. In, axioms are required to hold only in an associated context. the probabilistic component of the logic is given by a Bayesian network that describes the joint probability distribution of the contexts. We study the main reasoning problems in this logic;in particular, we (i) prove that deciding positive and almost-sure entailments is not harder for than for the BN, and (ii) show how to compute the probability, and the most likely context for a consequence. © 2014 Springer international Publishing Switzerland.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

COOL - A Generic Reasoner for Coalgebraic Hybrid logics (System Description)

引用

7th international Joint conference on automated reasoning (IJCAR) Held as Part of theVienna Summer of logic (VSL)

作者： Gorin, Daniel Pattinson, Dirk Schroeder, Lutz Widmann, Florian Wissmann, thorsten Univ Erlangen Nurnberg Nurnberg Germany Australian Natl Univ Canberra ACT Australia Imperial Coll London London England

ISBN: (纸本)9783319085876;9783319085869

We describe the Coalgebraic Ontology logic solver COOL, a generic reasoner that decides the satisfiability of modal (and, more generally, hybrid) formulas with respect to a set of global assumptions - in Description logic parlance, we support a general TBox and internalize a Boolean ABox. the level of generality is that of coalgebraic logic, a logical framework covering a wide range of modal logics, beyond relational semantics. the core of COOL is an efficient unlabelled tableaux search procedure using global caching. Concrete logics are added by implemening the corresponding (one-step) tableaux rules. the logics covered at the moment include standard relational examples as well as graded modal logic and Pauly's Coalition logic (the next-step fragment of Alternating-time Temporal logic), plus every logic that arises as a fusion of the above. We compare the performance of COOL with state-of-the-art reasoners.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Development of concurrent object-oriented logic programming system to intelligent monitoring of anomalous human activities

Development of concurrent object-oriented logic programming ...

引用

7th international conference on Biomedical Electronics and Devices, BIODEVICES 2014 - Part of 7th international Joint conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2014

作者： Morozov, Alexei A. Vaish, Abhishek Polupanov, Alexander F. Antciperov, Vyacheslav E. Lychkov, Igor I. Alfimtsev, Aleksandr N. Deviatkov, Vladimir V. Kotel'nikov Institute of Radio Engineering and Electronics of RAS Mokhovaya 11 Moscow Russia Indian Institute of Information Technology Deoghat Jhalwa Allahabad UP India Bauman Moscow State Technical University Vtoraya Baumanskaya 5 Moscow Russia Moscow State University of Psychology and Education Sretenka 29 Moscow Russia

ISBN: (纸本)9789897580130

A logic programming approach to the intelligent monitoring of anomalous human activity is considered. the main idea of this approach is in using of a first order logic for describing abstract concepts of anomalous human activity, i.e. brawls, sudden attack, armed attack, leaving object, loitering, pickpocketing, personal theft, immobile person, etc. We use the Actor Prolog concurrent object-oriented logic language and a state-of-the-art Prolog-to-Java translator for efficient implementation of logical inference on video scenes. A logical rules generation methodology is considered in relation to the analysis of anomalous human behaviour. the problem of creation of special built-in classes of Actor Prolog for the low-level video processing is discussed. Copyright © 2014 SCITEPRESS - Science and Technology Publications. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proving Termination of Programs Automatically with AProVE

引用

7th international Joint conference on automated reasoning (IJCAR) Held as Part of theVienna Summer of logic (VSL)

作者： Giesl, Juergen Brockschmidt, Marc Emmes, Fabian Frohn, Florian Fuhs, Carsten Otto, Carsten Pluecker, Martin Schneider-Kamp, Peter Stroeder, thomas Swiderski, Stephanie thiemann, Rene Rhein Westfal TH Aachen Aachen Germany Microsoft Res Cambridge Cambridge England UCL London England Univ Southern Denmark Odense Denmark Univ Innsbruck Innsbruck Austria Andrena Objects AG Karlsruhe Germany Interact Pioneers GmbH Hamburg Germany

ISBN: (纸本)9783319085876;9783319085869

AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. the generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Epistemic logic programs with sorts 7

引用

7th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2014 - Affiliated with the international conference on logic programming, ICLP 2010, part of the Federated logic conference 2014

作者： Balai, Evgenii Kahl, Patrick Department of Computer Science Texas Tech University United States

ISBN: (纸本)9780000000002

We introduce the notion of an epistemic logic program with sorts—a program written in the language of Epistemic Specifications (an extension of ASP) with the addition of a sorted signature. this extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed. © ASPOCP *** rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Gentle Non-disjoint Combination of Satisfiability Procedures

引用

7th international Joint conference on automated reasoning (IJCAR) Held as Part of theVienna Summer of logic (VSL)

作者： Chocron, Paula Fontaine, Pascal Ringeissen, Christophe Univ Buenos Aires RA-1053 Buenos Aires DF Argentina Univ Lorraine INRIA Nancy France LORIA Nancy France INRIA Nancy France

ISBN: (纸本)9783319085876;9783319085869

A satisfiability problem is often expressed in a combination of theories, and a natural approach consists in solving the problem by combining the satisfiability procedures available for the component theories. this is the purpose of the combination method introduced by Nelson and Oppen. However, in its initial presentation, the Nelson-Oppen combination method requires the theories to be signature-disjoint and stably infinite (to guarantee the existence of an infinite model). the notion of gentle theory has been introduced in the last few years as one solution to go beyond the restriction of stable infiniteness, but in the case of disjoint theories. In this paper, we adapt the notion of gentle theory to the non-disjoint combination of theories sharing only unary predicates (plus constants and the equality). Like in the disjoint case, combining two theories, one of them being gentle, requires some minor assumptions on the other one. We show that major classes of theories, i.e. Lowenheim and Bernays-Schonfinkel-Ramsey, satisfy the appropriate notion of gentleness introduced for this particular non-disjoint combination framework.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

automated reasoning 2014

引用

丛书名： Lecture Notes in Computer Science

2014年

作者： Stéphane Demri Deepak Kapur Christoph Weidenbach

ISBN: (数字)9783319085876

ISBN: (纸本)9783319085869

this book constitutes the refereed proceedings of the 7th international Joint conference on automated reasoning, IJCAR 2014, held as part of the Vienna Summer of logic, VSL 2014, in Vienna, Austria, in July 2014. IJCAR 2014 was a merger of three leading events in automated reasoning, namely CADE (international conference on automated Deduction), FroCoS (international Symposium on Frontiers of Combining Systems) and TABLEAUX (international conference on automated reasoning with Analytic Tableaux and Related Methods). the 26 revised full research papers and 11 system descriptions presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. the papers have been organized in topical sections on HOL, SAT and QBF, SMT, equational reasoning, verification, proof theory, modal and temporal reasoning, SMT and SAT, modal logic, complexity, description logics and knowledge representation and reasoning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Algorithm to find ground instances in linguistic truth-valued lattice-valued first-order logic lv(N×2) F(X) 7

引用

7th international conference on Intelligent Systems and Knowledge Engineering, ISKE 2012 with 1st international conference on Cognitive Systems and Information Processing, CSIP 2012

作者： Zhong, Xiaomei Xu, Yang Xu, Peng School of Mathematics Southwest Jiaotong University Chengdu Sichuan610031 China

ISBN: (纸本)9783642378287

α-Resolution-based automated reasoning in linguistic truth-valued lattice- valued first-order logic Lv(n×2)F(x) based on linguistic truth-valued lattice implication algebra Lv(n×2) can be equivalently transformed into that in latticevalued propositional logic LnP(X);and during this equivalent transformation, the key step is to find out the corresponding ground instance. To solve the abovementioned problem, this paper gives an algorithm to find the corresponding ground instance of generalized-clause sets satisfying certain conditions in Lv(n×2)F(x);which lays the foundation for the application of α -resolution-based automated reasoning in Lv(n×2)F(x);to some extent. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

Tableau-Based reasoning for Graph Properties

Tableau-Based Reasoning for Graph Properties

引用

7th international conference on Graph Transformation (ICGT) Held as Part of conference on Software Technologies - Applications and Foundations (STAF)

作者： Lambers, Leen Orejas, Fernando Univ Potsdam Hasso Plattner Inst Potsdam Germany Univ Politecn Cataluna Dpto LSI Barcelona Spain

ISBN: (纸本)9783319091082;9783319091075

Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to have the means to express and reason about graph properties. A simple way is based on defining an appropriate encoding of graphs in terms of classical logic. this approach has been followed by Courcelle. the alternative is the definition of a specialized logic, as done by Habel and Pennemann, who defined a logic of nested graph conditions, where graph properties are formulated explicitly making use of graphs and graph morphisms, and which has the expressive power of Courcelle's first order logic of graphs. In particular, in his thesis, Pennemann defined and implemented a sound proof system for reasoning in this logic. Moreover, he showed that his tools outperform some standard provers when working over encoded graph conditions. Unfortunately, Pennemann did not prove the completeness of his proof system. In this sense, one of the main contributions of this paper is the solution to this open problem. In particular, we prove the (refutational) completeness of a tableau method based on Pennemann's rules that provides a specific theorem-proving procedure for this logic. this procedure can be considered our second contribution. Finally, our tableaux are not standard, but we had to define a new notion of nested tableaux that could be useful for other formalisms where formulas have a hierarchical structure like nested graph conditions.

关键词： Graph properties Graph logic automated deduction Visual modelling Graph transformation

来源：评论

学校读者我要写书评

暂无评论

A Proposal of SIRMs Model with Linear Transformation of Input Variables 7

A Proposal of SIRMs Model with Linear Transformation of Inpu...

引用

Joint 7th international conference on Soft Computing and Intelligent Systems (SCIS) and 15th international Symposium on Advanced Intelligent Systems (ISIS)

作者： Miyajima, Hirofumi Shigei, Noritaka Miyajima, Hiromi Kagoshima Univ Grad Sch Sci & Engn 1-21-40 Korimoto Kagoshima 8900065 Japan

ISBN: (纸本)9781479959556

the automatic construction of fuzzy system with a large number of input variables involves many difficulties such as large time complexity and getting stuck in a shallow and local minimum. As models to overcome them, the SIRMs (Single Input Rule Modules) and DIRMs (Double Input Rule Modules) models have been proposed. However, they are not always effective. In this paper, we propose a model that consists of two phases: the first is a linear transformation of input to intermediate variables and the second is SIRMs model. It is shown that the proposed model has the same ability as the conventional model and does not need too much parameters. Further, it can be applied to classification problems with many variables easily.

关键词： fuzzy reasoning fuzzy systems learning (artificial intelligence) DIRM models SIRM model automatic construction classification problems double input rule modules fuzzy inference model fuzzy system input variables intermediate variables learning methods linear transformation single input rule modules time complexity Educational institutions Electronic mail Function approximation Fuzzy logic Fuzzy systems Input variables Numerical simulation Fuzzy systems Input variables linear transformations complexity classes electronic mail Learning methods function approximation Educational institutions fuzzy reasoning Fuzzy logic numerical simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 36 37 38 39 40 41 42 43 44 45 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：