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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
4 册 图书

馆藏范围

329 篇 电子文献
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 ...
12 篇 programming
10 篇 logic gates
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
6 篇 artificial intel...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...
4 篇 model checking
4 篇 java
4 篇 computer languag...
4 篇 integer programm...
4 篇 hardware

机构

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

语言

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

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

共 329 条记录，以下是111-120 订阅

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

详细简洁

排序：

Multi-level algorithm selection for ASP 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Maratea, Marco Pulina, Luca Ricca, Francesco DIBRIS Univ. degli Studi di Genova Viale F. Causa 15 Genova16145 Italy POLCOMING Univ. degli Studi di Sassari Viale Mancini 5 Sassari07100 Italy Dip. di Matematica ed Informatica Univ. della Calabria Via P. Bucci Rende87030 Italy

ISBN: (纸本)9783319232638

Automated algorithm selection techniques have been applied successfully to Answer Set programming (ASP) solvers. ASP computation includes two levels of computation: variable substitution, called grounding, and propositional answer set search, called solving. In this paper we present me-aspML, an extended ASP system applying algorithm selection techniques to both levels of computation in order to choose the most promising solving strategy. Experiments conducted on benchmarks and solvers of the Fifth ASP Competition shows that me-aspML is able to solve more instances than state-of-the-art systems. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Non-wellfounded trees in homotopy type theory 13

Non-wellfounded trees in homotopy type theory

引用

13th international conference on Typed Lambda Calculi and Applications, TLCA 2015

作者： Ahrens, Benedikt Capriotti, Paolo Spadotti, Régis Institut de Recherche en Informatique de Toulouse Université Paul Sabatier Toulouse France Functional Programming Laboratory School of Computer Science University of Nottingham United Kingdom

ISBN: (纸本)9783939897873

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type theory. the conjecture says that in the presence of inductive types, coinductive types are derivable. Indeed, in this work, we construct coinductive types in a subsystem of Homotopy Type theory;this subsystem is given by Intensional Martin- Löf type theory with natural numbers and Voevodsky's Univalence Axiom. Our results are mechanized in the computer proof assistant Agda. © Benedikt Ahrens, Paolo Capriotti, and Régis Spadotti;.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Solving disjunctive fuzzy answer set programs 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Mushthofa, Mushthofa Schockaert, Steven De Cock, Martine Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science Bogor Agricultural University Bogor Indonesia Center for Data Science University of Washington Tacoma Tacoma United States

ISBN: (纸本)9783319232638

Fuzzy Answer Set programming (FASP) is an extension of the popular Answer Set programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method. © Springer international Publishing Switzerland 2015.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Enablers and inhibitors in causal justifications of logic programs 1

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Cabalar, Pedro Fandinno, Jorge Department of Computer Science University of Corunna A Corunna Spain

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated a justification represented as an algebraic expression. this expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively call enablers and inhibitors, are intimately related to default negation and have an essentially different nature from regular cause-effect relations. the most important result is a formal comparison to the recent algebraic approaches for justifications in LP: Why-not Provenance (WnP) and Causal Graphs (CG). We show that the current approach extends both WnP and CG justifications under theWell-Founded Semantics and, as a byproduct, we also establish a formal relation between these two approaches. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Answer set programming modulo acyclicity 1

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Bomanson, Jori Gebser, Martin Janhunen, Tomi Kaufmann, Benjamin Schaub, Torsten Aalto University HIIT Espoo Finland University of Potsdam Potsdam Germany INRIA Rennes Rennes France

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. the resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. the implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation. © Springer international Publishing Switzerland 2015.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Compacting boolean formulae for inference in probabilistic logic programming 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Mantadelis, theofrastos Shterionov, Dimitar Janssens, Gerda CRACS and INESC TEC University of Porto Rua do Campo Alegre 1021/1055 Porto4169-007 Portugal Department of Computer Science KU Leuven Celestijnenlaan 200A Heverlee2402 3001 Belgium

ISBN: (纸本)9783319232638

Knowledge compilation converts Boolean formulae for which some inference tasks are computationally expensive into a representation where the same tasks are tractable. ProbLog is a state-of-the-art Probabilistic logic programming system that uses knowledge compilation to reduce the expensive probabilistic inference to an efficient weighted model counting. Motivated to improve ProbLog’s performance we present an approach that optimizes Boolean formulae in order to speed-up knowledge compilation. We identify 7 Boolean subformulae patterns that can be used to re-write Boolean *** implemented an algorithm with polynomial complexity which detects and compacts 6 of these patterns. We employ our method in the inference pipeline of ProbLog and conduct extensive experiments. We show that our compaction method improves knowledge compilation and consecutively the overall inference performance. Furthermore, using compaction reduces the number of time-outs, allowing us to solve previously unsolvable problems. © Springer international Publishing Switzerland 2015.

关键词： Compaction

来源：评论

学校读者我要写书评

暂无评论

Automating the Development of Metabolic Network Models 13th

Automating the Development of Metabolic Network Models

引用

13th international conference on Computational Methods in Systems Biology (CMSB)

作者： Rozanski, Robert Bragaglia, Stefano Ray, Oliver King, Ross Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England Univ Bristol Dept Comp Sci Bristol BS8 1TH Avon England

ISBN: (纸本)9783319234014;9783319234007

Although substantial progress has been made in the automation of many areas of systems biology, from data processing and model building to experimentation, comparatively little work has been done on integrated systems that combine all of these aspects. this paper presents an active learning system, "Huginn", that integrates experiment design and model revision in order to automate scientific reasoning about Metabolic Network Models. We have validated our approach in a simulated environment using substantial test cases derived from a state-of-the-art model of yeast metabolism. We demonstrate that Huginn can not only improve metabolic models, but that it is able to both solve a wider range of biochemical problems than previous methods, and to utilise a wider range of experiment types. Also, we show how design of extended crucial experiments can be automated using Abductive logic programming for the first time.

关键词： Metabolism

来源：评论

学校读者我要写书评

暂无评论

ASP solving for expanding universes 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Gebser, Martin Janhunen, Tomi Jost, Holger Kaminski, Roland Schaub, Torsten Aalto University HIIT Espoo Finland INRIA Rennes Rennes France University of Potsdam Potsdam Germany

ISBN: (纸本)9783319232638

Over the last years, Answer Set programming has significantly extended its range of applicability, and moved beyond solving static problems to dynamic ones, even in online environments. However, its nonmonotonic nature as well as its upstream instantiation process impede a seamless integration of new objects into its reasoning process, which is crucial in dynamic domains such as logistics or robotics. We address this problem and introduce a simple approach to successively incorporating new information into ASP systems. Our approach rests upon a translation of logic programs and thus refrains from any dedicated algorithms. We prove its modularity as regards the addition of new information and show its soundness and completeness. We apply our methodology to two domains of the Fifth ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On PLCs Control Program Hardware Implementation Selected Problems of Mapping and Scheduling 13

On PLCs Control Program Hardware Implementation Selected Pro...

引用

13th IFAC and IEEE conference on Programmable Devices and Embedded Systems

作者： Milik, Adam Silesian Univ Technol Gliwice Inst Elect Gliwice Poland

the paper shows the FPGA dedicated method of mapping a PLC program written according to the IEC61131-3 standard. there is described complete synthesis process from the program description to hardware implementation through mapping and scheduling procedures. PLCs' programming languages are translated into common intermediate graph form. It enables massive parallel implementation. there is presented an originally developed graph structure with attribute edges. Finally the graph mapping methodologies are discussed. A general hardware mapping concept and algorithms for utilizing specific FPGA components are presented. An efficient mapping of the DSP48 block is shown. It attempts to utilize all features of the block in pipelined calculation model. the consideration are summarized with implementation result comparison for general hardware mapping and with use of DSP48 units. (C) 2015, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： PLC FPGA DSP48 LD IL SFC DFG high level synthesis logic synthesis reconfigurable hardware

来源：评论

学校读者我要写书评

暂无评论

Combining heuristics for configuration problems using answer set programming 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Gebser, Martin Ryabokon, Anna Schenner, Gottfried HIIT Aalto University Espoo Finland University of Potsdam Potsdam Germany Alpen-Adria-Universität Klagenfurt Klagenfurt Austria Siemens AG Österreich Vienna Austria

ISBN: (纸本)9783319232638

this paper describes an abstract problem derived from a combination of Siemens product configuration problems encountered in practice. Often isolated parts of configuration problems can be solved by mapping them to well-studied problems for which efficient heuristics exist (graph coloring, bin-packing, etc.). Unfortunately, these heuristics may fail to work when applied to a problem that combines two or more subproblems. In the paper we show how to formulate a combined configuration problem in Answer Set programming (ASP) and to solve it using heuristics à la hclasp. In addition, we present a novel method for heuristic generation based on a combination of greedy search with ASP that allows to improve the performance of an ASP solver. © Springer international Publishing Switzerland 2015.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：