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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
70 册 图书
56 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,261 篇 工学
- 1,246 篇 计算机科学与技术...
- 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 篇 农学

主题

388 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
16 篇 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 篇 中文
6 篇 其他

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

共 1554 条记录，以下是521-530 订阅

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

详细简洁

排序：

Two applications of the ASP-Prolog system: Decomposable programs and multi-context systems

引用

15th international conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014

作者： Son, Tran Cao Pontelli, Enrico Le, Tiep Department of Computer Science New Mexico State University United States

ISBN: (纸本)9783319041315

this paper presents two applications of the ASP-Prolog system, one of the earliest modular logic programming frameworks for integrating ASP and traditional Prolog/CLP reasoning. Both applications represent significant challenges to existing ASP technologies and share some common traits-mostly related to the inadequacy of the ground-and-solve approach. the first application stems from several practical experiences in using state-of-the-art Answer Set programming (ASP) solvers to tackle combinatorial problems in different domains (e.g., bioinformatics, distributed constraint problem solving). A recurrent issue is the presence of computationally tractable subproblems that turn out to be challenging, or even practically infeasible, for current ASP technologies. the second application of ASP-Prolog is its use to compute the equilibrium semantics of Multi-Context Systems (MCS). © 2014 Springer international Publishing.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

David Poole's Specificity Revised 14

David Poole's Specificity Revised

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Wirth, Claus-Peter Stolzenburg, Frieder Harz Univ Appl Sci FB AI D-38855 Wernigerode Germany

In the middle of the 1980s, David Poole introduced a semantical, model-theoretic notion of specificity to the artificial-intelligence community. Since then it has found further applications in non-monotonic reasoning, in particular in defeasible reasoning. Poole's notion, however, turns out to be intricate and problematic, which - as we show - can be overcome to some extent by a closer approximation of the intuitive human concept of specificity. Besides the intuitive advantages of our novel specificity ordering over Poole's specificity relation in the classical examples of the literature, we also report some hard mathematical facts: Contrary to what was claimed before, we show that Poole's relation is not transitive. Our new notion of specificity is transitive and also monotonic w.r.t. conjunction.

关键词： specificity defeasible reasoning argumentation

来源：评论

学校读者我要写书评

暂无评论

Decidable reasoning in a Fragment of the Epistemic Situation Calculus 14

Decidable Reasoning in a Fragment of the Epistemic Situation...

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Lakemeyer, Gerhard Levesque, Hector J. Rhein Westfal TH Aachen Dept Comp Sci D-52056 Aachen Germany Univ Toronto Dept Comp Sci Toronto ON M5S 3A6 Canada

the situation calculus is a popular formalism for reasoning about actions and change. Since the language is first-order, reasoning in the situation calculus is undecidable in general. An important question then is how to weaken reasoning in a principled way to guarantee decidability. Existing approaches either drastically limit the representation of the action theory or neglect important aspects such as sensing. In this paper we propose a model of limited belief for the epistemic situation calculus, which allows very expressive knowledge bases and handles both physical and sensing actions. the model builds on an existing approach to limited belief in the static case. We show that the resulting form of limited reasoning is sound with respect to the original epistemic situation calculus and eventually complete for a large class of formulas. Moreover, reasoning is decidable.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness 14

Logic Programs with Ordered Disjunction: First-Order Semanti...

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Asuncion, Vernon Zhang, Yan Zhang, Heng Univ Western Sydney Sch Comp Engn & Math Penrith NSW Australia Qatar Univ Dept Comp Sci & Engn Doha Qatar

logic programs with ordered disjunction (LPODs) (Brewka 2002) generalize normal logic programs by combining alternative and ranked options in the heads of rules. It has been showed that LPODs are useful in a number of areas including game theory, policy languages, planning and argumentations. In this paper, we extend propositional LPODs to the first-order case, where a classical second-order formula is defined to capture the stable model semantics of the underlying first-order LPODs. We then develop a progression semantics that is equivalent to the stable model semantics but naturally represents the reasoning procedure of LPODs. We show that on finite structures, every LPOD can be translated to a first-order sentence, which provides a basis for computing stable models of LPODs. We further study the complexity and expressiveness of LPODs and prove that almost positive LPODs precisely capture first-order normal logic programs, which indicates that ordered disjunction itself and constraints are sufficient to represent negation as failure.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Proposal of SIRMs Model with Linear Transformation of Input Variables 7

A Proposal of SIRMs Model with Linear Transformation of Inpu...

引用

Joint 7th international conference on Soft Computing and Intelligent Systems (SCIS) and 15th international Symposium on Advanced Intelligent Systems (ISIS)

作者： Miyajima, Hirofumi Shigei, Noritaka Miyajima, Hiromi Kagoshima Univ Grad Sch Sci & Engn 1-21-40 Korimoto Kagoshima 8900065 Japan

ISBN: (纸本)9781479959556

the automatic construction of fuzzy system with a large number of input variables involves many difficulties such as large time complexity and getting stuck in a shallow and local minimum. As models to overcome them, the SIRMs (Single Input Rule Modules) and DIRMs (Double Input Rule Modules) models have been proposed. However, they are not always effective. In this paper, we propose a model that consists of two phases: the first is a linear transformation of input to intermediate variables and the second is SIRMs model. It is shown that the proposed model has the same ability as the conventional model and does not need too much parameters. Further, it can be applied to classification problems with many variables easily.

关键词： fuzzy reasoning fuzzy systems learning (artificial intelligence) DIRM models SIRM model automatic construction classification problems double input rule modules fuzzy inference model fuzzy system input variables intermediate variables learning methods linear transformation single input rule modules time complexity Educational institutions Electronic mail Function approximation Fuzzy logic Fuzzy systems Input variables Numerical simulation Fuzzy systems Input variables linear transformations complexity classes electronic mail Learning methods function approximation Educational institutions fuzzy reasoning Fuzzy logic numerical simulation

来源：评论

学校读者我要写书评

暂无评论

Massively Parallel reasoning under the Well-Founded Semantics using X10 26

Massively Parallel Reasoning under the Well-Founded Semantic...

引用

26th IEEE international conference on Tools with artificial intelligence (ICTAI)

作者： Tachmazidis, Ilias Cheng, Long Kotoulas, Spyros Antoniou, Grigoris Ward, Tomas E. Univ Huddersfield Huddersfield HD1 3DH W Yorkshire England Natl Univ Ireland Maynooth Maynooth Kildare Ireland IBM Res Dublin Ireland

ISBN: (纸本)9781479965731

Academia and industry are investigating novel approaches for processing vast amounts of data coming from enterprises, the Web, social media and sensor readings in an area that has come to be known as Big Data. logic programming has traditionally focused on complex knowledge structures/programs. the question arises whether and how it can be applied in the context of Big Data. In this paper, we study how the well-founded semantics can be computed over huge amounts of data using mass parallelization. Specifically, we propose and evaluate a parallel approach based on the X10 programming language. Our experiments demonstrate that our approach has the ability to process up to 1 billion facts within minutes.

关键词： Well-Founded Semantics X10 Big Data Mass Parallelization

来源：评论

学校读者我要写书评

暂无评论

Functional-logic programming for Web Knowledge Representation, Sharing and Querying 19

Functional-Logic Programming for Web Knowledge Representatio...

引用

19th international conference on Knowledge Engineering and Knowledge Management (EKAW)

作者： Nickles, Matthias Natl Univ Ireland Insight Ctr Data Analyt Galway Ireland Natl Univ Ireland Dept Informat Technol Galway Ireland

ISBN: (纸本)9783319137049;9783319137032

We propose a unified approach to semantically rich knowledge representation, querying and exchange for the Web, based on functional-logic programming. JavaScript- and JSON-based so-called information scripts serve as a unified knowledge representation and query format, with logical reasoning being a constraint solving or narrowing task. this way, our framework provides a highly versatile, easy to use and radically different alternative compared to conventional forms of knowledge representation and exchange for the Web.

关键词： Knowledge representation JSON-LD JSON JavaScript Functional-logic programming Relational programming Linked Data Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A Dynamic logic Framework for Abstract Argumentation 14

A Dynamic Logic Framework for Abstract Argumentation

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Doutre, Sylvie Herzig, Andreas Perrussel, Laurent Univ Toulouse IRIT Toulouse France

We provide a logical analysis of abstract argumentation frameworks and their dynamics. Following previous work, we express attack relation and argument status by means of propositional variables and define acceptability criteria by formulas of propositional logic. We here study the dynamics of argumentation frameworks in terms of basic operations on these propositional variables, viz. change of their truth values. We describe these operations in a uniform way within a well-known variant of Propositional Dynamic logic PDL: the Dynamic logic of Propositional Assignments, DL PA. the atomic programs of DL PA are assignments of propositional variables to truth values, and complex programs can be built by means of the connectives of sequential and nondeterministic composition and test. We start by showing that in DL - PA, the construction of extensions can be performed by a DL PA program that is parametrized by the definition of acceptance. We then mainly focus on how the acceptance of one or more arguments can be enforced and show that this can be achieved by changing the truth values of the propositional variables describing the attack relation in a minimal way.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Canonical logic Programs Are Succinctly Incomparable with Propositional Formulas 14

Canonical Logic Programs Are Succinctly Incomparable with Pr...

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Shen, Yuping Zhao, Xishun Sun Yat Sen Univ Dept Philosophy Inst Log & Cognit Guangzhou 510275 Peoples R China

Canonical (logic) programs (CP) refer to the class of normal programs (LP) augmented with connective not not, and are equally expressive as propositional formulas (PF). In this paper we address the question of whether CP and PF are succinctly incomparable. Our main result shows that the PARITY problem only has exponential CP representations, while it can be polynomially represented in PF. In other words, PARITY separates PF from CP. Simply speaking, this means that exponential size blowup is generally inevitable when translating a set of PF formulas into a (logically) equivalent CP program (without introducing new variables). Furthermore, since it has been shown by Lifschitz and Razborov that there is also a problem which separates CP from PF (as-suming P not subset of NCl/poly), it follows that the two formalisms are indeed succinctly incomparable.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Exact Learning of Lightweight Description logic Ontologies 14

Exact Learning of Lightweight Description Logic Ontologies

引用

14th international conference on the Principles of Knowledge Representation and reasoning

作者： Konev, Boris Lutz, Carsten Ozaki, Ana Wolter, Frank Univ Liverpool Liverpool Merseyside England Univ Bremen Bremen Germany

We study learning of description logic TBoxes in Angluin et al.'s framework of exact learning via queries. We admit entailment queries ("is a given subsumption entailed by the target TBox?") and equivalence queries ("is a given TBox equivalent to the target TBox?"), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes formulated in DL-Lite with role inclusions and composite concepts on the right-hand side of concept inclusions can be learned in polynomial time;(2) EL TBoxes with only concept names on the right-hand side of concept inclusions can be learned in polynomial time;and (3) EL TBoxes cannot be learned in polynomial time. It follows that non-polynomial time learnability of EL TBoxes is caused by the interaction between existential restrictions on the right- and left-hand sides of concept inclusions. We also show that neither entailment nor equivalence queries alone are sufficient in cases (1) and (2) above.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：