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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Concrete Results on Abstract Rules

Concrete Results on Abstract Rules

引用

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

作者： Kroetzsch, Markus Magka, Despoina Horrocks, Ian Univ Oxford Dept Comp Sci Oxford OX1 2JD England

ISBN: (纸本)9783642405648

there are many different notions of "rule" in the literature. A key feature and main intuition of any such notion is that rules can be "applied" to derive conclusions from certain premises. More formally, a rule is viewed as a function that, when invoked on a set of known facts, can produce new facts. In this paper, we show that this extreme simplification is still sufficient to obtain a number of useful results in concrete cases. We define abstract rules as a certain kind of functions, provide them with a semantics in terms of (abstract) stable models, and explain how concrete normal logic programming rules can be viewed as abstract rules in a variety of ways. We further analyse dependencies between abstract rules to recognise classes of logic programs for which stable models are guaranteed to be unique.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A General Approach to the Verification of Cryptographic Protocols Using Answer Set programming

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Delgrande, James P. Grote, Torsten Hunter, Aaron Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642042379

We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets correspond to traces of protocol runs. Using queries, we can find attacks on a protocol by finding the answer sets for the corresponding logic program. Our encoding is modular, with different modules representing the message passing environment, the protocol Structure and the intruder model. We can easily tailor each module to suit a specific application, while keeping the rest of the encoding constant. As such. our approach is more flexible and elaboration tolerant than related formalizations. the present system is intended as a first step towards the development of a compiler from protocol specifications to executable programs: such a compiler would make verification a completely automated process. this work is also part of a larger project in which we are exploring the advantages of explicit, declarative representations of protocol verification problems.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

How to decide query containment under constraints using a description logic 7th

引用

7th international conference on logic for programming and Automated reasoning

作者： Horrocks, I Sattler, U Tessaris, S Tobies, S Univ Manchester Dept Comp Sci Manchester M13 9PL Lancs England Rhein Westfal TH Aachen LuFg Theoret Comp Sci Aachen Germany

ISBN: (纸本)3540412859

We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability problems. Such problems can then be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic. We use a simple example to support our hypothesis that this procedure will work well with realistic problems.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

On the role of negation in choice logic programs 5th

引用

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

作者： De Vos, M Vermeir, D Free Univ Brussels Dept Comp Sci B-1050 Brussels Belgium

ISBN: (纸本)3540667490

We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally model decision problems where, depending on a context, agents must make a decision, i.e. an exclusive choice out of several alternatives. It is shown that such a choice mechanism is in a sense equivalent with negation as supported in semi-negative ("normal") datalog programs. We also discuss an application where strategic games can be naturally formulated as choice programs: it turns out that the stable models of such programs capture exactly the set of Nash equilibria. We then consider the effect of choice on "negative information" that may be implicitly derived from a program. Based on an intuitive notion of unfounded set for choice programs. ive show that several results from (seminegative) disjunctive programs can be strengthened;characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.

关键词： logic programming choice unfounded sets game-theory

来源：评论

学校读者我要写书评

暂无评论

On the implementation of global abduction

引用

7th international Workshop on Computational logic in Multi-Agent Systems

作者： Christiansen, Henning Roskilde Univ Dept Comp Sci DK-4000 Roskilde Denmark

ISBN: (纸本)9783540696186

Global Abduction (GA) is a recently proposed logical formalism for agent oriented programming which allows an agent to collect information about the world and update this in a nonmonotonic: way when changes in the world are observed. A distinct feature of Global Abduction is that in case the agent needs to give up one plan, it may start a new one, or continue a suspended plan, while its beliefs learned about the world in the failed attempts persist. this paper describes an implementation of GA in the high-level language of Constraint Handling Rules (CHR). It appears to be a first attempt to a full implementation of GA, which also confirms CHR as a powerful meta-programming language for advanced reasoning. the construction gives rise a discussion of important issues of the semantics and pragmatics of Global Abduction, leading to proposals for a specific procedural semantics and architecture that seem well suited for real-time applications.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Symbolic System Synthesis Using Answer Set programming

Symbolic System Synthesis Using Answer Set Programming

引用

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

作者： Andres, Benjamin Gebser, Martin Schaub, Torsten Haubelt, Christian Reimann, Felix Glass, Michael Univ Potsdam Inst Comp Sci Potsdam Germany Univ Rostock Inst Appl Microelect & Comp Rostock Germany Univ Erlangen Nurnberg Chair Hardware Software Co Design Nurnberg Germany

ISBN: (纸本)9783642405648

Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they tend to fail for densely connected computing platforms. this paper proposes an automated system design approach employing Answer Set programming (ASP). ASP provides a stringent semantics, allowing for an efficient representation of routing options. An automotive case-study illustrates that the proposed ASP-based system design approach is competitive for sparsely connected computing platforms, while it outperforms SAT-based approaches for dense Networks-on-Chip by an order of magnitude.

关键词： Systems analysis

来源：评论

学校读者我要写书评

暂无评论

Extending disjunctive logic programming by T-norms 5th

引用

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

作者： Mateis, C Vienna Univ Technol Dept Informat Syst A-1040 Vienna Austria

ISBN: (纸本)3540667490

this paper proposes a new knowledge representation language, called QDLP, which extends DLP to deal with uncertain values. A certainty degree interval (a subinterval of [0, 1]) is assigned to each (quantitative) rule. Triangular norms (T-norms) are employed to define calculi for propagating uncertainty information from the premises to the conclusion of a quantitative rule. Negation is considered and the concept of stable model is extended to QDLP. Different T-norms induce different semantics for one given quantitative program. In this sense, QDLP is parameterized and each choice of a T-norm induces a different QDLP language. Each T-norm is eligible for events with determinate relationships (e.g., independence, exclusiveness) between them. Since there are infinitely many T-norms, it turns out that there is a family of infinitely many QDLP languages. this family is carefully studied and the set of QDLP languages which generalize traditional DLP is precisely singled out. Finally the complexity of the main decisional problems arising in the context of QDLP (i.e., Model Checking, Stable Model Checking, Consistency, and Brave reasoning) is analyzed. It is shown that the complexity of the relevant fragments of QDLP coincides exactly with the complexity of DLP. that is, reasoning with uncertain values is more general and not harder than reasoning with boolean values.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Using criticalities as a heuristic for answer set programming 7

引用

7th international conference on logic programming and nonmonotonic reasoning , LPNMR 2004

作者： Sabuncu, Orkunt Alpaslan, Ferda N. Akman, Varol Department of Computer Engineering Middle East Technical University Ankara06531 Turkey Department of Computer Engineering Bilkent University Ankara06800 Turkey

ISBN: (纸本)9783540207214

Answer Set programming is a new paradigm based on logic programming. the main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. the heuristic used is one of the key factors for the performance of the system. A new heuristic for answer set programming has been developed. this heuristic is inspired by hierarchical planning. the notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. the resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. the experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. © Springer-Verlag Berlin Heidelberg 2004.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Unfounded sets for disjunctive logic programs with arbitrary aggregates

Unfounded sets for disjunctive logic programs with arbitrary...

引用

8th international conference on logic programming and nonmonotonic reasoning

作者： Faber, W Univ Calabria Dept Math I-87030 Arcavacata Di Rende CS Italy

ISBN: (纸本)3540285385

Aggregates in answer set programming (ASP) have recently been studied quite intensively. the main focus of previous work has been on defining suitable semantics for programs with arbitrary, potentially recursive aggregates. By now, these efforts appear to have converged. On another line of research, the relation between unfounded sets and (aggregate-free) answer sets has lately been rediscovered. It turned out that most of the currently available answer set solvers rely on this or closely related results (e.g., loop formulas). In this paper, we unite these lines and give a new definition of unfounded sets for disjunctive logic programs with arbitrary, possibly recursive aggregates. While being syntactically somewhat different, we can show that this definition properly generalizes all main notions of unfounded sets that have previously been defined for fragments of the language. We demonstrate that, as for restricted languages, answer sets can be crisply characterized by unfounded sets: they are precisely the unfounded-free models. this result can be seen as a confirmation of the robustness of the definition of answer sets for arbitrary aggregates. We also provide a comprehensive complexity analysis for unfounded sets, and study its impact on answer set computation.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Bird's-Eye View of Forgetting in Answer-Set programming 14th

A Bird's-Eye View of Forgetting in Answer-Set Programming

引用

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

作者： Leite, Joao Univ Nova Lisboa NOVA LINCS Lisbon Portugal Univ Nova Lisboa Dept Informat Lisbon Portugal

ISBN: (纸本)9783319616605;9783319616599

Forgetting is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant, while preserving all relationships (direct and indirect) between the remaining variables. When investigated in the context of Answer-Set programming, many different approaches to forgetting have been proposed, following different intuitions, and obeying different sets of properties. this talk will present a bird's-eye view of the complex landscape composed of the properties and operators of forgetting defined over the years in the context of Answer-Set programming, zooming in on recent findings triggered by the formulation of the so-called strong persistence, a property based on the strong equivalence between an answer-set program and the result of forgetting modulo the forgotten atoms, which seems to best encode the requirements of the forgetting operation.

关键词： Forgetting Answer-Set programming Variable elimination

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：