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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

56 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

60 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

57 篇 工学
- 57 篇 计算机科学与技术...
- 52 篇 软件工程
- 2 篇 电气工程
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
4 篇 理学
- 4 篇 数学
4 篇 管理学
- 3 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...

主题

23 篇 logic programmin...
5 篇 answer set progr...
4 篇 semantics
3 篇 answer-set progr...
3 篇 knowledge repres...
2 篇 default negation
2 篇 prolog
1 篇 belief revision
1 篇 compaction
1 篇 linear logic
1 篇 computation theo...
1 篇 dynamic logic of...
1 篇 formal logic
1 篇 deep learning
1 篇 linear logic pro...
1 篇 strong negation
1 篇 problem solving
1 篇 propositional dy...
1 篇 equilibrium logi...
1 篇 abstract argumen...

机构

3 篇 univ potsdam pot...
3 篇 univ calabria di...
2 篇 vienna technol u...
2 篇 natl inst inform...
2 篇 tech univ dresde...
2 篇 univ nova lisboa...
1 篇 new mexico state...
1 篇 univ sci & techn...
1 篇 natl inst inform...
1 篇 univ nantes umr ...
1 篇 transdisciplinar...
1 篇 inria ctr rennes...
1 篇 univ a coruna la...
1 篇 sabanci universi...
1 篇 school of comput...
1 篇 univ teesside mi...
1 篇 griffith univ br...
1 篇 university of a ...
1 篇 arizona state un...
1 篇 guizhou univ dep...

作者

6 篇 schaub torsten
5 篇 gebser martin
5 篇 leite joao
3 篇 sabuncu orkunt
3 篇 baral chitta
3 篇 inoue katsumi
3 篇 cabalar pedro
3 篇 ricca francesco
3 篇 schuller peter
2 篇 goncalves ricard...
2 篇 woltran stefan
2 篇 balduccini marce...
2 篇 ianni giovambatt...
2 篇 redl christoph
2 篇 alviano mario
2 篇 fink michael
2 篇 knorr matthias
2 篇 terracina giorgi...
2 篇 slota martin
2 篇 schwind nicolas

语言

59 篇 英文
1 篇 中文

检索条件"任意字段=12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013"

共 60 条记录，以下是31-40 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Characterization theorems for Revision of logic Programs

Characterization Theorems for Revision of Logic Programs

引用

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

作者： Schwind, Nicolas Inoue, Katsumi Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

ISBN: (纸本)9783642405648

We address the problem of belief revision of logic programs, i.e., how to incorporate to a logic program P a new logic program Q. Based on the structure of SE interpretations, Delgrande et al. [5] adapted the AGM postulates to identify the rational behavior of generalized logic program (GLP) revision operators and introduced some specific operators. In this paper, a constructive characterization of all rational GLP revision operators is given in terms of an ordering among propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational GLP revision operators and makes easier the comprehension of their semantic properties. In particular, we show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Taking advantage of our characterization, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards Answer Set programming with Sorts

Towards Answer Set Programming with Sorts

引用

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

作者： Balai, Evgenii Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79409 USA

ISBN: (纸本)9783642405648

Existing ASP languages lack support for conveniently specifying objects, their sorts and the sorts of the parameters of relations in an application domain. However, such support may allow a programmer to better structure the program, to automatically determine some syntax and semantic errors and to avoid thinking about safety of ASP rules - non-declarative conditions on rules required by existing ASP systems. In this paper, we define the syntax and semantics of a knowledge representation language SPARC which offers explicit constructs to specify objects, relations, and their sorts. the language expands CR-Prolog - an extension of ASP by consistency restoring rules. We introduce an implementation of SPARC based on its translation to DLV with weak constraints. A syntax checking algorithm helps to avoid errors related to misspellings as well as simple type errors. Another type checking algorithm flags program rules which, due to type conflicts, have no ground instantiations.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Program Updating by Incremental and Answer Subsumption Tabling

Program Updating by Incremental and Answer Subsumption Tabli...

引用

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

作者： Saptawijaya, Ari Pereira, Luis Moniz Univ Indonesia Fak Ilmu Komputer Ctr Artificial Intelligence Dept Informat Depok Indonesia

ISBN: (纸本)9783642405648

We propose a novel conceptual approach to program updates implementation that exploits two features of tabling in logic programming (in XSB Prolog): incremental and answer subsumption tabling. Our approach, EVOLP/R, is based on the constructs of Evolving logic Programs (EVOLP), but simplifies it at first by restricting updates to fluents only. Rule updates are nevertheless achieved via the mechanism of rule name fluents, placed in rules' bodies, permitting to turn rules on or off, through assertions or retractions of their corresponding unique name fluents. Incremental tabling of fluents allows to automatically maintain - at engine level - the consistency of program states. Answer subsumption of fluents addresses the frame problem - at engine level - by automatically keeping track of their latest assertion or retraction. the implementation is detailed here to the extent that it may be exported to other logic programming tabling systems.

关键词： logic program updates incremental tabling answer subsumption tabling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Ricochet Robots: A Transverse ASP Benchmark

Ricochet Robots: A Transverse ASP Benchmark

引用

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

作者： Gebser, Martin Jost, Holger Kaminski, Roland Obermeier, Philipp Sabuncu, Orkunt Schaub, Torsten Schneider, Marius Univ Potsdam Potsdam Germany

ISBN: (纸本)9783642405648

A distinguishing feature of Answer Set programming is its versatility. In addition to satisfiability testing, it offers various forms of model enumeration, intersection or unioning, as well as optimization. Moreover, there is an increasing interest in incremental and reactive solving due to their applicability to dynamic domains. However, so far no comparative studies have been conducted, contrasting the respective modeling capacities and their computational impact. To assess the variety of different forms of ASP solving, we propose Alex Randolph's board game Ricochet Robots as a transverse benchmark problem that allows us to compare various approaches in a uniform setting. To begin with, we consider alternative ways of encoding ASP planning problems and discuss the underlying modeling techniques. In turn, we conduct an empirical analysis contrasting traditional solving, optimization, incremental, and reactive approaches. In addition, we study the impact of some boosting techniques in the realm of our case study.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A default inference rule operating internally to the grammar devices 1

A default inference rule operating internally to the grammar...

引用

1st Workshop on Natural Language Processing and Automated reasoning, NLPAR 2013 - Co-located with 12th international conference on logic programming and nonmonotonic reasoning, lpnmr 2013

作者： OnambèlèManga, Christophe UMR SFL CNRS Universitè Paris 8 France

Minimalist Grammars (MG) are viewed as a resource consuming system where syntactic operations are triggered when a positive form of a feature matches with its negative form. But a problem arises when a feature lacks a positive/negative value. For the latter case, we introduce a default inference rule in order to account for the underspecification of the feature in a lexical entry.

关键词： Default logic Feature underspecification Minimalist grammars

来源：评论

学校读者我要写书评

暂无评论

logic programming and nonmonotonic reasoning 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Pedro Cabalar Tran Cao Son

ISBN: (数字)9783642405648

ISBN: (纸本)9783642405631

this volume contains the refereed proceedings of the 12th international conference on logic programming and nonmonotonic reasoning, lpnmr 2013, held in September 2013 in Corunna, Spain. the 34 revised full papers (22 technical papers, 9 application description, and 3 system descriptions) and 19 short papers (11 technical papers, 3 application descriptions, and 5 system descriptions) presented together with 2 invited talks, were carefully reviewed and selected from 91 submissions. Being a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning, and knowledge representation, the conference aims to facilitate interactions between those researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those who work in the area of knowledge representation and nonmonotonic reasoning.

关键词： Artificial Intelligence Discrete Mathematics in Computer Science logics and Meanings of Programs Mathematical logic and Formal Languages Software Engineering programming Techniques

来源：评论

学校读者我要写书评

暂无评论

ARVis: Visualizing Relations between Answer Sets

ARVis: Visualizing Relations between Answer Sets

引用

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

作者： Ambroz, thomas Charwat, Guenther Jusits, Andreas Wallner, Johannes Peter Woltran, Stefan Vienna Univ Technol Inst Informat Syst Vienna Austria

ISBN: (纸本)9783642405648

Answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. the core idea of the system is that the user specifies the concept of a relation by an ASP program itself. this yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study.

关键词： Answer set programming Systems Abduction

来源：评论

学校读者我要写书评

暂无评论

AGM-Style Belief Revision of logic Programs under Answer Set Semantics

AGM-Style Belief Revision of Logic Programs under Answer Set...

引用

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

作者： Delgrande, James Peppas, Pavlos Woltran, Stefan Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Univ Patras Dept Business Adm Patras 26500 Greece Vienna Univ Technol Inst Informationssyst A-1040 Vienna Austria

ISBN: (纸本)9783642405648

In the past few years, several approaches for revision (and update) of logic programs have been studied. None of these however matched the generality and elegance of the original AGM approach to revision in classical logic. One particular obstacle is the underlying nonmonotonicity of the semantics of logic programs. Recently however, specific revision operators based on the monotonic concept of SE-models (which underlies the answer-set semantics of logic programs) have been proposed. Basing revision of logic programs on sets of SE-models has the drawback that arbitrary sets of SE-models may not necessarily be expressed via a logic program. this situation is similar to the emerging topic of revision in fragments of classical logic. In this paper we show how nonetheless classical AGM-style revision can be extended to various classes of logic programs using the concept of SE-models. that is, we rephrase the AGM postulates in terms of logic programs, provide a semantic construction for revision operators, and then in a representation result show that these approaches coincide. this work is interesting because, on the one hand it shows how the AGM approach can be extended to a seemingly nonmonotonic framework, while on the other hand the formal characterization may provide guiding principles for the development of specific revision operators.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：