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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献
10 册 图书

馆藏范围

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

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 190 篇 软件工程
- 19 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
87 篇 理学
- 71 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
37 篇 管理学
- 28 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
4 篇 教育学
- 4 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

86 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 artificial intel...
9 篇 ontology
8 篇 logic gates
8 篇 mathematical log...
8 篇 functional progr...
6 篇 inductive logic ...
6 篇 programming tech...
6 篇 logics and meani...
6 篇 temporal logic
6 篇 logic design
4 篇 computer archite...
4 篇 logic
4 篇 logic circuits

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 madalina croitor...
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.

语言

357 篇 英文
8 篇 其他
4 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 365 条记录，以下是221-230 订阅

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

详细简洁

排序：

Proceedings of the ACM SIGPLAN international Conference on Functional programming, ICFP

Proceedings of the ACM SIGPLAN International Conference on F...

引用

3rd ACM SIGPLAN workshop on Functional High-Performance Computing, FHPC 2014

ISBN: (纸本)9781450330404

The proceedings contain 10 papers. The topics discussed include: Ziria: wireless programming for hardware dummies;pension reserve computations on GPUs;parallel computation of multifield topology: experience of Haskell in a computational science application;an efficient representation for lazy constructors using 64-bit pointers;size slicing - a hybrid approach to size inference in Futhark;defunctionalizing push arrays;fusing filters with integer linear programming;lazy data-oriented evaluation strategies;group communication patterns for high performance computing in Scala;native offload of Haskell Repa programs to integrated GPUs;and LambdaJIT: a dynamic compiler for heterogeneous optimizations of Stl algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Maude versus Haskell: An experimental comparison in security protocol analysis

Maude versus Haskell: An experimental comparison in security...

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Basin, David Denker, Grit Institut fur Informatik Albert-Ludwigs- Universitat Freiburg Universitatsgelande Flugplatz D-79110 Freiburg i. Br. Germany Computer Science Laboratory SRI International Menlo Park CA 94025 United States

We compare two executable languages: the rewriting logic based specification language Maude and the higher-order, lazy, functional programming language Haskell. We compare these languages experimentally on a problem in modeling and reasoning about a security protocol for authentication. We explore differences in how models can be formalized and analyzed, as well as performance and tool use. ©2000 Published by Elsevier Science B. V.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Semantics-based models for the representation of claims about cultural artifacts and their sources 10

Semantics-based models for the representation of claims abou...

引用

10th Extended Semantic Web Conference, ESWC 2013 workshops on 1st international workshop on Benchmarking rdF Systems, BeRSys 2013, 2nd workshop on Artificial Intelligence meets the Web of Data, AImWD 2013 and 3rd international workshop on Usage Analysis and the Web of Data, USEWOD 2013

作者： Vasilopoulou-Spitha, Aikaterini Bikakis, Antonis Department of Cultural Technology and Communication University of the Aegean Greece Department of Information Studies University College London London United Kingdom

Uncertainty and ambiguity are two inherent properties of historical and archaeological data. It is very often that different researchers express conflicting opinions about an artifact's chronology, creation, origin, style or identification. Ontology-based models, such as CIDOC-CRM, are already widely used for the representation of cultural artifacts, offering significant benefits, such as formality, flexibility and extensibility. They were, though, specifically designed to represent factual cultural data, and not claims or conflicting opinions expressed about cultural artifacts. In this paper, we examine how such models may be extended to integrate information about the sources of cultural information (e.g. bibliographic data) enabling users to assess the validity of this information. We also propose an alternative approach based on a more expressive language, N3 logic. Finally, we discuss argumentation theory as a tool for the natural representation of claims about cultural artifacts and the arguments they are associated with. Copyright © 2013 for the individual papers by the papers' authors.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A knowledge-based architecture supporting declarative action representation for manipulation of everyday objects 16

A knowledge-based architecture supporting declarative action...

引用

3rd workshop on Model-Driven Robot Software Engineering, MORSE 2016

作者： Javia, Binal Cimiano, Philipp CITEC University of Bielefeld Germany

ISBN: (纸本)9781450342599

We present a new knowledge-based robot architecture that relies on ontologies and logical programming to represent robot behavior in a declarative fashion. Most state-of-theart robot architectures, instead, build on very detailed procedural descriptions of robot behavior which are created at design time and typically do not generalize well across new situations. A declarative approach that produces actual robot behavior as a result of reasoning instead can produce many different behaviors that are adapted to the particular context and situation without having to model all influencing factors at design time. Further, this approach allows to add further knowledge or further primitives in a modular fashion. This simplifies the design of complex systems as the behaviour needs to be described at a higher-level of abstraction instead of by very detailed and specific procedures. The actual behaviour is then generated at runtime as a result of interpretation of logical programs. In our architecture we rely on Prolog to represent action knowledge, on (Horn) rules to represent actions and on Prolog resolution to infer execution plans at runtime. In this paper we present a first version of our architecture. As proof-of-concept we demonstrate how to apply it to generate pick-and-place behavior in a simulated environment. © 2016 ACM.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

The Regularization of Small Sub-Constraint Satisfaction Problems 22nd

The Regularization of Small Sub-Constraint Satisfaction Prob...

引用

22nd international Conference on Applications of Declarative programming and knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on Functional and Constraint logic programming, WFLP 2019

作者： Löffler, Sven Liu, Ke Hofstedt, Petra Department of Mathematics and Computer Science MINT Programming Languages and Compiler Construction Group Brandenburg University of Technology Cottbus-Senftenberg Konrad-Wachsmann-Allee 5 Cottbus03044 Germany

ISBN: (纸本)9783030467135

This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is to reduce the number of fails in the resolution process, to improve the inferences made during search by the constraint solver by strengthening constraint propagation, and to maintain the level of propagation while reducing the cost of propagating the constraints. Our experimental results show improvements in terms of the resolution speed compared to the original CSPs and a competitiveness to the recent tabulation approach [1, 15]. Besides, our approach can be realized in a preprocessing step, and therefore wouldn’t collide with redundancy constraints or parallel computing if implemented. © 2020, Springer Nature Switzerland AG.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Cyber threat analysis with structured probabilistic argumentation 3

Cyber threat analysis with structured probabilistic argument...

引用

3rd workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2019

作者： Leiva, Mario A. Simari, Gerardo I. Simari, Guillermo R. Shakarian, Paulo Argentina Cyber Reconnaissance Inc. TempeAZ United States

Capturing the uncertain aspects in cyber threat analyses is an important part of a wide range of efforts, including diagnostics, threat evaluation, and preventing attacks. However, there has been insufficient research and development of modeling approaches that are able to correctly capture and handle such uncertainty. In this work, we present an application example of the DeLP3E framework - a formalism that extends structured argumentation based on logic programming - in the domain of cyber threat analysis;in particular, near real-time analyses such as incident response in enterprise networks. The DeLP3E framework provides a unique combination of dialectical reasoning, rule-based inference, and probabilistic modeling to not only offer suggested responses to given situations, but also to explain to the analyst why the system reaches its conclusions. Copyright © 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 international (CC BY 4.0).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Parallelism for ASP-Solving 22nd

GPU-Based Parallelism for ASP-Solving

引用

作者： Dovier, Agostino Formisano, Andrea Vella, Flavio Dipartimento di Scienze Matematiche Informatiche e Fisiche Università di Udine Udine Italy Dipartimento di Matematica e Informatica Università di Perugia Perugia Italy Facoltà di Scienze e Tecnologie Informatiche Libera Università di Bolzano Bolzano Italy

ISBN: (纸本)9783030467135

Answer Set programming (ASP) has become the paradigm of choice in the field of logic programming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide range of application domains. Recently, with the advent of GPU Computing, which allowed the use of modern parallel Graphical Processing Units (GPUs) for general-purpose computing, new opportunities for accelerating ASP computation has arisen. In this paper, we describe a new approach for solving ASP that exploits the parallelism provided by GPUs. The design of a GPU-based solver poses various challenges due to the peculiarities of GPU in terms of both programmability and architecture capabilities with respect to the intrinsic nature of the satisfiability problems, which exposes poor parallelism. © 2020, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Modular Modeling and Optimized Scheduling of Building Energy Systems Based on Mixed Integer programming 22nd

Modular Modeling and Optimized Scheduling of Building Energy...

引用

作者： Wolf, Armin IT4Energy Center Fraunhofer FOKUS Kaiserin-Augusta-Allee 31 Berlin10589 Germany

ISBN: (纸本)9783030467135

Almost climate neutral buildings are one of the core goals in terms of sustainability. Beside the support of the necessary design decisions for an integrated, interoperable, ecological and economical operation of building energy systems, innovative management solutions for scheduling the operation of decentralized energy systems are of great importance. The challenge is an optimal interaction between energy system components in terms of own consumption, energy efficiency and resource consumption as well as greenhouse gas emissions. To achieve these goals a modular optimization approach based on Mixed Integer programming is proposed. In detail, and to our knowledge the first time, a MIP model for the dynamic behavior of fuel cell Combined Heat and Power plants is presented. Our approach is evaluated for the operation of heat pumps showing that their energy efficiency can be increased significantly. © 2020, Springer Nature Switzerland AG.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Bringing Belief Base Change into Dynamic Epistemic logic 2nd

Bringing Belief Base Change into Dynamic Epistemic Logic

引用

2nd international workshop on Dynamic logic (DaLi) as part of the Formal Methods Week / 3rd World Congress on Formal Methods

作者： Souza, Marlo Moreira, Alvaro Fed Univ Bahia UFBA Inst Math & Stat Av Adhemar de Barros S-N Salvador BA Brazil Fed Univ Rio Grande do Sul UFRGS Inst Informat Av Bento Goncalves BR-9500 Porto Alegre RS Brazil

ISBN: (纸本)9783030388089;9783030388072

AGM's belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been primarily used to specify the agent's belief state. While the connection of iterated AGM-like operations and their encoding in dynamic epistemic logics have been studied before, few works considered how well-known postulates from iterated belief revision theory can be characterised by means of belief bases and their counterpart in dynamic epistemic logic. Particularly, it has been shown that some postulates can be characterised through transformations in priority graphs, while others may not be represented that way. This work investigates changes in the semantics of Dynamic Preference logic that give rise to an appropriate syntactic representation for its models that allow us to represent and reason about iterated belief base change in this logic.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Entailment Procedure for Kleene Answer Set Programs 10th

引用

10th Multi-Disciplinary international workshop on Artificial Intelligence (MIWAI)

作者： Doherty, Patrick Szalas, Andrzej Linkoping Univ Dept Comp & Informat Sci SE-58183 Linkoping Sweden Univ Warsaw Inst Informat Banacha 2 PL-02097 Warsaw Poland

ISBN: (纸本)9783319493978;9783319493961

Classical Answer Set programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. Semantic theories for classical answer sets are implicitly three-valued in nature, yet with few exceptions, computing classical answer sets is based on translations into classical logic and the use of SAT solving techniques. In this paper, we introduce a variation of Kleene three-valued logic with strong connectives, R-3, and then provide a sound and complete proof procedure for R-3 based on the use of signed tableaux. We then define a restriction on the syntax of R-3 to characterize Kleene ASPs. Strongly-supported models, which are a subset of R-3 models are then defined to characterize the semantics of Kleene ASPs. A filtering technique on tableaux for R-3 is then introduced which provides a sound and complete tableau-based proof technique for Kleene ASPs. We then show a translation and semantic correspondence between Classical ASPs and Kleene ASPs, where answer sets for normal classical ASPs are equivalent to strongly-supported models. This implies that the proof technique introduced can be used for classical normal ASPs as well as Kleene ASPs. The relation between non-normal classical and Kleene ASPs is also considered.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：