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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

216 篇 会议
16 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

179 篇 工学
- 167 篇 计算机科学与技术...
- 84 篇 软件工程
- 23 篇 电气工程
- 13 篇 控制科学与工程
- 8 篇 信息与通信工程
- 7 篇 机械工程
- 5 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
- 1 篇 安全科学与工程
36 篇 理学
- 29 篇 数学
- 6 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 生物学
13 篇 管理学
- 11 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
5 篇 教育学
- 5 篇 教育学
3 篇 艺术学
- 3 篇 设计学（可授艺术学...
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 哲学
- 1 篇 哲学

主题

52 篇 logic programmin...
13 篇 mathematical log...
11 篇 logics and meani...
10 篇 artificial intel...
8 篇 semantics
8 篇 programming lang...
7 篇 computer circuit...
7 篇 formal logic
7 篇 software enginee...
5 篇 programming
5 篇 logic gates
5 篇 optimization
5 篇 programming tech...
5 篇 temporal logic
4 篇 data mining
4 篇 algorithm analys...
4 篇 inductive logic ...
4 篇 knowledge repres...
3 篇 object oriented ...
3 篇 fuzzy logic

机构

3 篇 new mexico state...
2 篇 tech univ munich...
2 篇 eth dept comp sc...
2 篇 institute of log...
2 篇 katholieke univ ...
2 篇 univ massachuset...
2 篇 vienna univ tech...
2 篇 imdea software i...
2 篇 michigan state u...
2 篇 univ hawaii dept...
2 篇 suny stony brook...
2 篇 hong kong univ s...
2 篇 univ texas dept ...
2 篇 temple univ dept...
1 篇 sd and m ag d-40...
1 篇 univ calabria de...
1 篇 escola politécni...
1 篇 univ massachuset...
1 篇 laboratoire pps ...
1 篇 new mexico state...

作者

4 篇 eiter thomas
3 篇 pontelli e
3 篇 sakama chiaki
3 篇 woltran stefan
3 篇 denecker marc
3 篇 inoue katsumi
3 篇 tompits hans
2 篇 giovannetti tani...
2 篇 leone nicola
2 篇 avrunin gs
2 篇 yamaguchi takehi...
2 篇 mehta f
2 篇 fink m
2 篇 martono niken pr...
2 篇 eiter t
2 篇 serebrenik a
2 篇 sciavicco guido
2 篇 ohwada hayato
2 篇 oetsch johannes
2 篇 faber wolfgang

语言

235 篇 英文
3 篇 中文
1 篇 其他

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

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

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

详细简洁

排序：

A logic programming view of authorization in distributed systems

引用

19th international conference on logic programming

作者： Winsborough, WH George Mason Univ Ctr Secure Informat Syst Fairfax VA 22030 USA

ISBN: (纸本)3540206426

An approach to authorization that is based on attributes of the resource requester provides flexibility and scalability that is essential in the context of large distributed systems. logic programming provides an elegant, expressive, and well-understood framework in which to work with attribute-based authorization policy. We summarize one specific attribute-based authorization framework built on logic programming: RT, a family of Role-based Trust-management languages. RT's logic programming foundation has facilitated the conception and specification of several extensions that greatly enhance its expressivity with respect to important security concepts such as parameterized roles, thresholds, and separation of duties. After examining language design issues, we consider the problem of assessing authorization policies with respect to vulnerability of resource owners to a variety of security risks due to delegations to other principals, risks such as undesired authorizations and unavailability of critical resources. We summarize analysis techniques for assessing such vulnerabilities.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Adding preferences to answer set planning

引用

19th international conference on logic programming

作者： Son, TC Pontelli, E New Mexico State Univ Dept Comp Sci Knowledge Representat Log & Adv Programming Lab Las Cruces NM 88003 USA

ISBN: (纸本)3540206426

Planning—in its classical sense—is the problem of finding a sequence of actions that achieves a predefined goal. As such, much of the research in AI planning has been focused on methodologies and issues related to the development of efficient planners. To date, several efficient planning systems have been developed (e.g., see [3] for a summary of planners that competed in the international conference on Artificial Intelligent Planning and Scheduling). these developments can be attributed to the discovery of good domain-independent heuristics, the use of domain-specific knowledge, and the development of efficient data structures used in the implementation of the planning algorithms. logic programming has played a significant role in this line of research, providing a declarative framework for the encoding of different forms of knowledge and its effective use during the planning process [5].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic and static symmetry breaking in answer set programming

Dynamic and static symmetry breaking in answer set programmi...

引用

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

作者： Benhamou, Belaïd Domaine univ. S. Jerome Ave. Escadrille Normandie Niemen 13397 Marseille Cedex 20 France Université d'Artois SP 18 Rue Jean Souvraz F 62307 Lens Cedex France

ISBN: (纸本)9783642452208

Many research works had been done in order to define a semantics for logic programs. the well know is the stable model semantics which selects for each program one of its canonical models. the stable models of a logic program are in a certain sens the minimal Herbrand models of its reduct programs. On the other hand, the notion of symmetry elimination had been widely studied in constraint programming and shown to be useful to increase the efficiency of the associated solvers. However symmetry in non monotonic reasoning still not well studied in general. For instance Answer Set programming (ASP) is a very known framework but only few recent works on symmetry breaking are known in this domain. Ignoring symmetry breaking in the answer set systems could make them doing redundant work and lose on their efficiency. Here we study the notion of local and global symmetry in the framework of answer set programming. We show how local symmetries of a logic program can be detected dynamically by means of the automorphisms of its graph representation. We also give some properties that allow to eliminate theses symmetries in SAT-based answer set solvers and show how to integrate this symmetry elimination in these methods in order to enhance their efficiency. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A real implementation for constructive negation

引用

19th international conference on logic programming

作者： Muñoz, S Moreno-Navarro, JJ Univ Politecn Madrid Fac Informat LSIIS Madrid 28660 Spain

ISBN: (纸本)3540206426

logic programming has been advocated as a language for system specification, especially for logical behaviours, rules and knowledge. However, modeling problems involving negation, which is quite natural in many cases, is somewhat restricted if Prolog is used as the specification/implementation language. these constraints are not related to theory viewpoint, where users can find many different models with their respective semantics; they concern practical implementation issues. the negation capabilities supported by current Prolog systems are rather limited, and a correct and complete implementation there is not available. Of all the proposals, constructive negation [1,2] is probably the most promising because it has been proven to be sound and complete [4], and its semantics is fully compatible with Prolog’s.

关键词： constructive negation negation in logic programming constraint logic programming implementations of logic programming

来源：评论

学校读者我要写书评

暂无评论

Efficient inductive logic programming Based on Particle Swarm Optimization 4th

Efficient Inductive Logic Programming Based on Particle Swar...

引用

4th European-Alliance-for-Innovation (EAI) international conference on Artificial Intelligence for Communications and Networks (AICON)

作者： Obara, Kyosuke Takimoto, Munehiro Kumazawa, Tsutomu Kambayashi, Yasushi Tokyo Univ Sci Dept Informat Sci Chiba Japan Software Res Associates Inc Toshima Ku Tokyo Japan Nippon Inst Technol Dept Comp & Informat Engn Saitama Japan

ISBN: (纸本)9783031291258;9783031291265

inductive logic programming (ILP) is an inductive reasoning method based on the first-order predicative logic. this technology is widely used for data mining using symbolic artificial intelligence. ILP searches for a suitable hypothesis that covers positive examples and uncovers negative examples. the searching process requires a lot of execution cost to interpret many given examples for practical problems. In this paper, we propose a new hypothesis search method using particle swarm optimization (PSO). PSO is a meta-heuristic algorithm based on behaviors of particles. In our approach, each particle repeatedly moves from a hypothesis to another hypothesis within a hypothesis space. At that time, some hypotheses are refined based on the value returned by a predefined evaluation function. Since PSO just searches a part of the hypothesis space, it contributes to the speed up of the execution of ILP. In order to demonstrate the effectiveness of our method, we have implemented it on Progol that is one of the ILP systems [6], and then we conducted numerical experiments. the results showed that our method reduced the hypothesis search time compared to another conventional Progol.

关键词： inductive logic programming Particle swarm optimization Progol

来源：评论

学校读者我要写书评

暂无评论

A Relational Framework for Higher-Order Shape Analysis 14

A Relational Framework for Higher-Order Shape Analysis

引用

19th ACM SIGPLAN international conference on Functional programming (ICFP)

作者： Kaki, Gowtham Jagannathan, Suresh Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450328739

We propose the integration of a relational specification framework within a dependent type system capable of verifying complex invariants over the shapes of algebraic datatypes. Our approach is based on the observation that structural properties of such datatypes can often be naturally expressed as inductively-defined relations over the recursive structure evident in their definitions. By interpreting constructor applications (abstractly) in a relational domain, we can define expressive relational abstractions for a variety of complex data structures, whose structural and shape invariants can be automatically verified. Our specification language also allows for definitions of parametric relations for polymorphic data types that enable highly composable specifications and naturally generalizes to higher-order polymorphic functions. We describe an algorithm that translates relational specifications into a decidable fragment of first-order logic that can be efficiently discharged by an SMT solver. We have implemented these ideas in a type checker called CATALYST that is incorporated within the MLton SML compiler. Experimental results and case studies indicate that our verification strategy is both practical and effective.

关键词： Relational Specifications inductive Relations Parametric Relations Dependent Types Decidability Standard ML

来源：评论

学校读者我要写书评

暂无评论

SYNthESIS OF thE SR programming LANGUAGE FOR COMPLEX FPGAS

SYNTHESIS OF THE SR PROGRAMMING LANGUAGE FOR COMPLEX FPGAS

引用

19th international conference on Field Programmable logic and Applications

作者： Gasson, Nick Audsley, Neil Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)9781424438914

Most existing approaches to targeting high-level software to FPGAs are based on extensions to C and do not map easily to the features and characteristics of modern FPGAs. these include massive parallelism and a variety of complex IP-blocks (eg. RAMs, DSPs). In this paper we discuss a hardware implementation of SR, a software language with first class concurrency and high-level IPC. We show that the language model can be implemented efficiently on an FPGA, and that it provides a natural means to encapsulate FPGA resources. We compare against a commercial C-based synthesis tool and achieve similar resource usage using a more expressive language.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Forward versus backward verification of logic programs

引用

19th international conference on logic programming

作者： King, A Lu, LJ Univ Kent Comp Lab Canterbury CT2 7NF Kent England Oakland Univ Dept Comp Sci Rochester MI 48309 USA

ISBN: (纸本)3540206426

One recent development in logic programming has been the application of abstract interpretation to verify the partial correctness of a logic program with respect to a given set of assertions. One approach to verification is to apply forward analysis that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program point. this is often enough to verify that the assertions hold. the dual approach is to apply backward analysis to propagate properties of the allowable states against the control-flow to infer queries for which the program will not violate any assertion. this paper is a systematic comparison of these two approaches to verification. the paper reports some equivalence results that relate the relative power of various forward and backward analysis frameworks.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Simulated Annealing Meta-heuristic for Concept Learning in Description logics 1

引用

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

作者： Westphal, Patrick Vahdati, Sahar Lehmann, Jens Fraunhofer Inst Intelligent Anal & Informat Syst Dresden Germany Inst Appl Informat Leipzig Germany Univ Bonn Bonn Germany

ISBN: (数字)9783030974541

ISBN: (纸本)9783030974541;9783030974534

Ontologies - providing an explicit schema for underlying data - often serve as background knowledge for machine learning approaches. Similar to ILP methods, concept learning utilizes such ontologies to learn concept expressions from examples in a supervised manner. this learning process is usually cast as a search process through the space of ontologically valid concept expressions, guided by heuristics. Such heuristics usually try to balance explorative and exploitative behaviors of the learning algorithms. While exploration ensures a good coverage of the search space, exploitation focuses on those parts of the search space likely to contain accurate concept expressions. However, at their extreme ends, both paradigms are impractical: A totally random explorative approach will only find good solutions by chance, whereas a greedy but myopic, exploitative attempt might easily get trapped in local optima. To combine the advantages of both paradigms, different meta-heuristics have been proposed. In this paper, we examine the Simulated Annealing meta-heuristic and how it can be used to balance the exploration-exploitation trade-off in concept learning. In different experimental settings, we analyse how and where existing concept learning algorithms can benefit from the Simulated Annealing meta-heuristic.

关键词： inductive logic programming (ILP) Description logic (DL) Concept Learning (CL) Meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

Implementation of Robot Journalism by programming Custombot using Tokenization and Custom Tagging 19

Implementation of Robot Journalism by Programming <i>Customb...

引用

19th international conference on Advanced Communication Technology (ICACT)

作者： Lee, Naeun Kim, Kirak Yoon, Taeseon Hankuk Acad Foreign Studies Yongin Gyeonggi South Korea

ISBN: (纸本)9788996865094

the paper introduces a prototype of an algorithm that creates personalized news articles about IT and technology based on each personal preference for a specific theme, criteria, or element. When provided a specific personal preference, the algorithm Custombot analyses the data, derives the most appropriate topic that contains the most elements preferred by a person, and eventually produces a one and only news article on that topic. While processing and analysing data by inductive reasoning, Custombot considers the concepts of news angle and filter bubble. Text segmentation (tokenization) and custom tagging are two of the tasks that are used for the construction of this system, allowing to make custom tags and insert matching information in appropriate places. Its result of customized news article can serve as a new service provided by news organizations to satisfy each consumer's needs, and can also be a stepping stone in expanding the role or increasing the importance of robot journalism in a broad field of journalism.

关键词： Custom Tagging Filter Bubble News Angle Personalized News Robot Journalism Tokenization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：