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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 719 条记录，以下是281-290 订阅

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

详细简洁

排序：

Lookahead in Smodels compared to local consistencies in CSP

Lookahead in Smodels compared to local consistencies in CSP

引用

8th international conference on logic programming and nonmonotonic reasoning

作者： You, JH Liu, GH Yuan, LY Onuczko, C Univ Alberta Dept Comp Sci Edmonton AB Canada

ISBN: (纸本)3540285385

In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. the question arises as what is the pruning power of lookahead, and how such pruning power fares in comparison with the consistency techniques in solving CSPs. In this paper, we study the pruning power of lookahead by relating it to local consistencies under two different encodings from CSPs to answer set programs. this leads to an understanding of how the search space is pruned in an answer set solver with lookahead for solving CSPs. On the other hand, lookahead as a general constraint propagation mechanism provides a uniform algorithm for enforcing a variety of local consistencies. We also study the impact on the search efficiency under these encodings.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Belief Change in nonmonotonic Multi-Context Systems

Belief Change in Nonmonotonic Multi-Context Systems

引用

12th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Wang, Yisong Zhuang, Zhiqiang Wang, Kewen Guizhou Univ Dept Comp Sci Guiyang 550025 Peoples R China Griffith Univ Sch Informat & Communicat Technol Nathan Qld 4111 Australia

ISBN: (纸本)9783642405648

Brewka and Eiter's nonmonotonic multi-context system is an elegant knowledge representation framework to model heterogeneous and nonmonotonic multiple contexts. Belief change is a central problem in knowledge representation and reasoning. In this paper we follow the classical AGM approach to investigate belief change in multi-context systems. Specifically, we formulate semantically the AGM postulates of belief expansion, revision and contraction for multi-context systems. We show that the change operations can be characterized in terms of minimal change by ordering equilibria of multi-context systems. Two distance based revision operators are obtained and related to the classical Satoh and Dalal revision operators (via loop formulas).

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Ishebabi, Harold Mahr, Philipp Bobda, Christophe Gebser, Martin Schaub, Torsten Univ Potsdam Inst Informat D-14482 Potsdam Germany

ISBN: (纸本)9783642042379

Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility Of field-programmable devices to customize architectures for parallel programs, thereby alleviating technological limitations due to memory bandwidth and power Consumption. Given the huge size of the design Space Of Such Systems, it is important to automatically optimize design parameters in order to facilitate wide and disciplined explorations. Being a combinatorial problem. system design can be modeled and solved as Such, but the amount of parameters renders the problem difficult to Solve for large instances. However. its the synthesis problem usually exhibits structure, Answer Set programming (ASP), for which solvers utilizing techniques from the propositional satisfiability domain are available, can be effectively employed. this paper presents a design flow based on ASP that uses the solver clasp as back-end engine. Synthesis experiments demonstrate the effectiveness of the approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

An abstract interpretation approach to termination of logic programs 7th

引用

7th international conference on logic for programming and Automated reasoning

作者： Gori, R Univ Pisa Dipartimento Informat I-56125 Pisa Italy

ISBN: (纸本)3540412859

In this paper we define a semantic foundation for an abstract interpretation approach to universal termination and we develop a new abstract domain useful for termination analysis. Based on this approximation we define a method which is able to detect classes of goals which universally terminate (with a fair selection rule). We also define a method which is able to characterize classes of programs and goals for which depth-first search is fair.

关键词： abstract interpretation logic programming infinite derivations universal termination

来源：评论

学校读者我要写书评

暂无评论

Contextual reasoning: Usually Birds Can Abductively Fly 14th

Contextual Reasoning: Usually Birds Can Abductively Fly

引用

14th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Saldanha, Emmanuelle-Anna Dietz Hoelldobler, Steffen Pereira, Luis Moniz Tech Univ Dresden Int Ctr Computat Log D-01062 Dresden Germany North Caucasus Fed Univ Stavropol Russia Univ Nova Lisboa NOVA Lab Comp Sci & Informat Dept Informat Fac Ciencias & Tecnol P-2829516 Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

We present a new logic programming approach to contextual reasoning, based on the Weak Completion Semantics (WCS), the latter of which has been successfully applied in the past to adequately model various human reasoning tasks. One of the properties of WCS is the open world assumption with respect to undefined atoms. this is a characteristic that is different to other common logic programming semantics, a property that seems suitable when modeling human reasoning. Notwithstanding, we have noticed that the famous Tweety default reasoning example, originally introduced by Reiter, cannot be modeled straightforwardly under WCS. Hence, to address the issue and taking Pereira and Pinto's inspection points as inspiration, we develop a notion of contextual reasoning for which we introduce contextual logic programs. We reconsider the formal properties of WCS with respect to these and verify whether they still hold. Finally, we set forth contextual abduction and show that not only the original Tweety example can be nicely modeled within the new approach, but more sophisticated examples as well, where context plays an important role.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Adjudication of Coreference Annotations via Answer Set Optimization 14th

Adjudication of Coreference Annotations via Answer Set Optim...

引用

14th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Schuller, Peter Marmara Univ Fac Engn Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9783319616605;9783319616599

We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard. Merging is subject to hard constraints (consistency) and optimization criteria (minimal divergence from annotators) and involves an equivalence relation over a large number of elements. We describe two representations of the problem in Answer Set programming and four objective functions suitable for the task. We provide two structurally different real-world benchmark datasets based on the METU-Sabanci Turkish Treebank, and we report our experiences in using the Gringo, Clasp, and Wasp tools for computing optimal adjudication results on these datasets.

关键词： Coreference resolution Adjudication Answer set programming

来源：评论

学校读者我要写书评

暂无评论

Symmetry Breaking for Distributed Multi-Context Systems

引用

11th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Drescher, Christian Eiter, thomas Fink, Michael Krennwallner, thomas Walsh, Toby NICTA Locked Bag 6016 Sydney NSW 1466 Australia Techn Univ Wien Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642208942;9783642208959

Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetric parts of the search space and, thereby, simplify the evaluation process. We propose a distributed algorithm that takes a local stance, i.e., computes independently the partial symmetries of a context and, in order to construct potential symmetries of the whole, combines them with those partial symmetries returned by neighbouring contexts. We prove the correctness of our methods. We instantiate such symmetry detection and symmetry breaking in a multi-context system with contexts that use answer set programs, and demonstrate computational benefit on some recently proposed benchmarks.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Game Semantics for Non-monotonic Intensional logic programming

Game Semantics for Non-monotonic Intensional Logic Programmi...

引用

12th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Galanaki, Chrysida Nomikos, Christos Rondogiannis, Panos Univ Athens Dept Informat & Telecommun GR-10679 Athens Greece Univ Ioannina Dept Comp Sci & Engn GR-45110 Ioannina Greece

ISBN: (纸本)9783642405648

Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [OW92], M. Orgun and W. W. Wadge provided a general framework for capturing the semantics of intensional logic programming languages. One key property involved in the construction of [OW92], is the monotonicity of intensional operators. In this paper we consider intensional logic programming from a game-theoretic perspective. In particular we define a two-person game and we demonstrate that it is equivalent to the semantics of [OW92]. More importantly, we demonstrate that the game is even applicable to intensional languages with non-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logic programming.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Complexity Results for Checking Equivalence of Stratified logic Programs

Complexity Results for Checking Equivalence of Stratified Lo...

引用

20th international Joint conference on Artificial Intelligence

作者： Eiter, thomas Fink, Michael Tompits, Hans Woltran, Stefan Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

Recent research in nonmonotonic logic programming under the answer-set semantics focuses on different notions of program equivalence. However, previous results do not address the important classes of stratified programs and its subclass of acyclic (i.e., recursion-free) programs, although they are recognized as important tools for knowledge representation and reasoning. In this paper, we consider such programs, possibly augmented with constraints. Our results show that in the propositional setting, where reasoning is well-known to be polynomial, deciding strong and uniform equivalence is as hard as for arbitrary normal logic programs (and thus coNP-complete), but is polynomial in some restricted cases. Non-ground programs behave similarly. However, exponential lower bounds already hold for small programs (i.e., with constantly many rules). In particular, uniform equivalence is undecidable even for small Horn programs plus a single negative constraint.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Internet Routing and Non-monotonic reasoning 15th

Internet Routing and Non-monotonic Reasoning

引用

15th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Wang, Anduo Chen, Zhijia Temple Univ Philadelphia PA 19122 USA

ISBN: (纸本)9783030205287;9783030205270

Internet routing is the process of selecting paths across the Internet to connect the communicating hosts, it is unique in that path selection is jointly determined by a network of independently operated networks, known as domains or Autonomous Systems (ASes), that interconnect to form the Internet. In fact, the present routing infrastructure takes such an extreme position that it favors local autonomy-an AS can use arbitrary path preference to override the default shortest path policy, at the expense of potential global oscillation-a collection of AS preferences (policies) can fail to converge on a stable path, a path that is also the most preferred possible for every AS along the path. In this paper, we examine the route oscillation problem with non-monotonic reasoning. We observe that, in the absence of any AS specific policies, Internet routing degenerates into the monotonic computation of shortest path-a preferred (shorter) (super)path always extends another preferred (sub)path;But fully autonomous AS policies are non-monotonic a path favored by one AS can be an extension of a less preferred path of a neighbor, to which an "upgrade" to a better path can cause this AS to downgrade to a less preferred path previously discarded. Based on this insight, we present an Answer Set programming (ASP) formulation that allows for automatic oscillation detection. Our evaluation using the clingo ASP solver is promising: on realistic Internet topology and representative policies, clingo can detect anomalies within 35 s.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：