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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
38 篇 期刊文献
18 册 图书

馆藏范围

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

日期分布

学科分类号

328 篇 工学
- 313 篇 计算机科学与技术...
- 198 篇 软件工程
- 30 篇 电气工程
- 24 篇 控制科学与工程
- 17 篇 信息与通信工程
- 9 篇 机械工程
- 7 篇 电子科学与技术（可...
- 5 篇 安全科学与工程
- 4 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 2 篇 测绘科学与技术
77 篇 理学
- 57 篇 数学
- 13 篇 系统科学
- 10 篇 统计学（可授理学、...
- 7 篇 生物学
- 4 篇 物理学
- 1 篇 地质学
29 篇 管理学
- 21 篇 管理科学与工程(可...
- 11 篇 工商管理
- 8 篇 图书情报与档案管...
5 篇 医学
- 4 篇 基础医学(可授医学...
- 2 篇 临床医学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学
2 篇 文学
- 1 篇 外国语言文学
- 1 篇 新闻传播学
1 篇 哲学
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学

主题

104 篇 logic programmin...
22 篇 fuzzy logic
16 篇 artificial intel...
15 篇 semantics
12 篇 object oriented ...
12 篇 programming
12 篇 mathematical log...
11 篇 software enginee...
11 篇 logic gates
11 篇 linear programmi...
9 篇 computer circuit...
9 篇 programming tech...
9 篇 hardware
9 篇 dynamic programm...
8 篇 programming lang...
8 篇 logics and meani...
8 篇 logic design
7 篇 logic
7 篇 probabilistic lo...
6 篇 access control

机构

4 篇 vienna univ tech...
3 篇 suny stony brook...
2 篇 school of automo...
2 篇 univ nova lisboa...
2 篇 univ calif river...
2 篇 univ bologna dei...
2 篇 school of comput...
2 篇 department of co...
2 篇 information and ...
2 篇 univ cagliari di...
2 篇 ibm tokyo resear...
2 篇 labmag lisbon
2 篇 wroclaw univ tec...
2 篇 calif state poly...
2 篇 univ kentucky de...
2 篇 shenzhen tourism...
2 篇 univ texas dept ...
1 篇 new mexico state...
1 篇 dept. computersc...
1 篇 k.u. leuven depa...

作者

4 篇 pereira lm
3 篇 truszczynski m
3 篇 swift t
3 篇 lifschitz v
3 篇 alferes jj
3 篇 vojtás p
3 篇 marriott kim
2 篇 deschreye d
2 篇 schuerman kees
2 篇 pinna g. michele
2 篇 medina j
2 篇 montali marco
2 篇 bruynooghe mauri...
2 篇 przymusinski tc
2 篇 li liang-liang
2 篇 véron andré
2 篇 bartoletti massi...
2 篇 cui bq
2 篇 sideri m
2 篇 cimoli tiziana

语言

466 篇 英文
4 篇 其他
1 篇 法文
1 篇 俄文

检索条件"任意字段=5th Conference on Logic Programming, 1986"

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

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

详细简洁

排序：

Algebra and Coalgebra in Computer Science - 5th International conference, CALCO 2013, Proceedings

Algebra and Coalgebra in Computer Science - 5th Internationa...

引用

5th International conference on Algebra and Coalgebra in Computer Science, CALCO 2013

ISBN: (纸本)9783642402050

the proceedings contain 29 papers. the topics discussed include: exploiting algebraic laws to improve mechanized axiomatizations;positive fragments of coalgebraic logics;many-valued relation lifting and moss' coalgebraic logic;saturated semantics for coalgebraic logic programming;presenting distributive laws;interaction and observation: categorical semantics of reactive systems trough dialgebras;homomorphisms of coalgebras from predicate liftings;trace semantics via generic observations;full abstraction for fair testing in CCS;a simple case of rationality of escalation;coalgebras with symmetries and modeling quantum systems;from operational chu duality to coalgebraic quantum symmetry;noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference;and simulations and bisimulations for coalgebraic modal logics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Granular Computing and imperfect data in ILP

Granular Computing and imperfect data in ILP

引用

5th Joint conference on Information Sciences (JCIS 2000)

作者： Liu, C Zhong, N Beijing Polytech Univ Sch Comp Sci Beijing 100022 Peoples R China

ISBN: (纸本)0964345692

Inductive logic programming (11,P), as any other machine learning or KDD methods, has to deal with imperfect data when applied to real-world problems. Granular Computing (GrC) is a superset of various theories (such as rough sets, fuzzy sets and interval computation) used to handle incompleteness, uncertainty, vagueness, etc. in information systems. this paper investigates the feasibility of applying GrC (especially the rough set theory) to deal with imperfect data in ILP. We list various kinds of imperfect data in ILP (including noise data, too sparse data, missing data, indiscernible data, and too strict bias). For each kind of imperfect data, we try to point out the resulting problem and the potential solution using GrC (or a particular form of GrC such as the rough set theory). the presentation includes formalisms suggested by the authors or other researchers, as well as some general ideas which may give rise to more concrete results in future research.

关键词： ILP (Inductive logic programming) imperfect data Granular Computing (GrC) rough set theory

来源：评论

学校读者我要写书评

暂无评论

A logic programming Approach to Incorporate Access Control in the Internet of things 5th

A Logic Programming Approach to Incorporate Access Control ...

引用

5th IFIP International Cross-Domain conference on Internet of things, IFIPIoT 2022

作者： Bohé, Ilse Willocx, Michiel Lapon, Jorn Naessens, Vincent DistriNet - KU Leuven Technology Campus Ghent Belgium

ISBN: (纸本)9783031188718

In the present digital world, we depend on information technology more than ever. Our economy, health, well-being and even our lives depend on it. Information security is a basic requirement, with access control playing a key role in limiting potential risks. However, the digital environment is no longer limited to data, access to the IoT space must also be handled properly. logic has shown to be very useful in access control. It has been used to formally explain and verify access control policies. Here, logic is employed as a reasoning service in support of other systems. However, a general access control mechanism for logic programs is not available. this paper presents a structural approach that brings Access Control to logic programming. It allows to constrain access to the knowledge base, supporting the use of impure predicates, preventing unauthorized side effects (i.e. controlling IoT devices) taking place. © 2022, IFIP International Federation for Information Processing.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Towards agent-oriented smart office based on concurrent logic languages 5th

Towards agent-oriented smart office based on concurrent logi...

引用

5th Pacific Rim International conference on Artificial Intelligence (PRICAI 98)

作者： Nishiyama, H Ohwada, H Mizoguchi, F Tokyo Univ Sci Fac Sci & Tech Noda Chiba 2788510 Japan

ISBN: (纸本)354065271X

this paper presents an AI architecture for multiple robots working collaboratively in a future smart office. this architecture integrates the control, communication, planning, and learning necessary to agentify office robots. Such integration is based on our multiagent robot language (MRL), which is an extension of concurrent logic programming languages (CCL). While the behavior of an agent is specified within guarded Horn clause logic, the communication and concurrency controls are amenable to the operational semantics of CCL. Our planning module provides well-balanced coordination between single agent planning and supervisor-level planning, yielding the minimum interaction for multiagent communication and control. Furthermore, inductive learning is incorporated into the planning module and is applied to produce empirical rules for action selection, providing the utility of multiagent problem solving. these features allow a unified view of both low- and high-level computation, which enables intelligent collaboration between robotic agents and provides a powerful framework for distributed AI and agent-oriented programming in the real world.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Making contextual intensional logic nonmonotonic

Making contextual intensional logic nonmonotonic

引用

5th International and Interdisciplinary conference CONTEXT 2005 - Modeling and Using Context

作者： thomason, Richmond H. Philosophy Department University of Michigan Ann Arbor MI 48109-2110 United States

ISBN: (纸本)354026924X

this paper motivates and presents a nonmonotonic version of Contextual Intensional logic, a type-theoretic logic intended as a general formalism for reasoning about context. In developing this logic, it is necessary to think through interactions between nonmonotonic and intensional logic that are interesting in their own right. the paper concludes with an extended example how nonmonotonic lifting rules can be deployed in inter-contextual reasoning. © Springer-Verlag Berlin Heidelberg 2005.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Integer programs and valid inequalities for planning problems 5th

Integer programs and valid inequalities for planning problem...

引用

5th European conference on Planning (ECP 99)

作者： Bockmayr, A Dimopoulos, Y Univ Henri Poincare LORIA F-54506 Vandoeuvre Les Nancy France Univ Cyprus Dept Comp Sci CY-1678 Nicosia Cyprus

ISBN: (纸本)3540678662

Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinatorial search problem. the underlying representation language is basically propositional logic. While this is adequate for many domains, it is not clear if it remains so for problems that involve numerical constraints, or optimization of complex objective functions. Moreover, the propositional representation imposes restrictions on the domain knowledge that can be utilized by these approaches. In order to address these issues, we propose moving to the more expressive language of Integer programming (IP). We show how capacity constraints can be easily encoded into linear 0-1 inequalities and how rich forms of domain knowledge can be compactly represented and computationally exploited by IP solvers. then we introduce a novel heuristic search method based on the linear programming relaxation. Finally, we present the results of our experiments with a classical relaxation-based IP solver and a logic-based 0-1 optimizer.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

FIDES - A financial decision aid that can be trusted 5

FIDES - A financial decision aid that can be trusted

引用

5th International conference on Enterprise Information Systems, ICEIS 2003

作者： Stanojević, Mladen Tomašević, Violeta Vraneš, Sanja Mihailo Pupin Institute Volgina 15 Belgrade11060 Serbia

ISBN: (纸本)9729881618

FIDES is aimed at valuating investment projects in accordance with the well-known UNIDO standard and making recommendations on a preferable investment, based on multicriteria analysis of available investment options. FIDES should provide a framework for analyzing key financial indicators, using the discounted cash-flow technique, and also allows for non-monetary factors to enter the multicriteria assessment process, whilst retaining an explicit and relatively objective and consistent set of evaluation conventions and clear decision criteria. Moreover, since virtually every investment and financing decision, involving allocation of resources under uncertain conditions, is associated with considerable risk, FIDES should integrate the risk management module. the basic principle governing risk management is intuitive and well articulated, taking into account investor's subjective appetite for and aversion to risk, and the decision sensitivity to the uncertainty and/or imprecision of input data. thus, with FIDES, financial analysts and decision-makers will be provided with effective modeling tools in the absence of complete or precise information and the significant presence of human involvement. the decision aid will be implemented using multiple programming paradigms (Internet programming, production rules, fuzzy programming, multicriteria analysis, etc.), using a three-tier architecture as a backbone. Being Web based, the application is especially convenient for large, geographically dispersed corporations.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Backdoors to normality for disjunctive logic programs 5

Backdoors to normality for disjunctive logic programs

引用

5th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International conference on logic programming, ICLP 2012

作者： Fichte, Johannes Klaus Szeider, Stefan Vienna University of Technology Austria

Over the last two decades, propositional satisfiability (Sat) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. the aim of this paper is to investigate theoretically how Sat can be utilized for the efficient solution of problems that are harder than NP or co-NP. In particular, we consider the fundamental reasoning problems in propositional disjunctive answer set programming (Asp), Brave Reasoning and Skeptical Reasoning, which ask whether a given atom is contained in at least one or in all answer sets, respectively. Both problems are located at the second level of the Polynomial Hierarchy and thus assumed to be harder than NP or co-NP. One cannot transform these two reasoning problems into Sat in polynomial time, unless the Polynomial Hierarchy collapses. We show that certain structural aspects of disjunctive logic programs can be utilized to break through this complexity barrier, using new techniques from Parameterized Complexity. In particular, we exhibit transformations from Brave and Skeptical Reasoning to Sat that run in time O(2kn2) where k is a structural parameter of the instance and n the input size. In other words, the reduction is fixed-parameter tractable for parameter k. As the parameter k we take the size of a smallest backdoor with respect to the class of normal (i.e., disjunction-free) programs. Such a backdoor is a set of atoms that when deleted makes the program normal. In consequence, the combinatorial explosion, which is expected when transforming a problem from the second level of the Polynomial Hierarchy to the first level, can now be confined to the parameter k, while the running time of the reduction is polynomial in the input size n, where the order of the polynomial is independent of k. We show that such a transformation is not possible if we consider backdoors with respect to tightness instead of normality. We think that our approach is applicable to many other hard combinatorial

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Knowledge Services Using Rule-Based Formalization for Eligibility Criteria of Clinical Trials 1

引用

5th International conference on Health Information Science (HIS)

作者： Huang, Zhisheng Hu, Qing ten Teije, Annette van Harmelen, Frank Ait-Mokhtar, Salah Vrije Univ Amsterdam Dept Comp Sci Amsterdam Netherlands Xerox Res Ctr Europe Meylan France Wuhan Univ Sci & Technol Coll Comp Sci & Technol Wuhan Peoples R China

ISBN: (数字)9783319483351

ISBN: (纸本)9783319483351;9783319483344

Rule-based formalization of eligibility criteria in clinical trials have distinguished features such as declaration, easy maintenance, reusability, and expressiveness. In this paper, we present several knowledge services which can be provided by the rule-based formalization of eligibility criteria. the rule-based formalization can be generated automatically by using the logic programming Prolog with the support of NLP tools for the semantic annotation and relation extraction with medical ontologies/terminologies such as UMLS and SNOMED CT. We show how those automatically generated rule-based formalization for eligibility criteria can be used for the patient recruitment service in SemanticCT, a semantically-enabled system for clinical trials.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Visualization of Recursive Database-Query Output using a Declarative System: An Illustration through Parts-Assembly Tree Visualization 5

Visualization of Recursive Database-Query Output using a Dec...

引用

IEEE 5th International conference for Convergence in Technology (I2CT)

作者： Rohil, Mukesh Kumar Gupta, Neetika Birla Inst Technol & Sci Dept Comp Sci & Informat Syst Pilani 333031 Rajasthan India

ISBN: (数字)9781538680759

ISBN: (纸本)9781538680759

For visualization of output of database queries, the trial charts like bar graphs, line graphs, scatter plots and pie-charts are inappropriate even for small data set when the results of a query are generated recursively in the form of a graph or tree structure. Most of the recursive queries are used to retrieve hierarchical relationships among the instances of data within the database tables. Certain constraints are better represented by recursive rules. SQL 1999 standards allow the recursive queries using recursive common table expressions. To write these queries, views of relations have to be defined in terms of same table multiple times making procedural solutions less desirable. Datalog is also used for recursive queries. Since execution of most of the recursive queries can be represented by a syntax tree, therefore their output in most of the application scenarios is a tree. there is no support in SQL 1999 and Datalog to visualize output generated by recursive queries. In this research, the authors present visualization of output in two forms: First, an interactive tree view, and second, a complete non-interactive view of the output in the form of a tree. the correct results obtained from the system suggest that if software developers take care of appropriate ordering of the predicates, Prolog (programming in logic) can be a better option over Datalog because Prolog provides many built-in predicates and many of its features make it suitable as a relational language.

关键词： Information Systems Data Visualization Recursive Query Declarative System Prolog programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：