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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

298 篇 会议
27 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

245 篇 工学
- 229 篇 计算机科学与技术...
- 117 篇 软件工程
- 19 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 信息与通信工程
- 6 篇 机械工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
53 篇 理学
- 39 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
- 2 篇 物理学
23 篇 管理学
- 14 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 经济学
- 3 篇 理论经济学
- 3 篇 应用经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 2 篇 社会学
1 篇 医学

主题

70 篇 logic programmin...
18 篇 inductive logic ...
15 篇 artificial intel...
12 篇 programming
12 篇 mathematical log...
11 篇 programming tech...
11 篇 logics and meani...
10 篇 software enginee...
10 篇 logic gates
10 篇 programming lang...
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 microsoft res re...
3 篇 univ paris 13 li...
3 篇 carnegie mellon ...
3 篇 aalto university...
3 篇 univ penn philad...
2 篇 univ wales dept ...
2 篇 stanford univ ct...
2 篇 politecn torino ...
2 篇 indian inst tech...
2 篇 univ freiburg in...
2 篇 univ wisconsin d...
2 篇 czech tech univ ...
2 篇 univ london impe...
2 篇 department of in...
2 篇 univ paris 13 li...
2 篇 harvard univ cam...
2 篇 columbia univ ct...
2 篇 ibm unternehmens...

作者

8 篇 gebser martin
6 篇 srinivasan ashwi...
6 篇 alphonse erick
5 篇 schaub torsten
5 篇 ricca francesco
4 篇 osmani aomar
4 篇 page david
4 篇 camacho rui
3 篇 yamamoto akihiro
3 篇 king ross
3 篇 rouveirol celine
3 篇 moreno gines
3 篇 leger hippolyte
3 篇 janhunen tomi
3 篇 maratea marco
3 篇 bouthinon domini...
3 篇 lebbah mustapha
2 篇 muggleton stephe...
2 篇 fronhöfer b
2 篇 khatibsyarbini

语言

332 篇 英文
7 篇 其他
5 篇 中文

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

共 344 条记录，以下是241-250 订阅

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

详细简洁

排序：

A comparison of reasoning techniques for querying large description logic ABoxes

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Motik, Boris Sattler, Ulrike Univ Manchester Manchester Lancs England

ISBN: (纸本)3540482814

Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. For such applications, we conjectured that reusing ideas of deductive databases might improve scalability of DL systems. Hence, in our previous work, we developed an algorithm for reducing a DL knowledge base to a disjunctive datalog program. To test our conjecture, we implemented our algorithm in a new DL reasoner KAON2, which we describe in this paper. Furthermore, we created a comprehensive test suite and used it to conduct a performance evaluation. Our results show that, on knowledge bases with large ABoxes but with simple TBoxes, our technique indeed shows good performance;in contrast, on knowledge bases with large and complex TBoxes, existing techniques still perform better. this allowed us to gain important insights into strengths and weaknesses of both approaches.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A tableau decision procedure for propositional intuitionistic logic

A tableau decision procedure for propositional intuitionisti...

引用

6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning

作者： Avellone, Alessandro Fiorino, Guido Moscato, Ugo Dipartimento di Metodi Quantitativi per l'Economia Università Milano-Bicocca Piazza dell'Ateneo Nuovo 1 20126 Milano Italy

the contribution of this paper consists in some techniques to bound the proof search space in propositional intuitionistic logic. these techniques are justified by Kripke semantics and they are the backbone of a tableau based theorem prover (PITP) implemented in C++ language. PITP and some known theorem provers are compared by the formulas of ILTP v1.1.1 benchmark library. It turns out that PITP is, at the moment, the propositional prover that solves most formulas of the library.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Blanqui, Frederic Riba, Colin UHP UMR 7503 CNRSLORIA INPLINRIA Campus SciBP 239 F-54506 Vandoeuvre Les Nancy France

ISBN: (纸本)3540482814

In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size based termination and initially developed for ML-like programs. Here, we go one step further by considering conditional rewriting and explicit quantifications and constraints on size annotations. this allows to describe more precisely how the size of the output of a function depends on the size of its inputs. Hence, we can check the termination of more functions. We first give a general type-checking algorithm based on constraint solving. then, we give a termination criterion with constraints in Presburger arithmetic. To our knowledge, this is the first termination criterion for higher-order conditional rewriting taking into account the conditions in termination.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A web architecture for data mining in biology

A web architecture for data mining in biology

引用

20th international conference on Advanced Information Networking and Applications

作者： Doncescu, Andrei Farmer, Muhammad Inoue, Katsumi Richard, Gibes LAAS Toulouse 7 Ave Colonel Roche F-31077 Toulouse France BITE London E13 0RA England NII Tokyo 101840 Japan Univ Toulouse 3 IRIT F-31062 Toulouse France

ISBN: (纸本)0769524664

In this paper, we present a current cooperative work involving different institutes around the world. Our aim is to provide an online inductive logic programming tool. this is the first step in a more complete structure for enabling e-technology for machine learning and bio-informatics. We describe the main architecture of the project and how the data will be formatted for being sent to the ILP machinery. We focus on a biological application (yeast fermentation process) due to its importance for high added value end products.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Randomised restarted search in ILP

Randomised restarted search in ILP

引用

13th international conference on inductive logic programming

作者： Zelezny, Filip Srinivasan, Ashwin Page, C. David, Jr. Czech Tech Univ CR-16635 Prague Czech Republic IBM India Res Lab New Delhi India Univ Wisconsin Madison WI USA

Recent statistical performance studies of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the search cost distribution of the non-restarted randomised search exhibits a slower-than-exponential decay (that is, a "heavy tail"), restarts can reduce the search cost expectation. We report on an empirical study of randomised restarted search in ILP. Our experiments conducted on a high-performance distributed computing platform provide an extensive statistical performance sample of five search algorithms operating on two principally different classes of ILP problems, one represented by an artificially generated graph problem and the other by three traditional classification benchmarks (mutagenicity, carcinogenicity, finite element mesh design). the sample allows us to (1) estimate the conditional expected value of the search cost (measured by the total number of clauses explored) given the minimum clause score required and a "cutoff" value (the number of clauses examined before the search is restarted), (2) estimate the conditional expected clause score given the cutoff value and the invested search cost, and (3) compare the performance of randomised restarted search strategies to a deterministic non-restarted search. Our findings indicate striking similarities across the five search algorithms and the four domains, in terms of the basic trends of both the statistics (1) and (2). Also, we observe that the cutoff value is critical for the performance of the search algorithm, and using its optimal value in a randomised restarted search may decrease the mean search cost (by several orders of magnitude) or increase the mean achieved score significantly with respect to that obtained with a deterministic non-restarted search.

关键词： inductive logic programming randomized search Monte Carlo study

来源：评论

学校读者我要写书评

暂无评论

Context-sensitive multivariant assertion checking in modular programs

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Pietrzak, Pawel Correas, Jesus Puebla, German Hermenegildo, Manuel V. Tech Univ Madrid Sch Comp Sci UPM Madrid Spain Univ Complutense Madrid Sch Comp Sci Madrid Spain Univ New Mexico CS Dept Albuquerque NM 87131 USA Univ New Mexico ECE Dept Albuquerque NM 87131 USA

ISBN: (纸本)3540482814

We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different characteristics and representing different trade-offs. Our proposal is a modular and multivariant extension of our previously proposed abstract assertion checking model and we also report on its implementation in the CiaoPP system. In our approach, the specification of the program, given by a set of assertions, may be partial, instead of the complete specification required by traditional verification systems. Also, the system can deal with properties which cannot always be determined at compile-time. As a result, the proposed system needs to work with safe approximations: all assertions proved correct are guaranteed to be valid and all errors actual errors. the use of modular, context-sensitive static analyzers also allows us to introduce a new distinction between assertions checked in a particular context or checked in general.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

SAT solving for argument filterings

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Codish, Michael Schneider-Kamp, Peter Lagoon, Vitaly thiemann, Rene Giesl, Juergen Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Rhein Westfal TH Aachen LuFG Informat 2 D-5100 Aachen Germany Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic Australia

ISBN: (纸本)3540482814

this paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. this facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (1) the combined search for a lexicographic path order together with an argument filtering to orient a set of inequalities;and (2) how the choice of the argument filtering influences the set of inequalities that have to be oriented. We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Constructing Camin-Sokal phylogenies via answer set programming

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Kavanagh, Jonathan Mitchell, David Ternovska, Eugenia Manuch, Jan Zhao, Xiaohong Gupta, Arvind Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)3540482814

Constructing parsimonious phylogenetic trees from species data is a central problem in phylogenetics, and has diverse applications, even outside biology. Many variations of the problem, including the cladistic Camin-Sokal (CCS) version, are NP-complete. We present Answer Set programming (ASP) models for the binary CCS problem, as well as a simpler perfect phylogeny version, along with experimental results of applying the models to biological data. Our contribution is three-fold. First, we solve phylogeny problems which have not previously been tackled by ASP. Second, we report on variants of our CCS model which significantly. affect run time, including the interesting case of making the program "slightly tighter". this version exhibits some of the best performance, in contrast with a tight version of the model which exhibited poor performance. third, we are able to find proven-optimal solutions for larger instances of the CCS problem than the widely used branch-and-bound-based PHYLIP package.

关键词： phylogeny maximum parsimony Camin-Sokal answer set programming

来源：评论

学校读者我要写书评

暂无评论

LIFT-UP: Lifted first-order planning under uncertainty

LIFT-UP: Lifted first-order planning under uncertainty

引用

6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning

作者： Hölldobler, Steffen Skvortsova, Olga International Center for Computational Logic Technische Universität Dresden Dresden Germany

We present a new approach for solving first-order Markov decision processes combining first-order state abstraction and heuristic search. In contrast to existing systems, which start with propositionalizing the decision process and then perform state abstraction on its propositionalized version we apply state abstraction directly on the decision process avoiding propositionalization. Secondly, guided by an admissible heuristic, the search is restricted to those states that are reachable from the initial state. We demonstrate the usefulness of the above techniques for solving first-order Markov decision processes within a domain dependent system called FluCaP which participated in the probabilistic track of the 2004 international Planning Competition. Working toward a domain independent implementation we present novel approaches to θ-subsumption involving literal and object contexts.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Multiple preprocessing for systematic SAT solvers

Multiple preprocessing for systematic SAT solvers

引用

6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning

作者： Anbulagan Slaney, John Logic and Computation Program National ICT Australia Ltd. Australia Computer Sciences Laboratory Australian National University Australia

High-performance SAT solvers based on systematic search generally use either conflict driven clause learning (CDCL) or lookahead techniques to gain efficiency. Both styles of reasoning can gain from a preprocessing phase in which some form of deduction is used to simplify the problem. In this paper we undertake an empirical examination of the effects of several recently proposed preprocessors on both CDCL and lookahead-based SAT solvers. One finding is that the use of multiple preprocessors one after the other can be much more effective than using any one of them alone, but that the order in which they are applied is significant. We intend our results to be particularly useful to those implementing new preprocessors and solvers.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共35页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：