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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是101-110 订阅

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

详细简洁

排序：

Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set programming 29th

Modeling and Reasoning in Event Calculus Using Goal-Directed...

引用

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

作者： Arias, Joaquin Chen, Zhuo Carro, Manuel Gupta, Gopal IMDEA Software Inst Madrid Spain Univ Politecn Madrid Madrid Spain Univ Texas Dallas Richardson TX 75083 USA

ISBN: (纸本)9783030452599;9783030452605

Automated commonsense reasoning is essential for building human-like AI systems featuring, for example, explainable AI. Event Calculus (EC) is a family of formalisms that model commonsense reasoning with a sound, logical basis. Previous attempts to mechanize reasoning using EC faced difficulties in the treatment of the continuous change in dense domains (e.g., time and other physical quantities), constraints among variables, default negation, and the uniform application of different inference methods, among others. We propose the use of s(CASP), a query-driven, top-down execution model for Predicate Answer Set programming with Constraints, to model and reason using EC. We show how EC scenarios can be naturally and directly encoded in s(CASP) and how its expressiveness makes it possible to perform deductive and abductive reasoning tasks in domains featuring, for example, constraints involving both dense time and dense fluents.

关键词： ASP Goal-directed Event Calculus Constraints

来源：评论

学校读者我要写书评

暂无评论

Exploiting Configurations of MaxSAT Solvers 29

Exploiting Configurations of MaxSAT Solvers

引用

29th international conference on Principles and Practice of Constraint programming, CP 2023

作者： Alòs, Josep Ansótegui, Carlos Salvia, Josep M. Torres, Eduard University of Lleida Spain

ISBN: (纸本)9783959773003

In this paper, we describe how we can effectively exploit alternative parameter configurations to a MaxSAT solver. We describe how these configurations can be computed in the context of MaxSAT. In particular, we experimentally show how to easily combine configurations of a non-competitive solver to obtain a better solving approach. © Josep Alòs, Carlos Ansótegui, Josep M. Salvia, and Eduard Torres.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Drugs and Drug-Like Compounds: Discriminating Approved Pharmaceuticals from Screening-Library Compounds

Drugs and Drug-Like Compounds: Discriminating Approved Pharm...

引用

4th international conference Pattern Recognition in Bioinformatics

作者： Schierz, Amanda C. King, Ross D. Bournemouth Univ Software Syst Res Grp Poole HouseTalbot Campus Poole BH12 5BB Dorset England Aberystwyth Univ Computat Biol Res Grp Aberystwyth SY23 3DB Dyfed Wales

ISBN: (纸本)9783642040306

Compounds in drug screening-libraries should resemble pharmaceuticals. To operationally test this, we analysed the compounds in terms of known drug-like filters and developed a novel machine learning method to discriminate approved pharmaceuticals from "drug-like" compounds. this method uses both structural features and molecular properties for discrimination. the method has an estimated accuracy of 91% in discriminating between the Maybridge Hit-Finder library and approved pharmaceuticals, and 99% between the NATDiverse collection (from Analyticon Discovery) and approved pharmaceuticals. these results show that Lipinski's Rule of 5 for oral absorption is not Sufficient to describe "drug-likeness" and be the main basis of screening-library design.

关键词： inductive logic programming drug-likeness machine learning Rule of 5 compound screening library

来源：评论

学校读者我要写书评

暂无评论

Distributing AND-work and OR-work in parallel logic programming systems

Distributing AND-work and OR-work in parallel logic programm...

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： I.D.C. Dutra COPPE/Sistemas Federal Univ. of Rio de Janeiro Brazil

In parallel logic programming systems that exploit both AND-parallelism and OR-parallelism, the problem arises of how to distribute processors between the dynamically varying amounts of AND-work and OR-work that are available. Solutions have been reported for distributing only OR-work, or distributing only AND-work, but the issue of distributing processors between both kinds of work has not yet been addressed. In this paper, we discuss the problem of distributing AND-work and OR-work in the context of Andorra-I, a parallel logic programming system that exploits determinate AND-parallelism and OR-parallelism. We describe dynamic scheduling strategies that aim at efficiently distributing processors between AND-work and OR-work, and compare their performance with the performance produced by a static scheduling strategy, for a wide range of benchmarks.

关键词： logic programming Parallel processing Dynamic scheduling Processor scheduling Control systems Dynamic programming Parallel programming Electronic mail Pattern analysis Master-slave

来源：评论

学校读者我要写书评

暂无评论

Xeggora: Exploiting immune-to-evidence symmetries with full aggregation in statistical relational models 29

Xeggora: Exploiting immune-to-evidence symmetries with full ...

引用

29th international Joint conference on Artificial Intelligence, IJCAI 2020

作者： Amirian, Mohammad Mahdi Ghidary, Saeed Shiry Department of Computer Engineering Amirkabir University of Technology Tehran Iran Department of Math and Computer Science Amirkabir University of Technology Tehran Iran

ISBN: (纸本)9780999241165

We present improvements in maximum a-posteriori inference for Markov logic, a widely used SRL formalism. Several approaches, including Cutting Plane Aggregation (CPA), perform inference through translation to Integer Linear Programs. Aggregation exploits context-specific symmetries independently of evidence and reduces the size of the program. We illustrate much more symmetries occurring in long ground clauses that are ignored by CPA and can be exploited by higher-order aggregations. We propose Full-Constraint-Aggregation, a superior algorithm to CPA which exploits the ignored symmetries via a lifted translation method and some constraint relaxations. RDBMS and heuristic techniques are involved to improve the overall performance. We introduce Xeggora as an evolutionary extension of RockIt, the query engine that uses CPA. Xeggora evaluation on real-world benchmarks shows progress in efficiency compared to RockIt especially for models with long formulas. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Incremental Analysis of logic Programs with Assertions and Open Predicates 29th

Incremental Analysis of Logic Programs with Assertions and O...

引用

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

作者： Garcia-Contreras, Isabel Morales, Jose F. Hermenegildo, Manuel, V IMDEA Software Inst Madrid Spain Univ Politecn Madrid UPM Madrid Spain

ISBN: (纸本)9783030452599;9783030452605

Generic components are a further abstraction over the concept of modules, introducing dependencies on other (not necessarily available) components implementing specified interfaces. they have become a key concept in large and complex software applications. Despite undeniable advantages, generic code is also anti-modular. Precise analysis (e.g., for detecting bugs or optimizing code) requires such code to be instantiated with concrete implementations, potentially leading to expensive combinatorial explosion. In this paper we claim that incremental, whole program analysis can be very beneficial in this context, and alleviate the anti-modularity nature of generic code. We propose a simple Horn-clause encoding of generic programs, using open predicates and assertions, and we introduce a new incremental, multivariant analysis algorithm that reacts incrementally not only to changes in program clauses, but also to changes in the assertions, upon which large parts of the analysis graph may depend. We also discuss the application of the proposed techniques in a number of practical use cases. In addition, as a realistic case study, we apply the proposed techniques in the analysis of the LPdoc documentation system. We argue that the proposed traits are a convenient and elegant abstraction for modular generic programming, and that our preliminary results support our thesis that the new incrementality-related features added to the analysis bring promising advantages in this context.

关键词： Incremental static analysis Verification Assertions Generic code Specifications Abstract interpretation Horn clauses logic programs

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Static Cost Analysis of Parallel logic Programs 29th

A General Framework for Static Cost Analysis of Parallel Log...

引用

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

作者： Klemen, Maximiliano Lopez-Garcia, Pedro Gallagher, John P. Morales, Jose F. Hermenegildo, Manuel, V IMDEA Software Inst Madrid Spain Univ Politecn Madrid UPM ETSI Informat Madrid Spain Spanish Council Sci Res CSIC Madrid Spain Roskilde Univ Roskilde Denmark

ISBN: (纸本)9783030452599;9783030452605

the estimation and control of resource usage is now an important challenge in an increasing number of computing systems. In particular, requirements on timing and energy arise in a wide variety of applications such as internet of things, cloud computing, health, transportation, and robots. At the same time, parallel computing, with (heterogeneous) multi-core platforms in particular, has become the dominant paradigm in computer architecture. Predicting resource usage on such platforms poses a difficult challenge. Most work on static resource analysis has focused on sequential programs, and relatively little progress has been made on the analysis of parallel programs, or more specifically on parallel logic programs. We propose a novel, general, and flexible framework for setting up cost equations/relations which can be instantiated for performing resource usage analysis of parallel logic programs for a wide range of resources, platforms, and execution models. the analysis estimates both lower and upper bounds on the resource usage of a parallel program (without executing it) as functions on input data sizes. In addition, it also infers other meaningful information to better exploit and assess the potential and actual parallelism of a system. We develop a method for solving cost relations involving the max function that arise in the analysis of parallel programs. Finally, we instantiate our general framework for the analysis of logic programs with Independent And-Parallelism, report on an implementation within the CiaoPP system, and provide some experimental results. To our knowledge, this is the first approach to the cost analysis of parallel logic programs.

关键词： Resource usage analysis Parallelism Static analysis Complexity analysis (Constraint) logic programming Prolog

来源：评论

学校读者我要写书评

暂无评论

A propaedeutic on logic for object-oriented systems analysis and design

A propaedeutic on logic for object-oriented systems analysis...

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： S.O. Kimbrough W.J. Vachula The Wharton School University of Pennsylvania Philadelphia PA USA

this paper presents, motivates, and discusses a set of requirements for logic-based support of object-oriented systems analysis and design methods. It discusses the Object Modelling Technique (OMT) methodology, CASE t... 详细信息

关键词： logic design System analysis and design Object oriented modeling Information systems Databases Best practices Flowcharts Jacobian matrices programming Prototypes

来源：评论

学校读者我要写书评

暂无评论

logical specification of resource consumption and production

Logical specification of resource consumption and production

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： Y.U. Ryu Decision Sciences Department University of Texas Dallas Richardson TX USA

the difficulty in representing disposable resources as formulas of classical logic motivates the study of a new logic modeling system. there are similarities and differences between resource consumption/production and theorem proving in logic. Both are about deducibility (or producibility) of a formula (or a thing). the major difference is that once a disposable resource is used to produce something, it is not available any more; but a formula can be repeatedly used in deduction. We adopt a form of nonstandard logic called linear logic to develop a logic modelling system, of resources and implement it in a variant of the logic programming paradigm. the resource logic modeling system, can process state space models represented by Petri nets or their subclasses such as marked graphs and state machines. It can serve as a modeling tool for business procedures and production scheduling.

关键词： logic programming Petri nets State-space methods Standards development Availability Process planning Production systems Computer languages

来源：评论

学校读者我要写书评

暂无评论

Automated Control logic Test Case Generation using Large Language Models 29

Automated Control Logic Test Case Generation using Large Lan...

引用

29th IEEE international conference on Emerging Technologies and Factory Automation, ETFA 2024

作者： Koziolek, Heiko Ashiwal, Virendra Bandyopadhyay, Soumyadip Chandrika, K.R. Abb Research Ladenburg Germany Abb Research Bangalore India

ISBN: (纸本)9798350361230

Testing PLC and DCS control logic in industrial automation is laborious and challenging since appropriate test cases are often complex and difficult to formulate. Researchers have previously proposed several automated test case generation approaches for PLC software applying symbolic execution and search-based techniques. Often requiring formal specifications and performing a mechanical analysis of programs, these approaches may uncover specific programming errors but some-times suffer from state space explosion and cannot process rather informal specifications. We proposed a novel approach for the automatic generation of PLC test cases that queries a Large Language Model (LLM) to synthesize test cases for code provided in a prompt. Experiments with ten open-source function blocks from the OSCAT automation library showed that the approach is fast, easy to use, and can yield test cases with high statement coverage for low-to-medium complex programs. However, we also found that LLM-generated test cases suffer from erroneous assertions in many cases, which still require manual adaption. © 2024 IEEE.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：