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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

162 篇 会议
16 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

134 篇 工学
- 127 篇 计算机科学与技术...
- 60 篇 软件工程
- 14 篇 电气工程
- 13 篇 控制科学与工程
- 6 篇 机械工程
- 5 篇 信息与通信工程
- 4 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 环境科学与工程（可...
24 篇 理学
- 19 篇 数学
- 3 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学

主题

56 篇 logic programmin...
14 篇 mathematical log...
12 篇 logics and meani...
10 篇 artificial intel...
9 篇 programming lang...
8 篇 software enginee...
7 篇 computer circuit...
7 篇 formal logic
6 篇 semantics
5 篇 temporal logic
4 篇 optimization
4 篇 programming tech...
4 篇 algorithm analys...
4 篇 knowledge repres...
3 篇 fuzzy logic
3 篇 programmable log...
3 篇 higher-order log...
3 篇 programming
3 篇 symbolic and alg...
3 篇 computer communi...

机构

3 篇 new mexico state...
2 篇 tu wien austria
2 篇 tech univ munich...
2 篇 eth dept comp sc...
2 篇 institute of log...
2 篇 katholieke univ ...
2 篇 univ massachuset...
2 篇 imdea software i...
2 篇 michigan state u...
2 篇 univ hawaii dept...
2 篇 suny stony brook...
2 篇 temple univ dept...
1 篇 univ calabria de...
1 篇 national institu...
1 篇 escola politécni...
1 篇 laboratoire pps ...
1 篇 new mexico state...
1 篇 university of te...
1 篇 univ aizu grad s...
1 篇 department of in...

作者

3 篇 eiter thomas
2 篇 pontelli e
2 篇 giovannetti tani...
2 篇 leone nicola
2 篇 avrunin gs
2 篇 sakama chiaki
2 篇 yamaguchi takehi...
2 篇 mehta f
2 篇 fink m
2 篇 woltran stefan
2 篇 martono niken pr...
2 篇 eiter t
2 篇 serebrenik a
2 篇 sciavicco guido
2 篇 ohwada hayato
2 篇 faber wolfgang
2 篇 abe keisuke
2 篇 nipkow t
2 篇 dillon lk
2 篇 inoue katsumi

语言

182 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=19th International Conference on Logic Programming, ICLP 2003"

共 184 条记录，以下是71-80 订阅

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

详细简洁

排序：

Incremental tabling for query-driven propagation of logic program updates

Incremental tabling for query-driven propagation of logic pr...

引用

19th international conference on logic for programming, Artificial Intelligence, and Reasoning, LPAR 2013

作者： Saptawijaya, Ari Pereira, Luís Moniz Departamento de Informática Univ. Nova de Lisboa 2829-516 Caparica Portugal Fakultas Ilmu Komputer Universitas Indonesia Depok Indonesia

ISBN: (纸本)9783642452208

We foster a novel implementation technique for logic program updates, which exploits incremental tabling in logic programming - using XSB Prolog to that effect. Propagation of updates of fluents is controlled by initially keeping any fluent updates pending in the database. And, on the initiative of queries, making active just those updates up to the timestamp of an actual query, by performing incremental assertions of the pending ones. these assertions, in turn, automatically trigger system-implemented incremental bottom-up tabling of other fluents (or their negated complements), with respect to a predefined overall upper time limit, in order to avoid runaway iteration. the frame problem can then be dealt with by inspecting a table for the latest time a fluent is known to be assuredly true, i.e., the latest time it is not supervened by its negated complement, relative to the given query time. To do so, we adopt the dual program transformation for defining and helping propagate, also incrementally and bottom-up, the negated complement of a fluent, in order to establish whether a fluent is still true at some time point, or rather if its complement is. the use of incremental tabling in this approach affords us a form of controlled, but automatic, system level truth-maintenance, up to some actual query time. Consequently, propagation of update side-effects need not employ top-down recursion or bottom-up iteration through a logically defined frame axiom, but can be dealt with by the mechanics of the underlying world. Our approach thus reconciles high-level top-down deliberative reasoning about a query, with autonomous low-level bottom-up world reactivity to ongoing updates, and it might be adopted elsewhere for reasoning in logic. © Springer-Verlag 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

An algorithm for enumerating maximal models of horn theories with an application to modal logics

An algorithm for enumerating maximal models of horn theories...

引用

19th international conference on logic for programming, Artificial Intelligence, and Reasoning, LPAR 2013

作者： Aceto, Luca Della Monica, Dario Ingólfsdóttir, Anna Montanari, Angelo Sciavicco, Guido ICE-TCS School of Computer Science Reykjavik University Reykjavik Iceland Department of Mathematics and Computer Science University of Udine Udine Italy Department of Information Engineering and Communications University of Murcia Murcia Spain

ISBN: (纸本)9783642452208

the fragment of propositional logic known as Horn theories plays a central role in automated reasoning. the problem of enumerating the maximal models of a Horn theory (MAXMOD) has been proved to be computationally hard, unless P = NP. To the best of our knowledge, the only algorithm available for it is the one based on a brute-force approach. In this paper, we provide an algorithm for the problem of enumerating the maximal subsets of facts that do not entail a distinguished atomic proposition in a definite Horn theory (MAXNOENTAIL). We show that MAXMOD is polynomially reducible to MAXNOENTAIL (and vice versa), making it possible to solve also the former problem using the proposed algorithm. Addressing MAXMOD via MAXNOENTAIL opens, inter alia, the possibility of benefiting from the monotonicity of the notion of entailment. (the notion of model does not enjoy such a property.) We also discuss an application of MAXNOENTAIL to expressiveness issues for modal logics, which reveals the effectiveness of the proposed algorithm. © Springer-Verlag 2013.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Based Approach of Botnet Detection in Computer Systems

Multi-agent Based Approach of Botnet Detection in Computer S...

引用

19th international conference on Computer Networks

作者： Savenko, Oleg Lysenko, Sergiy Kryschuk, Andriy Khmelnytskyi Natl Univ Inst Telecommun & Comp Syst Dept Syst Programming Khmelnytskyi Ukraine

ISBN: (纸本)9783642312168

A new approach for the botnet detection based on multi-agent system is proposed. For increasing of the efficiency of botnet detection multi-agent systems were involve that allowed to make antivirus diagnosis via agents' communication within corporate network. the structure and main principles of antiviral agents' functioning within multi-agent system are developed. the principles of communication between the agent's units before and after attack on the computer system were developed. A new technique for sensor diagnosis in monitor mode which uses fuzzy logic was developed. A new technique for sensor diagnosis in scanner mode with generation of detectors using the modified negative selection algorithm was developed.

关键词： botnet Trojan worm-virus antivirus detection multi-agent system agent sensor fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Negotiation Strategies for Probabilistic Contracts in Web Services Orchestrations

Negotiation Strategies for Probabilistic Contracts in Web Se...

引用

IEEE international conference on Web Services (ICWS)

作者： Ajay Kattepur Albert Benveniste Claude Jard Equipe DistribCom IRISA/INRIA Campus Universitaire de Beaulieu Rennes France ENS Cachan Equipe DistribCom IRISA Université Européenne de Bretagne Bruz France

Service Level Agreements (SLAs) have been proposed in the context of web services to maintain acceptable quality of service (QoS) performance. this is specially crucial for composite service orchestrations that invoke many atomic services to render functionality. A consequence of SLA management entails efficient negotiation protocols among orchestrations and invoked services. In composite services where data and QoS (modeled in a probabilistic setting) interact, it is difficult to select an atomic service for negotiation, in order to improve end-to-end QoS performance. A superior improvement in one negotiated domain (eg. latency) might mean deterioration in another domain (eg. cost); improvement in one of the invoked services may be annulled by another due to the control flow specified in the orchestration. In this paper, we propose a integer programming formulation based on first order stochastic dominance as a strategy for re-negotiation over multiple services. A consequence of this is better end-to-end performance of the orchestration compared to random selection of services for re-negotiation. We also demonstrate this optimal strategy can be applied to negotiation protocols specified in languages such as Orc. Such strategies are necessary for composite services where QoS contributions from individual atomic services vary significantly.

关键词： Quality of service Contracts Optimization Web services Measurement Probabilistic logic Linear programming

来源：评论

学校读者我要写书评

暂无评论

System-level infrastructure for boot-time testing and configuration of networks-on-chip with programmable routing logic

System-level infrastructure for boot-time testing and config...

引用

2011 IEEE/IFIP 19th international conference on VLSI and System-on-Chip, VLSI-SoC 2011

作者： Ghiribaldi, Alberto Ludovici, Daniele Favalli, Michele Bertozzi, Davide ENDIF University of Ferrara 44100 Ferrara Italy

ISBN: (纸本)9781457701719

Networks-on-chip need to survive to manufacturing faults in order to sustain yield. An effective testing and configuration strategy however implies two opposite requirements. On one hand, a fast and scalable built-in self-testing and self-diagnosis procedure has to be carried out concurrently at NoC switches. On the other hand, programming the NoC routing mechanism to go around faulty links and switches can be optimally performed by a centralized controller with global network visibility. this paper proposes a global hardware infrastructure that meets such requirements by means of a fault-tolerant dual network architecture and a configuration strategy for reprogramming the routing mechanism of each switch. this is the first complete infrastructure for testing and reconfiguring a NoC based on reprogrammable routing logic. © 2011 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Inductive logic programming - 19th international conference, ILP 2009, Revised Papers

Inductive Logic Programming - 19th International Conference,...

引用

19th international conference on Inductive logic programming, ILP 2009

ISBN: (纸本)364213839X

the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic logic programming based on the distribution semantics;induction of relational algebra expressions;a logic-based approach to relation extraction from texts;discovering rules by meta-level abduction;inductive generalization of analytically learned goal hierarchies;nonmonotonic onto-relational learning;cp-logic theory inference with contextual variable elimination and comparison to BDD based inference methods;speeding up inference in statistical relational learning by clustering similar query literals;an inductive logic programming approach to validate hexose binding biochemical knowledge;boosting first-order clauses for large, skewed data sets;and transfer learning via relational templates.

关键词：

来源：评论

学校读者我要写书评

暂无评论

System-level infrastructure for boot-time testing and configuration of networks-on-chip with programmable routing logic

System-level infrastructure for boot-time testing and config...

引用

IFIP international conference on Very Large Scale Integration (VLSI-SoC)

作者： Alberto Ghiribaldi Daniele Ludovici Michele Favalli Davide Bertozzi ENDIF University of Ferrara Ferrara Italy

关键词： Routing Control systems Built-in self-test Topology Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

CP-logic theory Inference with Contextual Variable Elimination and Comparison to BDD Based Inference Methods

CP-Logic Theory Inference with Contextual Variable Eliminati...

引用

19th international conference on Inductive logic programming

作者： Meert, Wannes Struyf, Jan Blockeel, Hendrik Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

ISBN: (纸本)9783642138393

there is a growing interest in languages that combine probabilistic models with logic to represent complex domains involving uncertainty. Causal probabilistic logic (CP-logic), which has been designed to model causal processes, is such a probabilistic logic language. this paper investigates inference algorithms for CP-logic;these are crucial for developing learning algorithms. It proposes a new CP-logic inference method based on contextual variable elimination and compares this method to variable elimination and to methods based on binary decision diagrams.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

On the Relationship between logical Bayesian Networks and Probabilistic logic programming Based on the Distribution Semantics

On the Relationship between Logical Bayesian Networks and Pr...

引用

19th international conference on Inductive logic programming

作者： Fierens, Daan Katholieke Univ Leuven Dept Comp Sci B-3001 Heverlee Belgium

ISBN: (纸本)9783642138393

A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. there is currently a great need for insight into the relationships between all these languages. One kind of languages are those that extend probabilistic models with elements of logic, such as the language of logical Bayesian Networks (LBNs). Some other languages follow the converse strategy of extending logic programs with a probabilistic semantics, often in a way similar to that of Sato's distribution semantics. In this paper we study the relationship between the language of LBNs and languages based on the distribution semantics. Concretely, we define a mapping from LBNs to theories in the Independent Choice logic (ICL). We also show how this mapping can be used to learn ICL theories from data.

关键词： probabilistic (inductive) logic programming Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Directed theory Revision

Knowledge-Directed Theory Revision

引用

19th international conference on Inductive logic programming

作者： Ali, Kamal Leung, Kevin Konik, Tolga Choi, Dongkyu Shapiro, Dan Stanford Univ Ctr Study Language & Informat Cognit Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9783642138393

Using domain knowledge to speed up learning is widely accepted but theory revision of such knowledge continues to use general syntactic operators. Using such operators for theory revision of teleoreactive logic programs is especially expensive in which proof of a top-level goal involves playing a game. In such contexts, one should have the option to complement general theory revision with domain-specific knowledge. Using American football as an example, we use Icarus' multi-agent teleoreactive logic programming ability to encode a coach agent whose concepts correspond to faults recognized in execution of the play and whose skills correspond to making repairs in the goals of the player agents. Our results show effective learning using as few as twenty examples. We also show that structural changes made by such revision can produce performance gains that cannot be matched by doing only numeric optimization.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：