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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

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

共 719 条记录，以下是681-690 订阅

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

详细简洁

排序：

HornDL: An expressive horn description logic with PTime data complexity

HornDL: An expressive horn description logic with PTime data...

引用

7th international conference on Web reasoning and Rule Systems, RR 2013

作者： Nguyen, Linh Anh Nguyen, thi-Bich-Loc Szalas, Andrzej Institute of Informatics University of Warsaw Banacha 2 02-097 Warsaw Poland Faculty of Information Technology VNU University of Engineering and Technology 144 Xuan Thuy Hanoi Viet Nam Department of Information Technology Hue University of Sciences 77 Nguyen Hue Hue City Viet Nam Dept. of Computer and Information Science Linköping University SE-581 83 Linköping Sweden

ISBN: (纸本)9783642396656

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-scriptSscriptRscriptOscriptIscriptQ, while still has PTime data complexity. In comparison with Horn- scriptSscriptRscriptOscriptIscriptQ, Horn-DL additionally allows the universal role and assertions of the form irreflexive (s), ¬s(a, b), a ≠ b. More importantly, in contrast to all the well-known Horn fragments scriptEscriptL, DL-Lite, DLP, Horn-scriptSscripthscriptIscriptQ, Horn- scriptSscriptRscriptOscriptIscriptQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. In the long version of this paper, we present the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases. © 2013 Springer-Verlag.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Embedding programming languages in theorem provers 16th

Embedding programming languages in theorem provers

引用

16th international conference on Automated Deduction, CADE 1999

作者： Nipkow, Tobias Technische Universität München Institut für Informatik Germany

ISBN: (纸本)3540662227

the theory of programming languages is one of the core areas of computer sci- ence offering a wealth of models and methods. Yet the complexity of most real programming languages means that a complete formalization of their semantics is only of limited use unless it is supported by mechanical means for reasoning about the formalization. this line of research started in earnest with the seminal paper by Gordon [1] who dened the semantics of a simple while-language in the HOL system and derived Hoare logic from the semantics. Since then, an ever growing number of more and more sophisticated programming languages have been embedded in theorem provers. this talk surveys some of the important developments in this area before concentrating on a specic instance, Bali. Bali (http://***/Bali/) is an embedding of a subset of Java in Isabelle/HOL. So far, the following aspects have been covered:

关键词：

来源：评论

学校读者我要写书评

暂无评论

A BDI Agents programming Language Based Fuzzy Beliefs

A BDI Agents Programming Language Based Fuzzy Beliefs

引用

international conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC

作者： Mei Chen Department of Chemical Engineering and Materials Science

ISBN: (纸本)9781479986477

the Belief-Desire-Intention (BDI) model is well suited for describing an agent's mental state. To model human reasoning with uncertainty and imprecision, fuzzy logic have been employed to represent beliefs for BDI agents in our previous work. In order that the BDI agents are more and more suitable for modelling our real world, a BDI agent programming language with fuzzied-belief based on a existing BDI agent programming language is developed in this paper. the new language is more flexible and human-like compared to non-fuzzy based BDI agent language in the real world applications. Particularly, it provides a more reasonable planning selection mechanism. the reasoning capability of the previous BDI language is improved due to the work in this paper.

关键词： Computer languages Libraries Semantics Cognition Bismuth programming Planning

来源：评论

学校读者我要写书评

暂无评论

Mathematical applications of inductive logic programming

Mathematical applications of inductive logic programming

引用

13th international conference on Inductive logic programming

作者： Colton, Simon Muggleton, Stephen Univ London Imperial Coll Sci Technol & Med Dept Comp Computat Bioinformat Lab London SW7 2AZ England

the application of Inductive logic programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have driven the development of ILP systems. the application of AI techniques to mathematical discovery tasks, however, has largely involved computer algebra systems and theorem provers rather than machine learning systems. We discuss here the application of the HR and Progol machine learning programs to discovery tasks in mathematics. While Progol is an established ILP system, HR has historically not been described as an ILP system. However, many applications of HR have required the production of first order hypotheses given data expressed in a Prolog-style manner, and the core functionality of HR can be expressed in ILP terminology. In Colton (2003), we presented the first partial description of HR as an ILP system, and we build on this work to provide a full description here. HR performs a novel ILP routine called Automated theory Formation, which combines inductive and deductive reasoning to form clausal theories consisting of classification rules and association rules. HR generates definitions using a set of production rules, interprets the definitions as classification rules, then uses the success sets of the definitions to induce hypotheses from which it extracts association rules. It uses third party theorem provers and model generators to check whether the association rules are entailed by a set of user supplied axioms. HR has been applied successfully to a number of predictive, descriptive and subgroup discovery tasks in domains of pure mathematics. We survey various applications of HR which have led to it producing number theory results worthy of journal publication, graph theory results rivalling those of the highly successful Graffiti program and algebraic results leading to novel classification theorems. To further promote mathematics as a challenge domain for ILP systems, we present

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Foundations of Software Science and Computation Structures 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Anca Muscholl

ISBN: (数字)9783642548307

ISBN: (纸本)9783642548291

this book constitutes the proceedings of the 17th international conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint conferences on theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. the 28 papers included in this book, together with one invited talk, were selected from 106 full-paper submissions. the following topical areas are covered: probabilistic systems, semantics of programming languages, networks, program analysis, games and synthesis, compositional reasoning, bisimulation, categorical and algebraic models and logics of programming.

关键词： logics and Meanings of Programs Mathematical logic and Formal Languages programming Languages, Compilers, Interpreters Software Engineering Computation by Abstract Devices

来源：评论

学校读者我要写书评

暂无评论

Screening a Case Base for Stroke Disease Detection 11th

Screening a Case Base for Stroke Disease Detection

引用

11th international conference on Hybrid Artificial Intelligence Systems (HAIS)

作者： Neves, Jose Goncalves, Nuno Oliveira, Ruben Gomes, Sabino Neves, Joao Macedo, Joaquim Abelha, Antonio Analide, Cesar Machado, Jose Santos, Manuel Filipe Vicente, Henrique Univ Minho Ctr Algorithmi Braga Portugal Univ Minho Dept Informat Braga Portugal Drs Nicolas & Asp Dubai U Arab Emirates Univ Evora Escola Ciencias & Tecnol Dept Quim Evora Portugal

ISBN: (纸本)9783319320342;9783319320335

Stroke stands for one of the most frequent causes of death, without distinguishing age or genders. Despite representing an expressive mortality figure, the disease also causes long-term disabilities with a huge recovery time, which goes in parallel with costs. However, stroke and health diseases may also be prevented considering illness evidence. therefore, the present work will start with the development of a decision support system to assess stroke risk, centered on a formal framework based on logic programming for knowledge representation and reasoning, complemented with a Case Based reasoning (CBR) approach to computing. Indeed, and in order to target practically the CBR cycle, a normalization and an optimization phases were introduced, and clustering methods were used, then reducing the search space and enhancing the cases retrieval one. On the other hand, and aiming at an improvement of the CBR theoretical basis, the predicates attributes were normalized to the interval 0...1, and the extensions of the predicates that match the universe of discourse were rewritten, and set not only in terms of an evaluation of its Quality-of-Information (QoI), but also in terms of an assessment of a Degree-of-Confidence (DoC), a measure of one's confidence that they fit into a given interval, taking into account their domains, i.e., each predicate attribute will be given in terms of a pair (QoI, DoC), a simple and elegant way to represent data or knowledge of the type incomplete, self-contradictory, or even unknown.

关键词： Stroke Disease logic programming Knowledge Representation and reasoning Case Based reasoning Similarity Analysis

来源：评论

学校读者我要写书评

暂无评论

logic for programming, artificial intelligence, and reasoning : 8th international conference, LPAR 2

引用

2001年

作者： LPAR 2001

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

Machine Learning of Microbial Interactions Using Abductive ILP and Hypothesis Frequency/Compression Estimation 1

引用

30th international conference on Inductive logic programming (ILP) held as part of the 1st international Joint conference on Learning and reasoning (IJCLR)

作者： Barroso-Bergada, Didac Tamaddoni-Nezhad, Alireza Muggleton, Stephen H. Vacher, Corinne Galic, Nika Bohan, David A. Univ Bourgogne Franche Comte INRAE AgroSup Dijon Agroecol Dijon France Univ Surrey Guildford GU2 7XH Surrey England Imperial Coll London London SW7 2AZ England Univ Bordeaux BIOGECO INRAE Pessac France Syngenta Crop Protect LLC Greensboro NC 27409 USA

ISBN: (数字)9783030974541

ISBN: (纸本)9783030974541;9783030974534

Interaction between species in microbial communities plays an important role in the functioning of all ecosystems, from cropland soils to human gut microbiota. Many statistical approaches have been proposed to infer these interactions from microbial abundance information. However, these statistical approaches have no general mechanisms for incorporating existing ecological knowledge in the inference process. We propose an Abductive/Inductive logic programming (A/ILP) framework to infer microbial interactions from microbial abundance data, by including logical descriptions of different types of interaction as background knowledge in the learning. this framework also includes a new mechanism for estimating the probability of each interaction based on the frequency and compression of hypotheses computed during the abduction process. this is then used to identify real interactions using a bootstrapping, re-sampling procedure. We evaluate our proposed framework on simulated data previously used to benchmark statistical interaction inference tools. Our approach has comparable accuracy to SparCC, which is one of the state-of-the-art statistical interaction inference algorithms, but with the the advantage of including ecological background knowledge. Our proposed framework opens up the opportunity of inferring ecological interaction information from diverse ecosystems that currently cannot be studied using other methods.

关键词： Abductive/Inductive logic programming (A/ILP) Interaction Network Inference Machine learning of ecological networks Hypothesis Frequency Estimation (HFE)

来源：评论

学校读者我要写书评

暂无评论

Syntactically characterizing local-to-global consistency in ORD-horn

Syntactically characterizing local-to-global consistency in ...

引用

18th international conference on Principles and Practice of Constraint programming, CP 2012

作者： Wrona, Michal Department of Computer and Information Science Linköpings Universitet Linköping SE-581 83 Sweden

ISBN: (纸本)9783642335570

Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is globally consistent if it is completely explicit, that is, every partial solution may be extended to a full solution by greedily assigning values to variables one at a time. We will say that a structure B has local-to-global consistency if establishing local-consistency yields a globally consistent instance of . this paper studies local-to-global consistency for ORD-Horn languages, that is, structures definable over the ordered rationals (

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic of global synchrony 12th

引用

12th international conference on Concurrency theory, CONCUR 2001

作者： Chen, Yifeng Sanders, J.W. Department of Mathematics and Computer Science University of Leicester University Road LeicesterLE1 7RH United Kingdom Oxford University Computing Laboratory Parks Road OxfordOX1 3QD United Kingdom

ISBN: (纸本)3540424970

An intermediate-level specification notation, Logs, is presented for PRAM/BSP-style programming. It extends pre-post style semantics to reveal state at points of global synchronization before termination (if that occurs). the result is an integration of the pre-post, finite and reactive-process styles of specification and in particular an extension of standard BSP. the language is provided with a complete set of laws, formulated to benefit from a simple predicative semantics and to be quite close to programming intuition. the language is compositional, and parallel composition is simply logical conjunction. Use of Logs, and of the laws for reasoning about it, is demonstrated on the problem of the dining philosophers. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：