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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

90 篇 会议
21 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 84 篇 计算机科学与技术...
- 71 篇 软件工程
- 3 篇 控制科学与工程
- 2 篇 电气工程
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 食品科学与工程（可...
- 1 篇 安全科学与工程
60 篇 理学
- 58 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
2 篇 医学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

23 篇 logic programmin...
18 篇 answer set progr...
6 篇 logic
6 篇 computer languag...
6 篇 semantics
6 篇 artificial intel...
4 篇 programming
4 篇 program transfor...
4 篇 java
4 篇 distributed comp...
4 篇 inductive logic ...
3 篇 software systems
3 篇 programming prof...
3 篇 software enginee...
3 篇 electronic mail
3 篇 parallel program...
3 篇 mathematical log...
3 篇 stable models
3 篇 visualization
3 篇 logics and meani...

机构

4 篇 imdea software i...
3 篇 sabanci univ fac...
2 篇 alan turing inst...
2 篇 roskilde univ ro...
2 篇 univ melbourne d...
2 篇 univ piemonte or...
2 篇 univ nova lisboa...
2 篇 dept informat p-...
2 篇 spanish council ...
2 篇 katholieke univ ...
2 篇 kobe univ nada k...
2 篇 university of ox...
2 篇 abb research lad...
2 篇 univ alberta edm...
2 篇 abb research ban...
2 篇 univ potsdam d-1...
2 篇 res org informat...
2 篇 macquarie univ d...
2 篇 univ so calif de...
2 篇 suny stony brook...

作者

4 篇 stuckey peter j.
4 篇 schaub torsten
4 篇 erdem esra
3 篇 banbara mutsunor...
3 篇 bartholomew mich...
3 篇 hermenegildo man...
3 篇 zhang yan
3 篇 balduccini marce...
3 篇 morales jose f.
3 篇 lee joohyung
3 篇 inoue katsumi
3 篇 tamura naoyuki
2 篇 uras tansel
2 篇 giordano laura
2 篇 dumancic sebasti...
2 篇 soh takehide
2 篇 maher michael j.
2 篇 spiotta matteo
2 篇 jorissen albert
2 篇 janssens gerda

语言

116 篇 英文
1 篇 中文

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

共 117 条记录，以下是51-60 订阅

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

详细简洁

排序：

logic programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Peter J. Stuckey

ISBN: (数字)9783540456193

ISBN: (纸本)9783540439301

this book constitutes the refereed proceedings of the 18th international conference on logic programming, iclp 2002, held in Copenhagen, Denmark, in July/August 2002.;the 29 revised full papers presented together with two invited contributions and 13 posters were carefully reviewed and selected from 82 submissions. All current aspects of logic programming and computational logic are addressed.

关键词： Computer System Implementation Software Engineering/programming and Operating Systems Mathematical logic and Foundations Artificial Intelligence programming Techniques programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

Answer set programming as a modeling language for course timetabling

Answer set programming as a modeling language for course tim...

引用

29th international conference on logic programming iclp

作者： Banbara, Mutsunori Soh, Takehide Tamura, Naoyuki Inoue, Katsumi Schaub, Torsten Kobe Univ Nada Ku Kobe Hyogo 6578501 Japan Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Univ Potsdam D-14482 Potsdam Germany

the course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. the modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.

关键词： answer set programming educational timetabling course timetabling

来源：评论

学校读者我要写书评

暂无评论

Language fuzzing using constraint logic programming 14

Language fuzzing using constraint logic programming

引用

29th ACM/IEEE international conference on Automated Software Engineering, ASE 2014

作者： Dewey, Kyle Roesch, Jared Hardekopf, Ben University of California Santa Barbara United States

ISBN: (纸本)9781450330138

Fuzz testing builds confidence in compilers and interpreters. It is desirable for fuzzers to allow targeted generation of programs that showcase specific language features and behaviors. However, the predominant program generation technique used by most language fuzzers, stochastic context-free grammars, does not have this property. We propose the use of constraint logic programming (CLP) for program generation. Using CLP, testers can write declarative predicates specifying interesting programs, including syntactic features and semantic behaviors. CLP subsumes and generalizes the stochastic grammar approach. © 2014 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Aspartame: Solving constraint satisfaction problems with answer set programming 6

Aspartame: Solving constraint satisfaction problems with ans...

引用

6th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th international conference on logic programming, iclp 2013

作者： Banbara, M. Gebser, M. Inoue, K. Schaub, T. Soh, T. Tamura, N. Weise, M. University of Kobe Japan University of Potsdam Germany National Institute of Informatics Tokyo Japan

Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. this allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. the resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. the obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting aspartame and sugar. © 2013 ***. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support

SeaLion: An eclipse-based IDE for answer-set programming wit...

引用

29th international conference on logic programming iclp

作者： Busoniu, Paula-Andra Oetsch, Johannes Puehrer, Joerg Skocovsky, Peter Tompits, Hans Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Dept Informat P-2829516 Caparica Portugal

In this paper, we present SeaLion, an integrated development environment (IDE) for answer-set programming (ASP). SeaLion provides source-code editors for the languages of Gringo and DLV and offers popular amenities like syntax highlighting, syntax checking, code completion, visual program outline, and refactoring functionality. the tool has been realised in the context of a research project whose goal is the development of techniques to support the practical coding process of answer-set programs. In this respect, SeaLion is the first IDE for ASP that provides debugging features that work for real-world answer-set programs and supports the rich languages of modern answer-set solvers. Indeed, SeaLion implements a stepping-based debugging approach that allows the developer to quickly track down programming errors by simply following his or her intuitions on the intended semantics. Besides that, SeaLion supports ASP development using model-driven engineering techniques including domain modelling with extended UML class diagrams and visualisation of answer sets in corresponding instance diagrams. Moreover, customised visualisation as well as visual editing of answer sets is realised by the Kara plugin of SeaLion. Further implemented features are a documentation generator based on the LANA annotation language, support for external solvers, and interoperability with external tools. SeaLion comes as a plugin of the popular Eclipse platform and provides interfaces for future extensions of the IDE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Towards Meta-interpretive Learning of programming Language Semantics 1

引用

29th international conference on Inductive logic programming

作者： Bartha, Sandor Cheney, James Univ Edinburgh Lab Fdn Comp Sci Edinburgh Midlothian Scotland Alan Turing Inst London England

ISBN: (数字)9783030492106

ISBN: (纸本)9783030492090;9783030492106

We introduce a new application for inductive logic programming: learning the semantics of programming languages from example evaluations. In this short paper, we explore a simplified task in this domain using the Metagol meta-interpretive learning system. We high-light the challenging aspects of this scenario, including abstracting over function symbols, nonterminating examples, and learning non-observed predicates, and propose extensions to Metagol helpful for overcoming these challenges, which may prove useful in other domains.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic logic Programs over Continuous Data 1

引用

29th international conference on Inductive logic programming

作者： Speichert, Stefanie Belle, Vaishak Univ Edinburgh Edinburgh Midlothian Scotland Alan Turing Inst London England

ISBN: (数字)9783030492106

ISBN: (纸本)9783030492090;9783030492106

the field of statistical relational learning aims at unifying logic and probability to reason and learn from data. Perhaps the most successful paradigm in the field is probabilistic logic programming (PLP): the enabling of stochastic primitives in logic programming. While many systems offer inference capabilities, the more significant challenge is that of learning meaningful and interpretable symbolic representations from data. In that regard, inductive logic programming and related techniques have paved much of the way for the last few decades, but a major limitation of this exciting landscape is that only discrete features and distributions are handled. Many disciplines express phenomena in terms of continuous models. In this paper, we propose a new computational framework for inducing probabilistic logic programs over continuous and mixed discrete-continuous data. Most significantly, we show how to learn these programs while making no assumption about the true underlying density. Our experiments show the promise of the proposed framework.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

An Instance Based Model for Scalable θ-Subsumption 29

An Instance Based Model for Scalable θ-Subsumption

引用

29th Annual IEEE international conference on Tools with Artificial Intelligence (ICTAI)

作者： Leger, Hippolyte Bouthinon, Dominique Lebbah, Mustapha Azzag, Hanene Univ Paris 13 LIPN UMR CNRS 7030 99 Ave Jean Baptiste Clement F-93430 Villetaneuse France

ISBN: (纸本)9781538638767

the theta-subsumption test is known to be a bottleneck in Inductive logic programming. the state-of-the-art learning systems in this field are hardly scalable. Last year, we have created a distributed theta-subsumption process based on an Actor Model, with the aim of being able to decide subsumption on very large clauses. this model was correct and complete, but was also very slow. this is why we introduce ANTS (Actor Network based theta-Subsumption), a new model also based on an actor network, which is significantly faster than the previous one.

关键词： theta-subsumption inductive logic programming actor model distributed computing Akka

来源：评论

学校读者我要写书评

暂无评论

A practical analysis of non-termination in large logic programs

A practical analysis of non-termination in large logic progr...

引用

29th international conference on logic programming iclp

作者： Liang, Senlin Kifer, Michael SUNY Stony Brook Dept Comp Sci Stony Brook NY USA

A large body of work has been dedicated to termination analysis of logic programs but relatively little has been done to analyze non-termination. In our opinion, explaining non-termination is a much more important task because it can dramatically improve a user's ability to effectively debug large, complex logic programs without having to abide by punishing syntactic restrictions. Non-termination analysis examines program execution history when the program is suspected to not terminate and informs the programmer about the exact reasons for this behavior. In Liang and Kifer (2013), we studied the problem of non-termination in tabled logic engines with subgoal abstraction, such as XSB, and proposed a suite of algorithms for non-termination analysis, called Terminyzer. these algorithms analyze forest logging traces and output sequences of tabled subgoal calls that are the likely causes of non-terminating cycles. However, this feedback was hard to use in practice: the same subgoal could occur in multiple rule heads and in even more places in rule bodies, so Terminyzer left too much tedious, sometimes combinatorially large amount of work for the user to do manually. Here we propose a new suite of algorithms, Terminyzer(+), which closes this usability gap. Terminyzer+ can detect not only sequences of subgoals that cause non-termination, but, importantly, the exact rules where they occur and the rule sequences that get fired in a cyclic manner, thus causing non-termination. this makes Terminyzer(+) suitable as a back-end for user-friendly graphical interfaces on top of Terminyzer(+), which can greatly simplify the debugging process. Terminyzer(+) back-ends exist for the SILK system as well as for the open-source Flora-2 system. A graphical interface has been developed for SILK and is currently underway for Flora-2. We also report experimental studies, which confirm the effectiveness of Terminyzer(+) on a host of large real-world knowledge bases. All tests used in this pape

关键词： terminyzer termination and non-termination analysis logic programming

来源：评论

学校读者我要写书评

暂无评论

A prototype development of a declarative approach for computer system security 29

A prototype development of a declarative approach for comput...

引用

29th international conference on Computer Applications in Industry and Engineering, CAINE 2016

作者： Bai, Yun Caprin, Edward Zhang, Yan Artificial Intelligence Research Group School of Computing Engineering and Mathematics Western Sydney University Australia

ISBN: (纸本)9781943436040

In information security, representation and reasoning of authorization policy has been a key research topic in this field especially in a sophisticated information sharing and exchange environment [6, 7, 9]. In such a scenario, an user's request to access the system may not be able to decide straightaway, it may initiate a sequence of complex executions of authorization commands in order to determine either to grant or deny such a request. Becker and Nanz's logic of State-Modifying Policies (SMP) is a formal system addressing such problem in access control. In this paper, we provide a declarative semantics for SMP through a translation from SMP to Answer Set programming (ASP) and propose a system prototype to implement our approach. Our experimental results show that our ASP implementation for SMP reasoning is effective to deal with real world problem domains. Copyright ISCA, CAINE 2016.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共12页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：