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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Determining Action Reversibility in STRIPS Using Answer Set programming with Quantifiers 24th

Determining Action Reversibility in STRIPS Using Answer Set...

引用

24th international conference on Practical Aspects of Declarative Languages, PADL 2022

作者： Faber, Wolfgang Morak, Michael Chrpa, Lukáš University of Klagenfurt Klagenfurt Austria Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030944780

In the field of automated planning, an action is called reversible when other actions can be applied in order to revert the effects of this action and return to the original state. In recent years, there has been renewed interest in this topic, which led to novel results in the widely known STRIPS formalism and the PDDL planning language. In this paper, we aim to solve the computational problem of deciding action reversibility in a practical setting, applying recent advances in the field of logic programming. In particular, a quantified extension of Answer Set programming (ASP) named ASP with Quantifiers (ASP(Q)) has been proposed by Amendola, Ricca, and Truszczynski, which allows for stacking logic programs by quantifying over answer sets of the previous layer. this language is well-suited to express encodings for the action reversibility problem, since this problem naturally contains a quantifier alternation. In addition, a prototype solver for ASP(Q) is currently developed. We make use of the ASP(Q) language to offer an encoding for action reversibility, and then report on preliminary benchmark results on how well this encoding performs compared to classical ASP. © 2022, Springer Nature Switzerland AG.

关键词： Answer set programming Automated planning reasoning about action and change

来源：评论

学校读者我要写书评

暂无评论

Practical reasoning About Complex Activities 1

引用

15th international conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Guerrero, Esteban Lindgren, Helena Umea Univ Comp Sci Dept Umea Sweden

ISBN: (数字)9783319599304

ISBN: (纸本)9783319599304;9783319599298

In this paper, we present an argument-based mechanism to generate hypotheses about belief-desire-intentions on dynamic and complex activities of a software agent. We propose to use a composed structure called activity as unit for agent deliberation analysis, maintaining actions, goals and observations of the world always situated into a context. Activity transformation produces changes in the knowledge base activity structure as well in the agent's mental states. For example, in car driving as a changing activity, experienced and novice drivers have a different mental attitudes defining distinct deliberation processes with the same observations of the world. Using a framework for understanding activities in social sciences, we endow a software agent with the ability of deliberate, drawing conclusion about current and past events dealing with activity transformations. An argument-based deliberation is proposed which progressively reason about activity segments in a bottom-up manner. Activities are captured as extended logic programs and hypotheses are built using an answer-set programming approach. We present algorithms and an early-stage implementation of our argument-based deliberation process.

关键词： Practical reasoning Agents Complex activity Argumentation Deliberation Tool

来源：评论

学校读者我要写书评

暂无评论

Learning commonsense knowledge through interactive dialogue 34

Learning commonsense knowledge through interactive dialogue

引用

Technical Communications of the 34th international conference on logic programming, ICLP 2018

作者： Wu, Benjamin Russo, Alessandra Law, Mark Inoue, Katsumi Imperial College London Department of Computing Imperial College LondonSW7 2AZ United Kingdom National Institute of Informatics 2 Chome-1-2 Hitotsubashi Chiyoda Tokyo Japan

ISBN: (纸本)9783959770903

One of the most difficult problems in Artificial Intelligence is related to acquiring commonsense knowledge - to create a collection of facts and information that an ordinary person should know. In this work, we present a system that, from a limited background knowledge, is able to learn to form simple concepts through interactive dialogue with a user. We approach the problem using a syntactic parser, along with a mechanism to check for synonymy, to translate sentences into logical formulas represented in Event Calculus using Answer Set programming (ASP). reasoning and learning tasks are then automatically generated for the translated text, with learning being initiated through question and answering. the system is capable of learning with no contextual knowledge prior to the dialogue. the system has been evaluated on stories inspired by the Facebook's bAbI's question-answering tasks, and through appropriate question and answering is able to respond accurately to these dialogues. © Benjamin Wu, Alessandra Russo, Mark Law, and Katsumi Inoue;licensed under Creative Commons License CC-BY

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

First order linear temporal logic over finite time structures

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Cerrito, Serenella Mayer, Marta Cialdea Praud, Sébastien Université de Paris-Sud L.R.I. France Università di Roma Tre France

ISBN: (纸本)3540664920

In this work, the notion of provability for first order linear temporal logic over finite time structures, FO-LTLfin, is studied. We show that the validity problem for such a logic is not recursively enumerable, hence FO-LTLfin is not recursively axiomatizable. this negative result however does not hold in the case of bounded validity, that is truth in all temporal models where the object domain is possibly infinite, but the underlying sequence of time points does not exceed a given size. A formula is defined to be A-valid if it is true in all tempered models whose underlying time frtime is not greater them κ, where κ is any fixed positive integer. In this work a tableau calculus is defined, that is sound and complete with respect to κ-validity, when given as input the initial formula and the bound κ on the size of the temporal models. the main feature of the system, extending the prepositional calculus defined in [7], is that of explicitly denoting time points and having tableau nodes labelled by either expressions intuitively stating that a formula holds in a given temporal interval or "temporal constraints" i.e. linear inequalities on time points. Branch closure is reduced to unsatisfiability over the integers of the set of temporal constraints in the branch.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Improving the recall of live linked data querying through reasoning 6th

Improving the recall of live linked data querying through re...

引用

6th international conference on Web reasoning and Rule Systems, RR 2012

作者： Umbrich, Jürgen Hogan, Aidan Polleres, Axel Decker, Stefan Digital Enterprise Research Institute National University of Ireland Galway Ireland Siemens AG Österreich Siemensstrasse 90 Vienna1210 Austria

ISBN: (纸本)9783642332029

Linked Data principles allow for processing SPARQL queries on-the-fly by dereferencing URIs. Link-traversal query approaches for Linked Data have the benefit of up-to-date results and decentralised execution, but operate only on explicit data from dereferenced documents, affecting recall. In this paper, we show how inferable knowledge— specifically that found through owl:sameAs and RDFS reasoning—can improve recall in this *** first analyse a corpus featuring 7 million Linked Data sources and 2.1 billion quadruples: we (1) measure expected recall by only considering dereferenceable information, (2) measure the improvement in recall given by considering rdfs:seeAlso links as previous proposals did. We further propose and measure the impact of additionally considering (3) owl:sameAs links, and (4) applying lightweight RDFS reasoning for finding more results, relying on static schema information. We evaluate different configurations for live queries covering different shapes and domains, generated from random walks over our corpus. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

Static analysis of prolog with cut 4th

引用

4th international conference on logic programming and Automated reasoning, LPAR 1993

作者： Filé, Gilberto Rossi, Sabina Dipartimento di Matematica Pura ed Applicata Università di Padova Via Belzoni 7 PadovaI-35131 Italy

ISBN: (纸本)9783540569442

this paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our method consists in trasforming an interpreter for Prolog into an interpreter that computes on abstract values and that performs loop-checks by storing all encountered call patterns into a table. In order to guarantee correctness, this tabled interpreter needs information about the sure success of the corresponding concrete computations. Such information, called control information, is used to control the execution of the cuts by the tabled interpreter: a cut is executed only if the control information guarantees that it is also executed at the concrete level, otherwise, the cut is ignored. Control information can be easily added to any abstract domain. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Computational space efficiency and minimal model generation for guarded formulae 8

引用

8th international conference on logic for programming, Artificial Intelligence and reasoning, LPAR 2001

作者： Georgieva, Lilia Hustadt, Ullrich Schmidt, Renate A. Department of Computer Science University of Manchester ManchesterM13 9PL United Kingdom Department of Computer Science University of Liverpool LiverpoolL69 7ZF United Kingdom

ISBN: (纸本)9783540429579

this paper describes a number of hyperresolution-based decision procedures for a subfragment of the guarded fragment. We first present a polynomial space decision procedure of optimal worst-case space and time complexity for the fragment under consideration. We then consider minimal model generation procedures which construct all and only minimal Herbrand models for guarded formulae. these procedures are based on hyperresolution, (complement) splitting and either model constraint propagation or local minimality tests. All the procedures have concrete application domains and are relevant for multi-modal and description logics that can be embedded into the considered fragment. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Knowledge reasoning Based on the Knowledge Graph of Frequency Equipment for System-level Electromagnetic Spectrum Planning

Knowledge Reasoning Based on The Knowledge Graph of Frequenc...

引用

IEEE international conference on Electronic Information and Communication Technology (ICEICT)

作者： Yuru Zhang Jia Cao Xiangyu Hao Shuai Huang China Academic of Electronics and Information Technology Beijing China

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

How to comprehensively, clearly, and accurately obtain the electromagnetic characteristics and relations of planning objects is an important issue in realizing efficient and flexible electromagnetic spectrum planning. In this paper, we use knowledge Graph, an intelligent technology in Semantic Web research, to construct the knowledge graph ontology of frequency equipment. We use the reasoning structure based on OWL + SWRL + Jess, combined with the OWL API to construct reasoning rules and procedures to complete the knowledge service required for system-level electromagnetic spectrum planning by setting up specific scenarios.

关键词： logic programming Frequency-domain analysis OWL Knowledge graphs Ontologies Cognition Planning

来源：评论

学校读者我要写书评

暂无评论

the equational theory of 〈, 0, 1, +, ×, ↑〉 is decidable, but not finitely axiomatisable

引用

11th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2004

作者： Di Cosmo, Roberto Dufour, thomas PPS Laboratory Université Paris 7 France

ISBN: (纸本)3540252363

In 1969, Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. We know the answer to this question for various subsystems obtained by restricting in different ways the language of arithmetic expressions, yet, up to now we knew nothing of the original system that Tarski considered when he started all this research, namely the theory of integers under sum, product, exponentiation with two constants for zero and one. this paper closes this long standing open problem, by providing an elementary proof, relying on previous work of R. Gurevič, of the fact that Tarski's original system is decidable, yet not finitely aximatisable. We also show some consequences of this result for the theory of isomorphisms of types. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

reasoning about the elementary functions of complex analysis 5th

Reasoning about the elementary functions of complex analysis

引用

5th international conference on Artificial Intelligence and Symbolic Computation, AISC 2000

作者： Corless, Robert M. Davenport, James H. Jeffrey, David J. Litt, Gurjeet Watt, Stephen M. Ontario Research Centre for Computer Algebra University of Western Ontario Canada Dept. Mathematical Sciences University of Bath BathBA2 7AY United Kingdom

ISBN: (纸本)9783540449904

there are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding number" approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. the unsolved problems are probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 63 64 65 66 67 68 69 70 71 72 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：