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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是461-470 订阅

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

详细简洁

排序：

Focused Labeled Proof Systems for Modal logic 1

引用

20th international conference on logic for programming, artificial intelligence and reasoning (LPAR)

作者： Miller, Dale Volpe, Marco Ecole Polytech Inria F-75230 Paris France Ecole Polytech LIX F-75230 Paris France

ISBN: (数字)9783662488997

ISBN: (纸本)9783662488997;9783662488980

Focused proofs are sequent calculus proofs that group inference rules into alternating positive and negative phases. these phases can then be used to define macro-level inference rules Gentzen's original and tiny introduction and structural rules. We show here that the inference rules of labeled proof systems for modal logics can similarly be described as pairs of such phases within the LKF focused proof system for first-order classical logic. We consider the system G3K of Negri for the modal logic K and define a translation from labeled modal formulas into first-order polarized formulas and show a strict correspondence between derivations in the two systems, i.e., each rule application in G3K corresponds to a bipole-a pair of a positive and a negative phases-in LKF. Since geometric axioms (when properly polarized) induce bipoles, this strong correspondence holds for all modal logics whose Kripke frames are characterized by geometric properties. We extend these results to present a focused labeled proof system for this same class of modal logics and show its soundness and completeness. the resulting proof system allows one to define a rich set of normal forms of modal logic proofs.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

international Standard ISO 9001-A Soft Computing View 17th

引用

17th international conference on Enterprise Information Systems (ICEIS)

作者： Neves, Jose Fernandes, Ana Gomes, Guida Neves, Mariana Abelha, Antonio Vicente, Henrique Univ Minho Algoritmi Braga Portugal Univ Evora Escola Ciencias & Tecnol Dept Quim Evora Portugal Deloitte London England Univ Evora Escola Ciencias & Tecnol Ctr Quim Evora Dept Quim Evora Portugal

ISBN: (纸本)9783319291338;9783319291321

In order to add value to ISO 9001, a Quality Management Systems that assess, measure, documents, improves, and certify processes to increase productivity, i.e., that transforms business at any level. On the one hand, this work focuses on the development of a decision support system, which will allow companies to be able to meet the needs of customers by fulfilling requirements that reflect either the effectiveness or the non-effectiveness of an organization. On the other hand, many approaches for knowledge representation and reasoning have been proposed using logic programming (LP), namely in the area of Model theory or Proof theory. In this work it is followed the proof theoretical approach in terms of an extension to the LP language to knowledge representation and reasoning. the computational framework is centered on artificial Neural Networks to evaluate customer's satisfaction and the degree of confidence that one has on such a happening.

关键词： international standard ISO 9001 Knowledge representation and reasoning logic programming artificial neural networks Normalization

来源：评论

学校读者我要写书评

暂无评论

Shift design with answer set programming 1

引用

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

作者： Abseher, Michael Gebser, Martin Musliu, Nysret Schaub, Torsten Woltran, Stefan TU Wien Vienna Austria Aalto University HIIT Espoo Finland University of Potsdam Potsdam Germany INRIA Rennes Rennes France

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Answer Set programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ASPMT(QS): Non-monotonic spatial reasoning with answer set programming modulo theories 13th

引用

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

作者： Walęga, Przemyslaw Andrzej Bhatt, Mehul Schultz, Carl Institute of Philosophy University of Warsaw Warsaw Poland Department of Computer Science University of Bremen Bremen Germany

ISBN: (纸本)9783319232638

the systematic modelling of dynamic spatial systems [9] is a key requirement in a wide range of application areas such as comonsense cognitive robotics, computer-aided architecture design, dynamic geographic information systems. We present ASPMT(QS), a novel approach and fully-implemented prototype for non-monotonic spatial reasoning — a crucial requirement within dynamic spatial systems– based on Answer Set programming Modulo theories (ASPMT). ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Sat Modulo theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms using choice formulas. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real nonlinear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other prominent contemporary spatial reasoning systems. Our results show that ASPMT(QS) is the only existing system that is capable of reasoning about indirect spatial effects (i.e. addressing the ramification problem), and integrating geometric and qualitative spatial information within a non-monotonic spatial reasoning context. © Springer international Publishing Switzerland 2015.

关键词： Cognitive systems

来源：评论

学校读者我要写书评

暂无评论

ASP solving for expanding universes 13th

引用

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

作者： Gebser, Martin Janhunen, Tomi Jost, Holger Kaminski, Roland Schaub, Torsten Aalto University HIIT Espoo Finland INRIA Rennes Rennes France University of Potsdam Potsdam Germany

ISBN: (纸本)9783319232638

Over the last years, Answer Set programming has significantly extended its range of applicability, and moved beyond solving static problems to dynamic ones, even in online environments. However, its nonmonotonic nature as well as its upstream instantiation process impede a seamless integration of new objects into its reasoning process, which is crucial in dynamic domains such as logistics or robotics. We address this problem and introduce a simple approach to successively incorporating new information into ASP systems. Our approach rests upon a translation of logic programs and thus refrains from any dedicated algorithms. We prove its modularity as regards the addition of new information and show its soundness and completeness. We apply our methodology to two domains of the Fifth ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Fine Grained SMT Proofs for the theory of Fixed-Width Bit-Vectors 20th

引用

20th international conference on logic for programming, artificial intelligence and reasoning (LPAR)

作者： Hadarean, Liana Barrett, Clark Reynolds, Andrew Tinelli, Cesare Deters, Morgan Univ Oxford Oxford England NYU New York NY USA Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Univ Iowa Iowa City IA USA

ISBN: (纸本)9783662488997;9783662488980

Many high-level verification tools rely on SMT solvers to efficiently discharge complex verification conditions. Some applications require more than just a yes/no answer from the solver. For satisfiable quantifier-free problems, a satisfying assignment is a natural artifact. In the unsatisfiable case, an externally checkable proof can serve as a certificate of correctness and can be mined to gain additional insight into the problem. We present a method of encoding and checking SMT-generated proofs for the quantifier-free theory of fixed-width bit-vectors. Proof generation and checking for this theory poses several challenges, especially for proofs based on reductions to propositional logic. Such reductions can result in large resolution subproofs in addition to requiring a proof that the reduction itself is correct. We describe a fine-grained proof system formalized in the LFSC framework that addresses some of these challenges with the use of computational side-conditions. We report results using a proof-producing version of the CVC4 SMT solver on unsatisfiable quantifier-free bit-vector benchmarks from the SMT-LIB benchmark library.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

ASP, Amalgamation, and the conceptual blending workflow 13th

引用

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

作者： Eppe, Manfred Maclean, Ewen Confalonieri, Roberto Kutz, Oliver Schorlemmer, Marco Plaza, Enric IIIA-CSIC Barcelona Spain University of Edinburgh Edinburgh United Kingdom Free University of Bozen-Bolzano Bolzano Italy International Computer Science Institute Berkeley United States

ISBN: (纸本)9783319232638

We present a framework for conceptual blending – a concept invention method that is advocated in cognitive science as a fundamental, and uniquely human engine for creative thinking. Herein, we employ the search capabilities of ASP to find commonalities among input concepts as part of the blending process, and we show how our approach fits within a generalised conceptual blending workflow. Specifically, we orchestrate ASP with imperative Python programming, to query external tools for theorem proving and colimit computation. We exemplify our approach with an example of creativity in mathematics. © Springer international Publishing Switzerland 2015.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

Solving disjunctive fuzzy answer set programs 13th

引用

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

作者： Mushthofa, Mushthofa Schockaert, Steven De Cock, Martine Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science Bogor Agricultural University Bogor Indonesia Center for Data Science University of Washington Tacoma Tacoma United States

ISBN: (纸本)9783319232638

Fuzzy Answer Set programming (FASP) is an extension of the popular Answer Set programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method. © Springer international Publishing Switzerland 2015.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Modeling abduction over acyclic first-order logic horn theories in answer set programming: Preliminary experiments 22

Modeling abduction over acyclic first-order logic horn theor...

引用

22nd RCRCA international Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2015, RCRA 2015 - A Workshop of the 14th international conference of the Italian Association for artificial intelligence, AI*IA 2015

作者： Schüller, Peter Computer Engineering Department Faculty of Engineering Marmara University Turkey

We describe encodings in Answer Set programming for abductive reasoning in First Order logic in acyclic Horn theories in the presence of value invention and in the absence of Unique Names Assumption. We perform experiments using the Accel benchmark for abductive plan recognition in natural language processing. Results show, that our encodings cannot compete with state-of-the-art realizations of First Order logic abduction, mainly due to large groundings. We analyze reasons for this bad performance and outline potential future improvements.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Supportedly Stable Answer Sets for logic Programs with Generalized Atoms 1

引用

9th international conference on Web reasoning and Rule Systems (RR)

作者： Alviano, Mario Faber, Wolfgang Univ Calabria I-87036 Arcavacata Di Rende Italy Univ Huddersfield Huddersfield HD1 3DH W Yorkshire England

ISBN: (数字)9783319220024

ISBN: (纸本)9783319220024;9783319220017

Answer Set programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing the notion of atom used in these programs. Among these, there are dl-atoms, aggregate atoms, HEX atoms, generalized quantifiers, and abstract constraints. In this paper we refer to these constructs collectively as generalized atoms. the idea common to all of these constructs is that their satisfaction depends on the truth values of a set of (non-generalized) atoms, rather than the truth value of a single (non-generalized) atom. Motivated by several examples, we argue that for some of the more intricate generalized atoms, the previously suggested semantics provide unintuitive results and provide an alternative semantics, which we call supportedly stable or SFLP answer sets. We show that it is equivalent to the major previously proposed semantics for programs with convex generalized atoms, and that it in general admits more intended models than other semantics in the presence of non-convex generalized atoms. We show that the complexity of supportedly stable answer sets is on the second level of the polynomial hierarchy, similar to previous proposals and to answer sets of disjunctive logic programs.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：