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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

298 篇 会议
27 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

245 篇 工学
- 229 篇 计算机科学与技术...
- 117 篇 软件工程
- 19 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 信息与通信工程
- 6 篇 机械工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
53 篇 理学
- 39 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
- 2 篇 物理学
23 篇 管理学
- 14 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 经济学
- 3 篇 理论经济学
- 3 篇 应用经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 2 篇 社会学
1 篇 医学

主题

70 篇 logic programmin...
18 篇 inductive logic ...
15 篇 artificial intel...
12 篇 programming
12 篇 mathematical log...
11 篇 programming tech...
11 篇 logics and meani...
10 篇 software enginee...
10 篇 logic gates
10 篇 programming lang...
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 microsoft res re...
3 篇 univ paris 13 li...
3 篇 carnegie mellon ...
3 篇 aalto university...
3 篇 univ penn philad...
2 篇 univ wales dept ...
2 篇 stanford univ ct...
2 篇 politecn torino ...
2 篇 indian inst tech...
2 篇 univ freiburg in...
2 篇 univ wisconsin d...
2 篇 czech tech univ ...
2 篇 univ london impe...
2 篇 department of in...
2 篇 univ paris 13 li...
2 篇 harvard univ cam...
2 篇 columbia univ ct...
2 篇 ibm unternehmens...

作者

8 篇 gebser martin
6 篇 srinivasan ashwi...
6 篇 alphonse erick
5 篇 schaub torsten
5 篇 ricca francesco
4 篇 osmani aomar
4 篇 page david
4 篇 camacho rui
3 篇 yamamoto akihiro
3 篇 king ross
3 篇 rouveirol celine
3 篇 moreno gines
3 篇 leger hippolyte
3 篇 janhunen tomi
3 篇 maratea marco
3 篇 bouthinon domini...
3 篇 lebbah mustapha
2 篇 muggleton stephe...
2 篇 fronhöfer b
2 篇 khatibsyarbini

语言

332 篇 英文
7 篇 其他
5 篇 中文

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

共 344 条记录，以下是141-150 订阅

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

详细简洁

排序：

Reasoning with forest logic programs using fully enriched automata 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Feier, Cristina Eiter, thomas Department of Computer Science University of Oxford Oxford United Kingdom Institute of Information Systems Vienna University of Technology Vienna Austria

ISBN: (纸本)9783319232638

Forest logic Programs (FoLP) are a decidable fragment of Open Answer Set programming (OASP) which have the forest model property. OASP extends Answer Set programming (ASP) with open domains—a feature which makes it possible for FoLPs to simulate reasoning with the description logic SHOQ. In the past, several tableau algorithms have been devised to reason with FoLPs, the most recent of which established a NExpTime upper bound for reasoning with the fragment. While known to be ExpTime-hard, the exact complexity characterization of reasoning with FoLPs was still unknown. In this paper we settle this open question by a reduction of reasoning with FoLPs to emptiness checking of fully enriched automata which are known to be ExpTime-complete. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic programming with graded modality 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Zhang, Zhizheng Zhang, Shutao School of Computer Science and Engineering Southeast University Nanjing China

ISBN: (纸本)9783319232638

logic programs with graded modality (LPGMs) combine ideas underlying graded modal logic and answer set programming. logic programming under answer set semantics is extended with a new graded modality M[lb:ub] where lb and ub are natural numbers satisfying lb ≤ ub. the modality is used to precede a literal in rules bodies, and thus allows for the representation of graded introspections: M[lb:ub]F intuitively means: it is known that the number of belief sets where F is true is between lb and ub. We define the semantics of logic programs with graded modality, give an algorithm for computing solutions of LPGMs, and show the effectiveness of the formalism for modeling two problems. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Computer Aided threat Identification

Computer Aided Threat Identification

引用

13th IEEE international conference on Commerce and Enterprise Computing (CEC)

作者： Asnar, Yudistira Li, Tong Massacci, Fabio Paci, Federica Univ Trento DISI Trento Italy Tsinghua Univ Sch Software Beijing Peoples R China

ISBN: (纸本)9780769545356

Recently, there has been an increase of reported security threats hitting organizations. Some of them are originated from the assignments to users of inappropriate permissions on organizational sensitive data. thus it is crucial for organizations to recognize as early as possible the risks deriving by inappropriate access right management and to identify the solutions that they need to prevent such risks. In this paper, we propose a framework to identify threats during the requirements analysis of organizations' IT systems. With respect to other works which have attempted to include security analysis into requirement engineering process (e.g., KAOS, Elahi et al., Asnar et al.), our framework does not rely on the level of expertise of the security analyst to detect threats but allows to automatically identify threats that derive from inappropriate access management. To capture the organization's setting and the system stakeholders' requirements, we adopt SI* [1], a requirement engineering framework founded on the concepts of actors, goals, tasks and resources. this framework extends SI* with a reasoning technique that identifies potential security threats on resources and relevant goals. the reasoning is based on Answer Set programming ( ASP) logic rules that take into account the relationships between resources and the delegation of permission relations between actors. We illustrate this framework using an eHealth scenario.

关键词： Cognition Computers Drugs Hospitals SI Security Silicon access right management answer set programming logic rules computer aided threat identification eHealth scenario health care inference mechanisms knowledge representation languages organisational aspects organization IT systems organizational sensitive data reasoning technique requirement engineering process requirements analysis security analysis security of data systems analysis

来源：评论

学校读者我要写书评

暂无评论

Stable models for temporal theories: —Invited Talk— 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Cabalar, Pedro Department of Computer Science University of Corunna A Coruña Spain

ISBN: (纸本)9783319232638

this work makes an overview on an hybrid formalism that combines the syntax of Linear-time Temporal logic (LTL) with a nonmonotonic selection of models based on Equilibrium logic. the resulting approach, called Temporal Equilibrium logic, extends the concept of a stable model for any arbitrary modal temporal theory, constituting a suitable formal framework for the specification and verification of dynamic scenarios in Answer Set programming (ASP). We will recall the basic definitions of this logic and explain their effects on some simple examples. After that, we will proceed to summarize the advances made so far, both in the fundamental realm and in the construction of reasoning tools. Finally, we will explain some open topics, many of them currently under study, and foresee potential challenges for future research. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Verified Transformations and Hoare logic: Beautiful Proofs for Ugly Assembly Language 12th

Verified Transformations and Hoare Logic: Beautiful Proofs f...

引用

12th international conference on Verified Software (VSTTE) and the 13th international Workshop on Numerical Software Verification (NSV)

作者： Bosamiya, Jay Gibson, Sydney Li, Yao Parno, Bryan Hawblitzel, Chris Carnegie Mellon Univ Pittsburgh PA 15213 USA MIT Cambridge MA USA Univ Penn Philadelphia PA USA Microsoft Res Redmond WA USA

ISBN: (纸本)9783030636173;9783030636180

Hand-optimized assembly language code is often difficult to formally verify. this paper combines Hoare logic with verified code transformations to make it easier to verify such code. this approach greatly simplifies existing proofs of highly optimized OpenSSL-based AES-GCM cryptographic code. Furthermore, applying various verified transformations to the AES-GCM code enables additional platform-specific performance improvements.

关键词： Cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Combining Zonotope Abstraction and Constraint programming for Synthesizing inductive Invariants 12th

Combining Zonotope Abstraction and Constraint Programming fo...

引用

12th international conference on Verified Software (VSTTE) and the 13th international Workshop on Numerical Software Verification (NSV)

作者： Kabi, Bibek Goubault, Eric Mine, Antoine Putot, Sylvie Inst Polytech Paris CNRS Ecole Polytech LIX Palaiseau France Sorbonne Univ CNRS Lab Informat Paris 6 Paris France

ISBN: (纸本)9783030636173;9783030636180

We propose to extend an existing framework combining abstract interpretation and continuous constraint programming for numerical invariant synthesis, by using more expressive underlying abstract domains, such as zonotopes. the original method, which relies on iterative refinement, splitting and tightening a collection of abstract elements until reaching an inductive set, was initially presented in combination with simple underlying abstract elements: boxes and octagons. the novelty of our work is to use zonotopes, a sub-polyhedric domain that shows a good compromise between cost and precision. As zonotopes are not closed under intersection, we had to extend the existing framework, in addition to designing new operations on zonotopes, such as a novel splitting algorithm based on paving zonotopes by sub-zonotopes and parallelotopes. We implemented this method on top of the APRON library, and tested it on programs with non-linear loops that present complex, possibly non-convex, invariants. We present some results demonstrating both the interest of this splitting-based algorithm to synthesize invariants on such programs, and the good compromise presented by its use in combination with zonotopes with respect to its use with both simpler domains such as boxes and octagons, and more expressive domains such as polyhedra.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

13th international conference on Reversible Computation, RC 2021

13th International Conference on Reversible Computation, RC ...

引用

13th international conference on Reversible Computation, RC 2021

ISBN: (纸本)9783030798369

the proceedings contain 17 papers. the special focus in this conference is on Reversible Computation. the topics include: A Tangled Web of 12 Lens Laws;splitting Recursion Schemes into Reversible and Classical Interacting threads;reversibility of Executable Interval Temporal logic Specifications;efficient Construction of Functional Representations for Quantum Algorithms;Finding Optimal Implementations of Non-native CNOT Gates Using SAT;fast Swapping in a Quantum Multiplier Modelled as a Queuing Network;OR-Toffoli and OR-Peres Reversible Gates;variational Quantum Eigensolver and Its Applications;reversible Functional Array programming;Compiling Janus to RSSA;causal-Consistent Debugging of Distributed Erlang Programs;towards a Unified Language Architecture for Reversible Object-Oriented programming;Towards a Truly Concurrent Semantics for Reversible CCS;Forward-Reverse Observational Equivalences in CCSK;explicit Identifiers and Contexts in Reversible Concurrent Calculus.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new computational logic approach to reason with conditionals 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Dietz, Emmanuelle-Anna Hölldobler, Steffen International Center for Computational Logic TU Dresden Dresden01062 Germany

ISBN: (纸本)9783319232638

We present a new approach to evaluate conditionals in human reasoning. this approach is based on the weak completion semantics which has been successfully applied to adequately model various other human reasoning tasks in the past. the main idea is to explicitly consider the case, where the condition of a conditional is unknown with respect to some background knowledge, and to evaluate it with minimal revision followed by abduction. We formally compare our approach to a recent approach by Schulz and demonstrate that our proposal is superior in that it can handle more human reasoning tasks. © Springer international Publishing Switzerland 2015.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Answer set programming via mixed integer programming

Answer set programming via mixed integer programming

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Liu, Guohua Janhunen, Tomi Niemelä, Ilkka Aalto University School of Science Department of Information and Computer Science Finland

ISBN: (纸本)9781577355601

Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with another widely applied paradigm, viz. mixed integer programming. As a theoretical result, we establish translations from non-disjunctive logic programs to linear constraints used in mixed integer programming so that the solutions to the constraints correspond to the answer sets of the programs. these translations create the basis for an extended answer set programming language that includes linear constraints as a primitive and enables more compact encodings of problems. On a practical level, we have implemented a prototype system that computes answer sets using a state-of-the-art mixed integer programming solver. the reported experiments demonstrate the effectiveness of this approach applied to a number of optimization problems and problems with variables ranging over large domains. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

13th international conference on Integration of AI and OR Techniques in Constraint programming, CPAIOR 2016

13th International Conference on Integration of AI and OR Te...

引用

13th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2016

ISBN: (纸本)9783319339535

the proceedings contain 29 papers. the special focus in this conference is on Integration of AI and OR Techniques in Constraint programming. the topics include: On CNF encodings of decision diagrams;time-series constraints: improvements and application in CP and MIP contexts;decomposition based on decision diagrams;logic-based decomposition methods for the travelling purchaser problem;lagrangian decomposition via sub-problem search;non-linear optimization of business models in the electricity market;weighted spanning tree constraint with explanations;application to an energy cost-aware production planning problem for tissue manufacturing;cyclic routing of unmanned aerial vehicles;parallelizing constraint programming with learning;parallel composition of scheduling solvers;rail capacity modelling with constraint programming;scheduling home hospice care with logic-based benders decomposition;a global constraint for mining sequential patterns with GAP constraint;a reservoir balancing constraint with applications to bike-sharing;optimization models for a real-world snow plow routing problem;a stochastic continuous optimization backend for MiniZinc with applications to geometrical placement problems;balancing nursing workload by constraint programming;designing spacecraft command loops using two-dimension vehicle routing;constraint programming approach for spatial packaging problem;detecting semantic groups in MIP Models;revisiting two-sided stability constraints;optimal flood mitigation over flood propagation approximations;a bit-vector solver with word-level propagation;a new solver for the minimum weighted vertex cover problem and optimal upgrading schemes for effective shortest paths in networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共35页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：