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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,160 篇 会议
58 册 图书
37 篇 期刊文献

馆藏范围

1,254 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

922 篇 工学
- 870 篇 计算机科学与技术...
- 470 篇 软件工程
- 93 篇 控制科学与工程
- 66 篇 电气工程
- 43 篇 信息与通信工程
- 13 篇 机械工程
- 10 篇 土木工程
- 8 篇 建筑学
- 8 篇 石油与天然气工程
- 7 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 农业工程
242 篇 理学
- 203 篇 数学
- 19 篇 系统科学
- 18 篇 物理学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
97 篇 管理学
- 62 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 37 篇 工商管理
13 篇 教育学
- 12 篇 教育学
11 篇 医学
- 8 篇 基础医学(可授医学...
- 7 篇 临床医学
10 篇 法学
- 6 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 文学
3 篇 哲学

主题

254 篇 logic programmin...
53 篇 artificial intel...
50 篇 fuzzy logic
42 篇 semantics
40 篇 formal logic
40 篇 mathematical log...
32 篇 computer circuit...
31 篇 logics and meani...
27 篇 software enginee...
23 篇 integer programm...
22 篇 temporal logic
21 篇 programming tech...
20 篇 programming lang...
19 篇 programming
19 篇 calculations
19 篇 knowledge repres...
17 篇 computer science
17 篇 logic
17 篇 answer set progr...
14 篇 software enginee...

机构

9 篇 univ bath dept c...
9 篇 vienna univ tech...
5 篇 univ london impe...
5 篇 rhein westfal th...
5 篇 univ london impe...
5 篇 univ texas dept ...
4 篇 tu wien austria
4 篇 simon fraser uni...
4 篇 department of co...
4 篇 guangxi key labo...
4 篇 univ liverpool d...
4 篇 univ potsdam ins...
4 篇 carnegie mellon ...
4 篇 univ glamorgan c...
4 篇 univ potsdam ins...
3 篇 univ potsdam ins...
3 篇 theoretical comp...
3 篇 saitama univ dep...
3 篇 microsoft resear...
3 篇 univ potsdam pot...

作者

12 篇 schaub torsten
12 篇 de vos marina
10 篇 brain martin
9 篇 ricca francesco
8 篇 gebser martin
8 篇 russo alessandra
7 篇 gore rajeev
6 篇 leone nicola
6 篇 andrei voronkov
6 篇 xu yang
6 篇 giesl juergen
5 篇 cliffe owen
5 篇 eiter thomas
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 gupta gopal
5 篇 tompits hans
5 篇 schaub t
4 篇 mileo alessandra
4 篇 chang liang

语言

1,217 篇 英文
30 篇 其他
9 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=7th International Conference on Logic for Programming and Automated Reasoning"

共 1255 条记录，以下是201-210 订阅

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

详细简洁

排序：

Internet Routing and Non-monotonic reasoning 15th

Internet Routing and Non-monotonic Reasoning

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Wang, Anduo Chen, Zhijia Temple Univ Philadelphia PA 19122 USA

ISBN: (纸本)9783030205287;9783030205270

Internet routing is the process of selecting paths across the Internet to connect the communicating hosts, it is unique in that path selection is jointly determined by a network of independently operated networks, known as domains or Autonomous Systems (ASes), that interconnect to form the Internet. In fact, the present routing infrastructure takes such an extreme position that it favors local autonomy-an AS can use arbitrary path preference to override the default shortest path policy, at the expense of potential global oscillation-a collection of AS preferences (policies) can fail to converge on a stable path, a path that is also the most preferred possible for every AS along the path. In this paper, we examine the route oscillation problem with non-monotonic reasoning. We observe that, in the absence of any AS specific policies, Internet routing degenerates into the monotonic computation of shortest path-a preferred (shorter) (super)path always extends another preferred (sub)path;But fully autonomous AS policies are non-monotonic a path favored by one AS can be an extension of a less preferred path of a neighbor, to which an "upgrade" to a better path can cause this AS to downgrade to a less preferred path previously discarded. Based on this insight, we present an Answer Set programming (ASP) formulation that allows for automatic oscillation detection. Our evaluation using the clingo ASP solver is promising: on realistic Internet topology and representative policies, clingo can detect anomalies within 35 s.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2019 7th international conference in Software Engineering Research and Innovation, CONISOFT 2019

Proceedings - 2019 7th International Conference in Software ...

引用

7th international conference in Software Engineering Research and Innovation, CONISOFT 2019

ISBN: (纸本)9781728125244

the proceedings contain 27 papers. the topics discussed include: a novel approach for software requirement prioritization;a novel approach for software requirement prioritization based upon non functional requirements;evaluating the software quality non-functional requirement through a fuzzy logic-based model based on the ISO/IEC 25000 (SQuaRE) standard;when software engineering meets cybersecurity at the classroom;what is programming? putting all together, part II the cognitive skills associated;and exploring software design skills of students in different stages of their curriculum.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Self-certifiable Architecture for Critical Systems Powered by Probabilistic logic Artificial Intelligence 7th

A Self-certifiable Architecture for Critical Systems Powered...

引用

SAFECOMP conference / 7th ASSURE international Workshop / 14th DECSoS Workshop / 8th SASSUR international Workshop / 2nd STRIVE international Workshop / 2nd WAISE international Workshop

作者： Robin, Jacques Mazo, Raul Madeira, Henrique Barbosa, Raul Diaz, Daniel Abreu, Salvador Univ Pantheon Sorbonne Ctr Rech Informat Paris France Univ Coimbra Dept Engn Informat Coimbra Portugal Univ Evora Dept Informat Evora Portugal

We present a versatile architecture for AI-powered self-adaptive self-certifiable critical systems. It aims at supporting semi-automated low-cost recertification for self-adaptive systems after each adaptation of thei... 详细信息

ISBN: (纸本)9783030262501;9783030262495

关键词： AI certification Autonomic architecture Argumentation Rule-based constraint solving Probabilistic logic machine learning

来源：评论

学校读者我要写书评

暂无评论

Founded World Views with Autoepistemic Equilibrium logic 15th

Founded World Views with Autoepistemic Equilibrium Logic

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Cabalar, Pedro Fandinno, Jorge del Cerro Luis, Farinas Univ A Coruna La Coruna Spain Univ Toulouse CNRS IRIT Toulouse France

ISBN: (纸本)9783030205287;9783030205270

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introduces subjective literals. A subjective literal allows checking whether some regular literal is true in all (or in some of) the stable models of the program, being those models collected in a set called world view. One epistemic program may yield several world views but, under the original G91 semantics, some of them resulted from self-supported derivations. During the last eight years, several alternative approaches have been proposed to get rid of these self-supported world views. Unfortunately, their success could only be measured by studying their behaviour on a set of common examples in the literature, since no formal property of "self-supportedness" had been defined. To fill this gap, we extend in this paper the idea of unfounded set from standard logic programming to the epistemic case. We define when a world view is founded with respect to some program and propose the foundedness property for any semantics whose world views are always founded. Using counterexamples, we explain that the previous approaches violate foundedness, and proceed to propose a new semantics based on a combination of Moore's Autoepistemic logic and Pearce's Equilibrium logic. the main result proves that this new semantics precisely captures the set of founded G91 world views.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Elaboration Tolerant Representation of Markov Decision Process via Decision-theoretic Extension of Probabilistic Action Language pBC 15th

Elaboration Tolerant Representation of Markov Decision Proce...

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Wang, Yi Lee, Joohyung Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

ISBN: (纸本)9783030205287;9783030205270

We extend probabilistic action language pBC+ with the notion of utility in decision theory. the semantics of the extended pBC+ can be defined as a shorthand notation for a decision-theoretic extension of the probabilistic answer set programming language LPMLN. Alternatively, the semantics of pBC+ can also be defined in terms of Markov Decision Process (MDP), which in turn allows for representing MDP in a succinct and elaboration tolerant way as well as leveraging an MDP solver to compute a pBC+ action description. the idea led to the design of the system PBCPLUS2MDP, which can find an optimal policy of a pBC+ action description using an MDP solver.

关键词： Answer set programming Action language Markov Decision Process

来源：评论

学校读者我要写书评

暂无评论

Splitting Epistemic logic Programs 15th

Splitting Epistemic Logic Programs

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Cabalar, Pedro Fandinno, Jorge Farinas del Cerro, Luis Univ A Coruna Corunna Spain Univ Toulouse CNRS IRIT Toulouse France

ISBN: (纸本)9783030205287;9783030205270

Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, as the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing proposals fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond in 1991.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Non-monotonic reasoning on the Web 19th

Non-monotonic Reasoning on the Web

引用

19th international conference on Web Engineering (ICWE)

作者： Cristani, Matteo Univ Verona Dipartimento Informat Verona Italy

ISBN: (纸本)9783030192747;9783030192730

In this tutorial we describe the approaches to non monotonic reasoning as a means for inference on the web. In particular we are focusing on the ways in which reasoning technologies have adapted to five different issues of the modern era world wide web: (a) epistemic aspects, bound by the new models of the social web, (b) changes over time, (c) language variants, including different languages of deployment of a web site, (d) agent-based knowledge deployment, due to social networks and blogs, (e) dialogue aspects, introduced again in blogs and social networks. the presentation covers these aspects by a technical viewpoint, including the introduction of specific knowledge-driven methods. the technical issues will be provided within a general logical framework known as defeasible logic.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Degrees of Laziness in Grounding Effects of Lazy-Grounding Strategies on ASP Solving 15th

Degrees of Laziness in Grounding Effects of Lazy-Grounding S...

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Taupe, Richard Weinzierl, Antonius Friedrich, Gerhard Siemens AG Osterreich Vienna Austria Alpen Adria Univ Klagenfurt Klagenfurt Austria Vienna Univ Technol Inst Log & Computat Vienna Austria

ISBN: (纸本)9783030205287;9783030205270

the traditional ground-and-solve approach to Answer Set programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving and thus uses space more efficiently. the limited view on the search space in lazy grounding poses unique challenges, however, and can have adverse effects on solving performance. In this paper we present a novel characterization of degrees of laziness in grounding for ASP, i.e. of compromises between lazily grounding as little as possible and the traditional full grounding upfront. We investigate how these degrees of laziness compare to each other formally as well as, by means of an experimental analysis using a number of benchmarks, in terms of their effects on solving performance. Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance. Experiments show that our approach performs significantly better than state-of-the-art lazy grounding in many cases.

关键词： Answer Set programming Lazy grounding Heuristics

来源：评论

学校读者我要写书评

暂无评论

Treewidth and Counting Projected Answer Sets 15th

Treewidth and Counting Projected Answer Sets

引用

15th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Fichte, Johannes K. Hecher, Markus Tech Univ Dresden Dresden Germany TU Wien Vienna Austria

ISBN: (纸本)9783030205287;9783030205270

In this paper, we introduce novel algorithms to solve projected answer set counting (#PAs). #PAs asks to count the number of answer sets with respect to a given set of projection atoms, where multiple answer sets that are identical when restricted to the projection atoms count as only one projected answer set. Our algorithms exploit small treewidth of the primal graph of the input instance by dynamic programming (DP). We establish a new algorithm for head-cycle-free (HCF) programs and lift very recent results from projected model counting to #PAs when the input is restricted to HCF programs. Further, we show how established DP algorithms for tight, normal, and disjunctive answer set programs can be extended to solve #PAs. Our algorithms run in polynomial time while requiring double exponential time in the treewidth for tight, normal, and HCF programs, and triple exponential time for disjunctive programs. Finally, we take the exponential time hypothesis (Eth) into account and establish lower bounds of bounded treewidth algorithms for #PAs. Under Eth, one cannot significantly improve our obtained worst-case runtimes.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Applying Metamodel-based Tooling to Object-oriented Code 7th

Applying Metamodel-based Tooling to Object-oriented Code

引用

7th international conference on Model-Driven Engineering and Software Development (MODELSWARD)

作者： Klare, Heiko Saglam, Timur Burger, Erik Reussner, Ralf Karlsruhe Inst Technol Inst Program Struct & Data Org Karlsruhe Germany

ISBN: (纸本)9789897583582

Model-driven development processes mainly from the capabilities of modelling frameworks, since these offer an explicit representation of model elements and features, as well as reusable tooling, such as transformation languages or editor frameworks. Nevertheless, most software systems are not developed in a model-driven way although they do contain implicit models encoded in their object-oriented design. Adaptation to model-driven tooling imposes high manual effort and easily breaks compatibility with dependent code and existing tooling. We present an automated and minimally intrusive approach that makes implicit models in software systems explicit. We adapt existing object-oriented code so that it provides an explicit model representation, while preserving its original API. As a result, capabilities of modelling frameworks, such as persistence and change notifications, can be integrated into object-oriented code, and enable the application of reusable tools. We provide a classification of requirements that existing code has to fulfill, usable as an indicator for the applicability of modelling tools to them. An evaluation based on one artificial and two open-source case study systems shows the correct preservation of the API, as well as the ability to apply tooling to the modified code.

关键词： Model-driven Engineering modelling - programming Gap Reverse Engineering Model Extraction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：