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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

103 篇 会议
19 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

93 篇 工学
- 92 篇 计算机科学与技术...
- 76 篇 软件工程
- 4 篇 控制科学与工程
- 3 篇 电气工程
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 化学工程与技术
- 1 篇 食品科学与工程（可...
- 1 篇 安全科学与工程
61 篇 理学
- 57 篇 数学
- 3 篇 系统科学
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
3 篇 医学
- 1 篇 基础医学(可授医学...
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

22 篇 logic programmin...
17 篇 answer set progr...
9 篇 semantics
6 篇 logic
6 篇 computer languag...
5 篇 programming
5 篇 inductive logic ...
4 篇 program transfor...
4 篇 java
4 篇 distributed comp...
4 篇 artificial intel...
3 篇 software systems
3 篇 programming prof...
3 篇 software enginee...
3 篇 electronic mail
3 篇 parallel program...
3 篇 stable models
3 篇 visualization
3 篇 machine learning
3 篇 verification

机构

4 篇 imdea software i...
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 篇 sabanci univ fac...
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.
3 篇 bartholomew mich...
3 篇 schaub torsten
3 篇 hermenegildo man...
3 篇 zhang yan
3 篇 balduccini marce...
3 篇 erdem esra
3 篇 chu geoffrey
3 篇 aziz rehan abdul
3 篇 morales jose f.
3 篇 lee joohyung
3 篇 inoue katsumi
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

语言

125 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

Automated Deduction – CADE 29 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Brigitte Pientka Cesare Tinelli

this open access book constitutes the proceedings of the 29th international conference on Automated Deduction, CADE 29, which took place in Rome, Italy, during July 2023.

ISBN: (数字)9783031384998

ISBN: (纸本)9783031384981

this open access book constitutes the proceedings of the 29th international conference on Automated Deduction, CADE 29, which took place in Rome, Italy, during July 2023.

关键词： Artificial Intelligence Mathematical logic and Formal Languages logics and Meanings of Programs Software Engineering/programming and Operating Systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of string constraint solvers in the context of Symbolic execution 14

Evaluation of string constraint solvers in the context of Sy...

引用

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

作者： Kausler, Scott Sherman, Elena Boise State University Department of Computer Science BoiseID83725 United States

ISBN: (纸本)9781450330138

Symbolic execution tools query constraint solvers for tasks such as determining the feasibility of program paths. therefore, the effectiveness of such tools depends on their constraint solvers. Most modern constraint solvers for primitive types are efficient and accurate. However, research on constraint solvers for complex types, such as strings, is less converged. In this paper, we introduce two new solver adequacy criteria, modeling cost and accuracy, to help the user identify an adequate solver. Using these metrics and performance criterion, we evaluate four distinct string constraint solvers in the context of symbolic execution. Our results show that, depending on the needs of the user and composition of the program, one solver might be more appropriate than another. Yet, none of the solvers exhibit the best results for all programs. Hence, if resources permit, the user will benefit the most from executing all solvers in parallel and enabling communication between solvers. © 2014 ACM.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) 1

引用

29th international conference on Automated Deduction (CADE)

作者： Frohn, Florian Giesl, Juergen Rhein Westfal TH Aachen LuFG Informat 2 Aachen Germany

We recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to transition systems and introduce ADCL-NT, a varian... 详细信息

ISBN: (数字)9783031384998

ISBN: (纸本)9783031384998;9783031384981

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A system for interactive query answering with answer set programming 6

A system for interactive query answering with answer set pro...

引用

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

作者： Gebser, Martin Obermeier, Philipp Schaub, Torsten Universität Potsdam Institut für Informatik Germany

Reactive answer set programming has paved the way for incorporating online information into operative solving processes. Although this technology was originally devised for dealing with data streams in dynamic environments, like assisted living and cognitive robotics, it can likewise be used to incorporate facts, rules, or queries provided by a user. As a result, we present the design and implementation of a system for interactive query answering with reactive answer set programming. Our system quontroller is based on the reactive solver oclingo and implemented as a dedicated front-end. We describe its functionality and implementation, and we illustrate its features by some selected use cases. © 2013 ***. All rights reserved.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Imperative Code from Answer Set programming Specifications 29th

Synthesizing Imperative Code from Answer Set Programming Spe...

引用

29th international conference on logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Varanasi, Sarat Chandra Salazar, Elmer Mittal, Neeraj Gupta, Gopal Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA

ISBN: (纸本)9783030452599;9783030452605

We consider the problem of obtaining an implementation of an algorithm from its specification. We assume that these specifications are written in answer set programming (ASP). ASP is an ideal formalism for writing specifications due to its highly declarative and expressive nature. To obtain an implementation from its specification, we utilize the operational semantics of ASP implemented in the s(ASP) system. this operational semantics is used to transform the declarative specification written in ASP to obtain an equivalent efficient program that uses imperative control features. this work is inspired by our overarching goal of automatically deriving efficient concurrent algorithms from declarative specifications. this paper reports our first step towards achieving that goal where we restrict ourselves to simple sequential algorithms. We illustrate our ideas through several examples. Our work opens up a new approach to logic-based program synthesis not explored before.

关键词： Program synthesis Program transformation Answer Set programming Partial evaluation Symbolic execution

来源：评论

学校读者我要写书评

暂无评论

ACL2s: "the ACL2 sedan" 07

ACL2s: "The ACL2 sedan"

引用

29th international conference on Software Engineering (ICSE 2007)

作者： Dillinger, Peter C. Manolios, Panagiotis Vroon, Daron Moore, J. Strother Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Texas Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9780769528922

ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race car, and it has been used to prove some of the most complex theorems ever proved about commercially designed systems. Unfortunately, ACL2 has a steep learning curve, and novices tend have a very different experience: they crash and bum. As part of a project to make ACL2 and formal reasoning accessible to the masses, we have developed ACL2s, the ACL2 sedan. ACL2s streamlines the learning process with features not previously available for ACL2. Our goal is to develop a tool that is "self-teaching," i.e., it should be possible for an undergraduate to sit down and play with it and learn how to program in ACL2 and how to reason about the programs she writes. the latest version of ACL2s is a significant step in that direction.

关键词： logic programming Utility programs Computer languages Educational institutions Software systems Vehicle crash testing User interfaces Computer applications Computer interfaces Documentation

来源：评论

学校读者我要写书评

暂无评论

A formal approach for cautious reasoning in answer set programming (extended abstract) 29

A formal approach for cautious reasoning in answer set progr...

引用

29th international Joint conference on Artificial Intelligence, IJCAI 2020

作者： Amendola, Giovanni Dodaro, Carmine Maratea, Marco DeMaCS University of Calabria Italy DIBRIS University of Genoa Italy

ISBN: (纸本)9780999241165

the issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo theories, Answer Set programming (ASP), and Constraint ASP, has been relatively recently solved employing abstract solvers. In this paper we deal with cautious reasoning tasks in ASP, and design, implement and test novel abstract solutions, borrowed from backbone computation in SAT. By employing abstract solvers, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. Some of the new solutions have been implemented in the ASP solver WASP, and tested. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

SociaLite: Datalog Extensions for Efficient Social Network Analysis

SociaLite: Datalog Extensions for Efficient Social Network A...

引用

29th IEEE international conference on Data Engineering (ICDE)

作者： Seo, Jiwon Guo, Stephen Lam, Monica S. Stanford Univ Comp Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9781467349093;9781467349086

With the rise of social networks, large-scale graph analysis becomes increasingly important. Because SQL lacks the expressiveness and performance needed for graph algorithms, lower-level, general-purpose languages are often used instead. For greater ease of use and efficiency, we propose SociaLite, a high-level graph query language based on Datalog. As a logic programming language, Datalog allows many graph algorithms to be expressed succinctly. However, its performance has not been competitive when compared to low-level languages. With SociaLite, users can provide high-level hints on the data layout and evaluation order;they can also define recursive aggregate functions which, as long as they are meet operations, can be evaluated incrementally and efficiently. We evaluated SociaLite by running eight graph algorithms (shortest paths, PageRank, hubs and authorities, mutual neighbors, connected components, triangles, clustering coefficients, and betweenness centrality) on two real-life social graphs, Live-Journal and Last. fm. the optimizations proposed in this paper speed up almost all the algorithms by 3 to 22 times. SociaLite even outperforms typical Java implementations by an average of 50% for the graph algorithms tested. When compared to highly optimized Java implementations, SociaLite programs are an order of magnitude more succinct and easier to write. Its performance is competitive, giving up only 16% for the largest benchmark. Most importantly, being a query language, SociaLite enables many more users who are not proficient in software engineering to make social network queries easily and efficiently.

关键词： Graph algorithms data base language Social network analysis SQL Social Networks Software engineering Language Java Java programming language

来源：评论

学校读者我要写书评

暂无评论

Hybrid automated reasoning tools: From black-box to clear-box integration 6

Hybrid automated reasoning tools: From black-box to clear-bo...

引用

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

作者： Balduccini, Marcello Lierler, Yulia College of Information Science and Technology Drexel University United States Computer Science Department University of Nebraska at Omaha United States

Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. these efforts resulted in a new research area: constraint answer set programming (CASP). CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks, such as scheduling problems with elements of planning. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas. this suggests a need for a study identifying general development principles of hybrid systems. Once these principles and their implications are well understood, the development of hybrid languages and systems may become a well-established and well-understood routine process. As a step in this direction, in this paper we conduct a case study aimed at evaluating various integration schemas of CASP methods. © 2013 ***. All rights reserved.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

BigYAP: Exo-compilation meets UDI

BigYAP: Exo-compilation meets UDI

引用

29th international conference on logic programming ICLP

作者： Costa, Vitor Santos Vaz, David Univ Porto CRACS DCC FCUP P-4100 Oporto Portugal

the widespread availability of large data-sets poses both an opportunity and a challenge to logic programming. A first approach is to couple a relational database with logic programming, say, a Prolog system with MySQL. While this approach does pay off in cases where the data cannot reside in main memory, it is known to introduce substantial overheads. Ideally, we would like the Prolog system to deal with large data-sets in an efficient way both in terms of memory and of processing time. Just In Time Indexing (JITI) was mainly motivated by this challenge, and can work quite well in many application. Exo-compilation, designed to deal with large tables, is a next step that achieves very interesting results, reducing the memory footprint over two thirds. We show that combining exo-compilation with Just In Time Indexing can have significant advantages both in terms of memory usage and in terms of execution time. An alternative path that is relevant for many applications is User-Defined Indexing (UDI). this allows the use of specialized indexing for specific applications, say the spatial indexing crucial to any spatial system. the UDI sees indexing as pluggable modules, and can naturally be combined with Exo-compilation. We do so by using UDI with exo-data, and incorporating ideas from the UDI into high-performance indexers for specific tasks.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：