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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

moviola: Interpreting Dynamic logic Programs via Multi-shot Answer Set programming 14th

moviola: Interpreting Dynamic Logic Programs via Multi-shot ...

引用

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

作者： Sabuncu, Orkunt Leite, Joao TED Univ Ankara Turkey Univ Nova Lisboa NOVA LINCS Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

the causal rejection-based update semantics assign meanings to a Dynamic logic Program (DLP), which is a sequence of logic programs each one updating the preceding ones. Although there are translations of DLPs under these update semantics to logic programs of Answer Set programming (ASP), they have not led to efficient and easy to use implementations. this is mainly because such translations aim offline solving in a sense that the resulting logic program is given to an answer set solver to compute models of the current DLP and for any future updates the whole process has to be repeated from scratch. We aim to remedy this situation by utilizing multi-shot ASP, composed of iterative answer set computations of a changing program without restarting from scratch at every step. To this end, we developed a system called moviola, utilizing the multi-shot answer set solver clingo. Using the system, a user can interactively write a DLP, update it, compute its models according to various semantics on the fly.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

C-ASP: Continuous ASP-Based reasoning over RDF Streams 15th

C-ASP: Continuous ASP-Based Reasoning over RDF Streams

引用

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

作者： Pham, thu-Le Ali, Muhammad Intizar Mileo, Alessandra Natl Univ Ireland Insight Ctr Data Analyt Galway Ireland IDA Bussiness Pk Galway Ireland Dublin City Univ Insight Ctr Data Analyt Dublin 9 Ireland

ISBN: (纸本)9783030205287;9783030205270

the ability to perform complex reasoning over data streams has recently become an important area of research in the Semantic Web community. Most of SPARQL-inspired engines have limitations in capturing sophisticated user requirements and dealing with complex reasoning tasks. To address these challenges, we propose and implement C-ASP, a reasoning system based on the Answer Set programming (ASP) system Clingo and extended to handle continuous reasoning requests over RDF streams. We provide the syntax of the C-ASP language, as well as a set of examples in order to illustrate its expressive power. In addition, we present preliminary experimental results showing C-ASP performances.

关键词： Stream reasoning Answer Set programming Semantic Web RDF

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set programming

Extending the Metabolic Network of <i>Ectocarpus Siliculosus...

引用

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

作者： Collet, Guillaume Eveillard, Damien Gebser, Martin Prigent, Sylvain Schaub, Torsten Siegel, Anne thiele, Sven CNRS UMR IRISA 6074 Campus Beaulieu F-35042 Rennes France Univ Nantes UMR 6241 LINA E-44300 Nantes France Univ Potsdam Inst Informat D-14482 Potsdam Germany INRIA Ctr Rennes Bretagne Atlantique E-35042 Rennes France INRIA CIRIC Santiago Chile

ISBN: (纸本)9783642405648

Metabolic network reconstruction is of great biological relevance because it offers a way to investigate the metabolic behavior of organisms. However, reconstruction remains a difficult task at both the biological and computational level. Building on previous work establishing an ASP-based approach to this problem, we present a report from the field resulting in the discovery of new biological knowledge. In fact, for the first time ever, we automatically reconstructed a metabolic network for a macroalgae. We accomplished this by taking advantage of ASP's combined optimization and enumeration capacities. Both computational tasks build on an improved ASP problem representation, incorporating the concept of reversible reactions. Interestingly, optimization greatly benefits from the usage of unsatisfiable cores available in the ASP solver unclasp. Applied to Ectocarpus siliculosus, only the combination of unclasp and clasp allowed us to obtain a metabolic network able to produce all recoverable metabolites among the experimentally measured ones. Moreover, 70% of the identified reactions are supported by an homologous enzyme in Ectocarpus siliculosus, confirming the quality of the reconstructed network from a biological viewpoint.

关键词： Metabolism

来源：评论

学校读者我要写书评

暂无评论

the Fourth Answer Set programming Competition: Preliminary Report

The Fourth Answer Set Programming Competition: Preliminary R...

引用

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

作者： Alviano, Mario Calimeri, Francesco Charwat, Guenther Dao-Tran, Minh Dodaro, Carmine Ianni, Giovambattista Krennwallner, thomas Kronegger, Martin Oetsch, Johannes Pfandler, Andreas Puehrer, Joerg Redl, Christoph Ricca, Francesco Schneider, Patrik Schwengerer, Martin Spendier, Lara Katharina Wallner, Johannes Peter Xiao, Guohui Univ Calabria Dipartimento Matemat & Informat I-87030 Commenda Di Rende Italy Vienna Technol Univ Inst Informat Syst Vienna Austria Vienna Technol Univ Inst Comp Languages Vienna Austria

ISBN: (纸本)9783642405648

Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. the fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. the Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm;and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Beyond 14th

NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Bey...

引用

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

作者： Lopes, Carlos Knorr, Matthias Leite, Joao Univ Nova Lisboa NOVA LINCS Dept Informat Fac Ciencias & Tecnol P-2829516 Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

We present the latest, substantially improved, version of NoHR, a reasoner designed to answer queries over hybrid theories composed of an OWL ontology in Description logics and a set of non-monotonic rules in logic programming. Whereas the need to combine the distinctive features of these two knowledge representation and reasoning approaches stems from real world applications, their integration is nevertheless theoretically challenging due to their substantial semantical differences. NoHR has been developed as a plug-in for the widely used ontology editor Protege - in fact, the first hybrid reasoner of its kind for Protege, building on a combination of reasoners dedicated to OWL and rules - but it is also available as a library, allowing for its integration within other environments and applications. Compared to previous versions of NoHR, this is the first that supports all polynomial OWL profiles, and even beyond, allowing for its usage with real-world ontologies that do not fit within a single profile. In addition, NoHR has now an enhanced integration with its rule engine, which provides support for a vast number of standard built-in Prolog predicates that considerably extend its usability.

关键词： Query answering logic programming Description logic ontologies

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Answer Set programming over Finite Traces 15th

Towards Dynamic Answer Set Programming over Finite Traces

引用

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

作者： Cabalar, Pedro Dieguez, Martin Schaub, Torsten ENIB Brest France Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany Simon Fraser Univ Burnaby BC Canada Griffith Univ Brisbane Qld Australia

ISBN: (纸本)9783030205287;9783030205270

Our ultimate goal is to conceive an extension of Answer Set programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To address this in a semantically well founded way, we generalize the definition of Dynamic Equilibrium logic to accommodate finite linear time and extend it with a converse operator in order to capture past temporal operators. this results in a general logical framework integrating existing dynamic and temporal logics of Here-and-there over both finite and infinite time. In the context of finite time, we then develop a translation of dynamic formulas into propositional ones that can in turn be translated into logic programs.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Stable models for temporal theories: —Invited Talk— 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Cabalar, Pedro Department of Computer Science University of Corunna A Coruña Spain

ISBN: (纸本)9783319232638

this work makes an overview on an hybrid formalism that combines the syntax of Linear-time Temporal logic (LTL) with a nonmonotonic selection of models based on Equilibrium logic. the resulting approach, called Temporal Equilibrium logic, extends the concept of a stable model for any arbitrary modal temporal theory, constituting a suitable formal framework for the specification and verification of dynamic scenarios in Answer Set programming (ASP). We will recall the basic definitions of this logic and explain their effects on some simple examples. After that, we will proceed to summarize the advances made so far, both in the fundamental realm and in the construction of reasoning tools. Finally, we will explain some open topics, many of them currently under study, and foresee potential challenges for future research. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Justifications for logic programming

Justifications for logic programming

引用

12th international conference on logic programming and nonmonotonic reasoning, lpnmr 2013

作者： Viegas Damásio, Carlos Analyti, Anastasia Antoniou, Grigoris Departamento de Informática Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa 2829-516 Caparica Portugal Institute of Computer Science FORTH-ICS Crete Greece Department of Informatics University of Huddersfield Huddersfield United Kingdom

ISBN: (纸本)9783642405631

Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. the case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. the approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics. © 2013 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards a unified approach to modular ontology development using the aspect-oriented paradigm 7

Towards a unified approach to modular ontology development u...

引用

7th international Workshop on Modular Ontologies, WoMO 2013 - Co-located with the 12th international conference on logic programming and Non-Monotonic reasoning, lpnmr 2013

作者： Schäfermeier, Ralph Paschke, Adrian Freie Universität Berlin Königin-Luise-Str. 24-26 Berlin14195 Germany

In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：