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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,428 篇 会议
69 册 图书
55 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,260 篇 工学
- 1,245 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

387 篇 logic programmin...
141 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
48 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
34 篇 logics and meani...
28 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
21 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
15 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
4 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1552 条记录，以下是271-280 订阅

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

详细简洁

排序：

Extended Stepping theories of Active logic: Paraconsistent Semantics 1

引用

16th Russian conference on artificial intelligence (RCAI)

作者： Vinkov, Michael Fominykh, Igor Bauman Moscow State Tech Univ Moscow Russia Moscow Power Engn Inst Moscow Russia

ISBN: (数字)9783030006174

ISBN: (纸本)9783030006174;9783030006167

Active logic is a conceptual system principles of which are satisfied by reasoning formalisms that allow correlation of their results with specific points in time and that are contradiction-tolerant. Today, tolerance for inconsistencies is theoretically justified in the works of the authors and is attributed to the so-called formalism of stepping theories, integrating the principles of Active logic and logic programming. this paper represents further development and refinement of this concept for stepping theories with two kinds of negation. In this respect, more expressive and complete technique enables satisfaction of the principles of logic programming to the maximum extent as compared to other versions of formalism of stepping theories. the obtained results illustrate that the proposed argumentation semantics of stepping theories with two kinds of negation is paraconsistent in the sense that logical inconsistencies existing in these theories does not lead to their destruction.

关键词： Active logic reasoning situated in time Stepping theories Paraconsistent semantics

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Positive Primitive Formulas 15th

Fuzzy Positive Primitive Formulas

引用

15th international conference on Modeling Decisions for artificial intelligence (MDAI)

作者： Dellunde, Pilar Univ Autonoma Barcelona Barcelona Spain Barcelona Grad Sch Math Barcelona Spain IIIA CSIC Artificial Intelligence Res Inst Barcelona Spain

ISBN: (纸本)9783030002022;9783030002015

Can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards the solution of this open problem, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint satisfaction. We study fuzzy positive-primitive sentences, and we present an algebraic characterization of classes axiomatized by this kind of sentences in terms of homomorphisms and finite direct products. the ultimate goal is to study the expressiveness and reasoning mechanisms of non-classical languages, with respect to constraint satisfaction problems and, in general, in modelling decision scenarios.

关键词： Fuzzy constraint satisfaction Preference modeling Fuzzy logics Model theory

来源：评论

学校读者我要写书评

暂无评论

A O(n log² n) Checker and O(n² log n) Filtering Algorithm for the Energetic reasoning 15th

引用

15th international conference on the Integration of Constraint programming, artificial intelligence, and Operations Research (CPAIOR)

作者： Ouellet, Yanick Quimper, Claude-Guy Univ Laval Quebec City PQ Canada

ISBN: (纸本)9783319930312;9783319930305

Energetic reasoning is a strong filtering technique for the CUMULATIVE constraint. However, the best algorithms process O(n(2)) time intervals to perform the satisfiability check which makes it too costly to use in practice. We present how to apply the energetic reasoning by processing only O(n log n) intervals. We show how to compute the energy in an interval in O(log n) time. this allows us to propose a O (n log(2) n) checker and a filtering algorithm for the energetic reasoning with O (n(2) log n) average time complexity. Experiments show that these two algorithms outperform their state of the art counterparts.

关键词： Signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

Single-Shot Epistemic logic Program Solving 27

Single-Shot Epistemic Logic Program Solving

引用

27th international Joint conference on artificial intelligence (IJCAI)

作者： Bichler, Manuel Morak, Michael Woltran, Stefan TU Wien Vienna Austria

ISBN: (纸本)9780999241127

Epistemic logic Programs (ELPs) are an extension of Answer Set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. the resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into a prototype ELP solving system. this solver exhibits competitive performance on a set of ELP benchmark instances.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling 15th

引用

15th international conference on the Integration of Constraint programming, artificial intelligence, and Operations Research (CPAIOR)

作者： Laborie, Philippe IBM Corp 9 Rue Verdun F-94250 Gentilly France

ISBN: (纸本)9783319930312;9783319930305

We consider a well known resource allocation and scheduling problem for which different approaches like mixed-integer programming (MIP), constraint programming (CP), constraint integer programming (CIP), logic-based Benders decompositions (LBBD) and SAT-modulo theories (SMT) have been proposed and experimentally compared in the last decade. thanks to the recent improvements in CP Optimizer, a commercial CP solver for solving generic scheduling problems, we show that a standalone tiny CP model can out-perform all previous approaches and close all the 335 instances of the benchmark. the article explains which components of the automatic search of CP Optimizer are responsible for this success. We finally propose an extension of the original benchmark with larger and more challenging instances.

关键词： Constraint programming Resource allocation Scheduling CP Optimizer

来源：评论

学校读者我要写书评

暂无评论

Stratified Negation in Limit Datalog Programs 27

Stratified Negation in Limit Datalog Programs

引用

27th international Joint conference on artificial intelligence (IJCAI)

作者： Kaminski, Mark Grau, Bernardo Cuenca Kostylev, Egor, V Motik, Boris Horrocks, Ian Univ Oxford Dept Comp Sci Oxford England

ISBN: (纸本)9780999241127

there has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of limit programs was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules in this language, however, do not allow for negation. In this paper, we study an extension of limit programs with stratified negation-as-failure. We show that the additional expressive power makes reasoning computationally more demanding, and provide tight data complexity bounds. We also identify a fragment with tractable data complexity and sufficient expressivity to capture many relevant tasks.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Synthesis the Structure of the Technological Cutting Process

Synthesis the Structure of the Technological Cutting Process

引用

international conference on CAD Systems in Microelectronics (CADSM)

作者： Khavina I.P. Lymarenko V.V. Podorozhniak A.O. Chernykh O.P. Mezentsev M.V. National Technical University Kharkiv Ukraine

One of the directions of technological processes (TP) improvement of processing by cutting operations is the development of applications for automating the synthesis of TP machining, and the synthesis is carried out in two stages: the first is the structural optimization of TP in the form of TP operations sequence; the second is the parametric optimization of TP, where the search for optimal modes of operations is carried out. A decision of support system for the structural optimization of the TP cutting metal processing that is used for the high-precision products of aviation equipment, which makes a rational choice of the set of TP components in the form of a set of part surfaces, work pieces, equipment, fixtures, tool, lubricating and cooling technological environments are used in the enterprise and possible operations is proposed in the paper. the solution is formed on the basis of the developed heuristic rules for the selection of TP components that take into account technical and technological data on TP components, the requirements of standards, regulatory and industry metalworking documents, accumulated knowledge in the field of the theory of mechanical machining and the experience of process experts. With this approach, the problem has a finite set of solutions, formed as a set of alternative TP. the final decision on the TP structure is formed after determining the optimal modes of operation - cutting speed and feed, according to the specified objective functions. To solve the problem which is formalized in the form of a decision tree, a method of sequential hierarchical synthesis and methods of artificial intelligence, namely, production rules implemented using the logic programming language, are applied. the testing made on the example of TP processing a specific product.

关键词： Optimization Machining Tools Automation programming artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Sampling-Based SAT/ASP Multi-model Optimization as a Framework for Probabilistic Inference 1

引用

28th international conference on Inductive logic programming (ILP)

作者： Nickles, Matthias Natl Univ Ireland Sch Engn & Informat Galway Ireland

ISBN: (数字)9783319999609

ISBN: (纸本)9783319999609;9783319999593

this paper proposes multi-model optimization through SAT witness or answer set sampling, with common probabilistic reasoning tasks as primary use cases (including deduction-style probabilistic inference and hypothesis weight learning). Our approach enhances a state-of-the-art SAT/ASP solving algorithm with Gradient Descent as branching literal decision approach, and optionally a cost backtracking mechanism. Sampling of models using these methods minimizes a task-specific, user-provided multi-model cost function while adhering to given logical background knowledge (either a Boolean formula in CNF or a normal logic program under stable model semantics). Features of the framework include its relative simplicity and high degree of expressiveness, since arbitrary differentiable cost functions and background knowledge can be provided.

关键词： Probabilistic logic programming SAT Answer set programming Projective gradient descent Numerical optimization Relational AI

来源：评论

学校读者我要写书评

暂无评论

Uniform Substitution for Differential Game logic 1

引用

9th international Joint conference on Automated reasoning (IJCAR) Held as Part of the Federated logic conference (FloC)

作者： Platzer, Andre Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (数字)9783319942056

ISBN: (纸本)9783319942056;9783319942049

this paper presents a uniform substitution calculus for differential game logic (dGL). Church's uniform substitutions substitute a term or formula for a function or predicate symbol everywhere. After generalizing them to differential game logic and allowing for the substitution of hybrid games for game symbols, uniform substitutions make it possible to only use axioms instead of axiom schemata, thereby substantially simplifying implementations. Instead of subtle schema variables and soundness-critical side conditions on the occurrence patterns of logical variables to restrict infinitely many axiom schema instances to sound ones, the resulting axiomatization adopts only a finite number of ordinary dGL formulas as axioms, which uniform substitutions instantiate soundly. this paper proves soundness and completeness of uniform substitutions for the monotone modal logic dGL. the resulting axiomatization admits a straightforward modular implementation of dGL in theorem provers.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Towards a Proof theory for Heterogeneous logic Combining Sentences and Diagrams 10th

Towards a Proof Theory for Heterogeneous Logic Combining Sen...

引用

10th international conference on the theory and Application of Diagrams (Diagrams)

作者： Takemura, Ryo Nihon Univ Tokyo Japan

ISBN: (纸本)9783319913766;9783319913759

We attempt to develop a proof theory for heterogeneous logic combining first-order formulas and diagrams. In proof theory, normal proofs and normalization play a central role, which makes it possible to analyze and characterize the structure of proofs in a given system. In light of the difference between linguistic reasoning and diagrammatic reasoning, we apply the traditional proof theory developed in symbolic logic to heterogeneous logic, and we give a characterization of the structure of heterogeneous proofs based on our normalization theorem.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：