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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
14 册 图书
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

153 篇 工学
- 134 篇 计算机科学与技术...
- 89 篇 软件工程
- 18 篇 电气工程
- 11 篇 控制科学与工程
- 5 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 机械工程
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 石油与天然气工程
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 食品科学与工程（可...
- 1 篇 生物工程
49 篇 理学
- 46 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 6 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 医学
- 1 篇 临床医学

主题

43 篇 logic programmin...
10 篇 mathematical log...
10 篇 probabilistic lo...
9 篇 fuzzy logic
9 篇 software enginee...
9 篇 logic gates
8 篇 computer circuit...
8 篇 semantics
7 篇 linear programmi...
7 篇 programming lang...
7 篇 artificial intel...
7 篇 logics and meani...
6 篇 optimization
6 篇 logic
5 篇 formal logic
5 篇 inductive logic ...
5 篇 knowledge repres...
4 篇 computer science
4 篇 programming
4 篇 application soft...

机构

2 篇 university of ma...
2 篇 univ london impe...
2 篇 institute of log...
2 篇 cornell univ dep...
2 篇 institute of mic...
2 篇 simon fraser uni...
2 篇 vienna univ tech...
2 篇 univ southampton...
2 篇 istanbul tech un...
2 篇 univ milano bico...
1 篇 osaka prefecture...
1 篇 national institu...
1 篇 system and softw...
1 篇 univ karlsruhe t...
1 篇 iit delhi dept c...
1 篇 dept. mathematic...
1 篇 univ bologna dei...
1 篇 univ wisconsin d...
1 篇 xidian univ inst...
1 篇 key laboratory o...

作者

4 篇 schaub torsten
4 篇 tompits hans
3 篇 muggleton stephe...
3 篇 riguzzi fabrizio
3 篇 woltran stefan
3 篇 lamma evelina
2 篇 neves mariana
2 篇 ternovska eugeni...
2 篇 gomes guida
2 篇 santos jose
2 篇 akira notsu
2 篇 penaloza rafael
2 篇 seiki ubukata
2 篇 voronkov andrei
2 篇 potena domenico
2 篇 storti emanuele
2 篇 olivetti nicola
2 篇 katsuhiro honda
2 篇 fadja arnaud ngu...
2 篇 de giacomo giuse...

语言

215 篇 英文
1 篇 其他
1 篇 中文

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

共 217 条记录，以下是61-70 订阅

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

详细简洁

排序：

Equivalences in Answer-Set programming by Countermodels in the logic of Here-and-there

Equivalences in Answer-Set Programming by Countermodels in t...

引用

24th international conference on logic programming (iclp)

作者： Fink, Michael Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783540899815

In Answer-Set programming different notions of equivalence, Such as the prominent notions of strong and uniform equivalence, have been studied and characterized by various selections of models in the logic of Here-and-there (HT). For uniform equivalence however, Correct characterizations in terms of HT-models can only be obtained for finite theories, respectively programs. In this paper, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. this result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HT-models and countermodels (so-called equivalence interpretations), which are lifted to first-order theories Under a very general semantics given in terms of a quantified version of HT. We show that countermodels exhibit expedient properties like I simplified treatment of extended signatures, and provide further results for non-ground logic programs. In particular, uniform equivalence coincides under open and ordinary answer-set semantics, and for finite non-ground programs Under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HT-models of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.

关键词： answer-set programming uniform equivalence knowledge representation program optimization

来源：评论

学校读者我要写书评

暂无评论

Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccinverted perpendicular

Testing Relativised Uniform Equivalence under Answer-Set Pro...

引用

17th international conference on Applications of Declarative programming and Knowledge Management/21st Workshop on logic programming

作者： Oetsch, Johannes Seidl, Martina Tompits, Hans Woltran, Stefan Vienna Univ Technol Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783642006746

the system cc inverted perpendicular is a tool for testing correspondence between propositional logic programs under the answer-set semantics with respect to different refined notions of program correspondence. the underlying methodology of cc inverted perpendicular is to reduce a given correspondence problem to the satisfiability problem of quantified propositional logic and to employ extant solvers for the latter language as back-end inference engines. In a previous version of cc inverted perpendicular, the system was designed to test correspondence between programs based on relativised strong equivalence under answer-set projection. Such a setting generalises the standard notion of strong equivalence by taking the alphabet of the context programs as well as the projection of the compared answer sets to a set of designated output atoms into account. this paper outlines a newly added component of cc inverted perpendicular for testing similarly parameterised correspondence problems based on uniform equivalence.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Concept Contraction in the Description logic EL 17

Concept Contraction in the Description Logic EL

引用

17th international conference on Principles of Knowledge Representation and Reasoning (KR and R)

作者： Rienstra, Tjitze Schon, Claudia Staab, Steffen Univ Koblenz Landau Mainz Germany Univ Stuttgart Stuttgart Germany Univ Southampton Southampton Hants England

ISBN: (纸本)9780999241172

In this paper we study the problem of concept contraction for the description logic EL. Concept contraction is concerned with the following question: Given two concepts C and D (with the interesting case being that D subsumes C) how can we find a generalisation of C that is not subsumed by D but is otherwise as similar as possible to C? We take an AGM-style approach and model this problem using the notion of a concept contraction operator. We consider constructive definitions as well as sets of postulates for concept contraction, and link the two by means of representation theorems.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

E-mobility and Multiagent Systems in Smart Grid 17

E-mobility and Multiagent Systems in Smart Grid

引用

17th international Scientific conference on Electric Power Engineering (EPE)

作者： Morte, Michal UJV Rez As Hydrogen Technol Dept Husinec Rez Czech Republic

ISBN: (纸本)9781509009084

From point of view of power engineering the successful commercial market with electric vehicles demands a completely new concept of their integration into contemporary electrical network. the electric vehicles have very limited range, so they have to be charged in short periods, that means for the grid problems with peaks in the daily load profile. the paper outlined one of the most promising - decentralization of the network with help of multiagent systems. Each agent collects and evaluates data about vehicles from small area, manages such area relative independently, so the main problem is to create an algorithm for optimal cooperation and communication with the other agents. the example of such cooperation is shown, firstly as the simple linear programming problem, the secondly more complex, with using the game theory which is the mathematical basis for multiagent systems. the system is connected with the smart grid, so the possibilities of altering the load profile are shown. the last chapter explores the necessity of the shift of such grid to artificial intelligence and the epistemic modal logic is presented as a possible solution.

关键词： e-mobility smart grids multiagent systems linear programming theory of game modal logic

来源：评论

学校读者我要写书评

暂无评论

Awareness in Games, Awareness in logic

Awareness in Games, Awareness in Logic

引用

17th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Halpern, Joseph Y. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9783642162411

Standard game theory models implicitly assume that all significant aspects of a game (payoffs, moves available, etc.) are common knowledge among the players. there are well-known techniques going back to Harsanyi [4] for transforming a game where some aspects are not common knowledge to one where they are common knowledge. © 2010 Springer-Verlag.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Mission-driven Resource Allocation based on Subjective Input with Extra Level of Uncertainty 17

Mission-driven Resource Allocation based on Subjective Input...

引用

17th international conference on Information Fusion (FUSION)

作者： de Groot, Teun H. Krasnov, Oleg A. Yarovoy, Alexander G. Delft Univ Technol Microwave Sensing Signals & Syst NL-2600 AA Delft Netherlands

ISBN: (纸本)9781479916344

this paper presents a solution based on subjective logic to include 'second-order uncertainty' in objective functions for mission-driven resource allocation. When resources have to be optimized, one of the requirements is a probabilistic assessment of future scenarios. However, the end-users who have to convey such future assessment may not be completely confident about it. It can therefore be necessary to specify a confidence level together with this input. With subjective logic it is possible to describe such second-order uncertainty. We used it to describe the uncertainty of assessments (e.g. about future threats) and models (e.g. of sensor systems) within the optimization objective. As a result, the integrity of the optimization improves, because excluding important uncertainties from the optimality definition is not, actually, optimal. In the end, although it is complicated to incorporate different levels of uncertainty, the resulting analysis about mission outcomes is more genuine, it creates transparency towards the end-users, and eventually, results in a resource allocation solution that takes more aspects into account.

关键词： Linear programming Observers Optimization Probabilistic logic Radar antennas Uncertainty Radar antennas Probabilistic logic Resource utilization Uncertainty linear programming Observers management of resources End users Sensor systems

来源：评论

学校读者我要写书评

暂无评论

A Query Evaluation Method for ASP with Abduction 38

A Query Evaluation Method for ASP with Abduction

引用

38th international conference on logic programming Workshops, iclp Workshops 2022

作者： Satoh, Ken National Institute of Informatics Tokyo Japan

In this paper, we present a goal-directed proof procedure for ASP with abduction. Our proposed procedure in this paper is correct for any consistent abductive framework proposed in [Kakas90a]. In other words, if the procedure succeeds, there is a set of hypotheses which satisfies a query, and if the procedure finitely fails, there is no such set. If we do not consider abducibles, this procedure is a goal-directed proof procedure for ASP as well. © 2022 Copyright for this paper by its authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Nondeterministic Strategies and their Refinement in Strategy logic 17

Nondeterministic Strategies and their Refinement in Strategy...

引用

17th international conference on Principles of Knowledge Representation and Reasoning (KR and R)

作者： De Giacomo, Giuseppe Maubert, Bastien Murano, Aniello Sapienza Univ Roma Rome Italy Univ Napoli Federico II Naples Italy

ISBN: (纸本)9780999241172

Nondeterministic strategies are strategies (or protocols, or plans) that, given a history in a game, assign a set of possible actions, all of which should be winning. An important problem is that of refining such strategies. For instance, given a nondeterministic strategy that allows only safe executions, refine it to, additionally, eventually reach a desired state of affairs. We show that strategic problems involving strategy refinement can be solved elegantly in the framework of Strategy logic (SL), a very expressive logic to reason about strategic abilities. Specifically, we introduce an extension of SL with nondeterministic strategies and an operator expressing strategy refinement. We show that model checking this logic can be done at no additional computational cost with respect to standard SL, and can be used to solve a variety of problems such as synthesis of maximally permissive strategies or maximally permissive Nash equilibria.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Inputs, Outputs, and Composition in the logic of Information Flows 17

Inputs, Outputs, and Composition in the Logic of Information...

引用

17th international conference on Principles of Knowledge Representation and Reasoning (KR and R)

作者： Aamer, Heba Bogaerts, Bart Surinx, Dimitri Ternovska, Eugenia Van den Bussche, Jan Univ Hasselt Hasselt Belgium Vrije Univ Brussel Brussels Belgium Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9780999241172

the logic of information flows (LIF) is a general framework in which tasks of a procedural nature can be modeled in a declarative, logic-based fashion. the first contribution of this paper is to propose semantic and syntactic definitions of inputs and outputs of LIF expressions. We study how the two relate and show that our syntactic definition is optimal in a sense that is made precise. the second contribution is a systematic study of the expressive power of sequential composition in LIF. Our results on composition tie in the results on inputs and outputs, and relate LIF to first-order logic (FO) and bounded-variable LIF to bounded-variable FO.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Verified Heap theorem Prover by Paramodulation 12

Verified Heap Theorem Prover by Paramodulation

引用

17th ACM SIGPLAN international conference on Functional programming

作者： Stewart, Gordon Beringer, Lennart Appel, Andrew W. Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450310543

We present VeriStar, a verified theorem prover for a decidable subset of separation logic. Together with VeriSmall [3], a proved-sound Smallfoot-style program analysis for C minor, VeriStar demonstrates that fully machine-checked static analyses equipped with efficient theorem provers are now within the reach of formal methods. As a pair, VeriStar and VeriSmall represent the first application of the Verified Software Toolchain [4], a tightly integrated collection of machine-verified program logics and compilers giving foundational correctness guarantees. VeriStar is (1) purely functional, (2) machine-checked, (3) end-to-end, (4) efficient and (5) modular. By purely functional, we mean it is implemented in Gallina, the pure functional programming language embedded in the Coq theorem prover. By machine-checked, we mean it has a proof in Coq that when the prover says "valid", the checked entailment holds in a proved-sound separation logic for C minor. By end-to-end, we mean that when the static analysis+theorem prover says a C minor program is safe, the program will be compiled to a semantically equivalent assembly program that runs on real hardware. By efficient, we mean that the prover implements a state-of-the-art algorithm for deciding heap entailments and uses highly tuned verified functional data structures. By modular, we mean that VeriStar can be retrofitted to other static analyses as a plug-compatible entailment checker and its soundness proof can easily be ported to other separation logics.

关键词： Verification Separation logic Paramodulation theorem Proving

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：