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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

708 篇 会议
39 篇 期刊文献
24 册 图书

馆藏范围

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

日期分布

学科分类号

696 篇 工学
- 693 篇 计算机科学与技术...
- 366 篇 软件工程
- 21 篇 电气工程
- 20 篇 信息与通信工程
- 19 篇 控制科学与工程
- 4 篇 生物工程
- 3 篇 交通运输工程
- 3 篇 生物医学工程（可授...
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
- 2 篇 网络空间安全
148 篇 理学
- 135 篇 数学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 6 篇 物理学
- 4 篇 系统科学
34 篇 管理学
- 25 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 4 篇 工商管理
5 篇 法学
- 5 篇 社会学
4 篇 医学
- 4 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
2 篇 农学
- 2 篇 作物学
2 篇 军事学
1 篇 文学

主题

270 篇 logic programmin...
51 篇 answer set progr...
49 篇 semantics
28 篇 knowledge repres...
25 篇 computer circuit...
24 篇 artificial intel...
19 篇 nonmonotonic rea...
15 篇 formal logic
12 篇 mathematical log...
11 篇 knowledge repres...
10 篇 logics and meani...
9 篇 atoms
9 篇 ontology
8 篇 answer-set progr...
8 篇 stream reasoning
8 篇 semantic web
8 篇 programming tech...
8 篇 constraint progr...
7 篇 model checking
7 篇 software enginee...

机构

19 篇 vienna univ tech...
15 篇 univ potsdam pot...
10 篇 univ kentucky de...
10 篇 vienna univ tech...
8 篇 inria rennes ren...
7 篇 new mexico state...
7 篇 univ a coruna la...
7 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 tech univ wien i...
6 篇 tu wien austria
6 篇 univ minho ctr a...
6 篇 university of po...
6 篇 institut für inf...
6 篇 univ calabria ar...
5 篇 univ manchester ...
5 篇 univ genoa dibri...
5 篇 institut für inf...
5 篇 univ calabria de...
5 篇 univ alberta dep...

作者

41 篇 eiter thomas
40 篇 schaub torsten
26 篇 gebser martin
26 篇 tompits hans
23 篇 ricca francesco
20 篇 woltran stefan
17 篇 leone nicola
16 篇 ianni giovambatt...
16 篇 fink michael
16 篇 cabalar pedro
15 篇 faber wolfgang
15 篇 alviano mario
12 篇 calimeri frances...
11 篇 oetsch johannes
10 篇 kaminski roland
10 篇 redl christoph
10 篇 janhunen tomi
9 篇 krennwallner tho...
9 篇 leite joao
8 篇 eiter t

语言

761 篇 英文
6 篇 中文
4 篇 其他

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

共 771 条记录，以下是681-690 订阅

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

详细简洁

排序：

Inheritance and recognition in uncertain and fuzzy object-oriented models

Inheritance and recognition in uncertain and fuzzy object-or...

引用

conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： T.H. Cao J.M. Rossiter T.P. Martin J.F. Baldwin Artificial Intelligence Group Department of Engineering Mathematics University of Bristol UK

the paper proposes probabilistic default reasoning as a suitable approach to inheritance and recognition in uncertain and fuzzy object-oriented models. Firstly, we introduce an uncertain and fuzzy object-oriented model where a class property (i.e., an attribute or a method) can contain fuzzy sets interpreted as families of probability distributions, and uncertain class membership and property applicability are measured by lower and upper bounds on probability. Each uncertainty applicable property is interpreted as a default probabilistic logic rule, which is defeasible. In order to reduce the computational complexity of general probabilistic default reasoning, we propose to use R. Jeffrey's (1965) rule for a weaker notion of consistency and for local inference, then apply them to uncertain inheritance of properties. Using the same approach but with inverse Jeffrey's rule, uncertain recognition as probabilistic default reasoning is also presented. the approach is illustrated by an example in Fril++, the uncertain and fuzzy object-oriented logic programming language that we have been developing.

关键词： Object oriented modeling Fuzzy sets Fuzzy reasoning Upper bound Computational complexity Artificial intelligence Mathematics Mathematical model Probability distribution Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On garbage and program logic 4th

引用

4th international conference on Foundations of Software Science and Computation Structures, FOSSACS 2001 Held as Part of the Joint European conferences on theory and Practice of Software, ETAPS 2001

作者： Calcagno, Cristiano O’Hearn, Peter W. Queen Mary University of London United Kingdom DISI University of Genova Italy

ISBN: (纸本)3540418644

Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. this eliminates or lessens program errors that arise from attempts to access disposed memory, and generally leads to simpler programs. One might therefore expect that reasoning about programs in garbage collected languages would be much easier than in languages where the programmer has more explicit control over memory. But existing program logics are based on a low level view of storage that is sensitive to the presence or absence of unreachable cells, and Reynolds has pointed out that the Hoare triples derivable in these logics are even incompatible with garbage collection. We present a semantics of program logic assertions based on a view of the heap as finite, but extensible;this is for a logical language with primitives for dereferencing pointer expressions. the essential property of the semantics is that all propositions are invariant under operations of adding or removing garbage cells;in short, they are garbage insensitive. We use the assertion language to formulate notions of partial and total correctness for a small programming language, and provide logical characterizations of two natural notions of observational equivalence between programs. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Investigating the role of fuzzy sets in a spatial modeling framework

Investigating the role of fuzzy sets in a spatial modeling f...

引用

conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： P.A. Graniero V.B. Robinson Department of Earth Sciences University of Windsor Windsor ONT Canada Department of Georgraphy University of Toronto Mississauga ONT Canada

this paper outlines a method of constructing a spatial data collection agent that is capable of adopting a spatial sampling strategy along a transect network in real-time, based on minimal prior knowledge of the measured surface and a concept of spatial heterogeneity. the agent uses fuzzy reasoning to decide upon the appropriate distance to travel along the current transect before making a new measurement. Fuzzy functions for the sets "widely spaced" and "immediate neighbourhood" are constructed "on the fly" based on the deviation of the most recent measurement from the value anticipated from the original crude surface. the two functions are combined to produce a /spl Pi/ curve, and the minimum distance between samples that produces a maximum fuzzy membership, i.e. that balances sample sparseness and sample density, is used to determine the next sample point along the transect. the exact form of the fuzzy functions and their parameterization will be designed using a spatially explicit simulation modeling framework to produce experimental performance measures. It is anticipated that the resulting agent will be sufficiently elegant to be easily incorporated into semi-autonomous field acquisition systems, and ultimately contribute to autonomous acquisition systems.

关键词： Fuzzy sets Clocks Real time systems Data acquisition Boundary conditions logic programming Intelligent networks Geoscience Sampling methods Fuzzy reasoning

来源：评论

学校读者我要写书评

暂无评论

A Kripkean semantics for dynamic logic programming 7th

引用

7th international conference on logic for programming and Automated reasoning

作者： Sefránek, J Comenius Univ Inst Informat Bratislava 81103 Slovakia

ISBN: (纸本)3540412859

the main goal of the paper is to propose a tool for a semantic specification of program updates (in the context of dynamic logic programming paradigm). A notion of Kripke structure K-P associated with a generalized logic program P is introduced. It is shown that some paths in K-P specify stable models of P and vice versa, to each stable model of P corresponds a path in K-P. An operation on Kripke structures is defined: for Kripke structures K-P and K-U associated with P (the original program) and U (the updating program), respectively, a Kripke structure K-Pcircle plusU is constructed. K-Pcircle plusU specifies (in a reasonable sense) a set of updates of P by U. there is a variety of possibilities for a selection of an updated program.

关键词： knowledge representation and reasoning nonmonotonic reasoning knowledge evolution updates dynamic logic programming stable model Kripke structure dynamic Kripke structure

来源：评论

学校读者我要写书评

暂无评论

Experiments in answer sets planning (extended abstract)

引用

Mexican international conference on Artificial Intelligence (MICAI 2000)

作者： Balduccini, M Brignoli, G Lanzarone, GA Magni, F Provetti, A Univ Insubria Ctr Ric Informat Interatt Varese Italy Univ Milan Dipartimento Sci Informaz Milan Italy

ISBN: (纸本)3540673547

the study of formal nonmonotonic reasoning has been motivated to a large degree by the need to solve the frame problem and other problems related to representing actions. New efficient implementations of nonmonotonic reasoning, such as SMODELS and DLV, can be used to solve many computational problems that involve actions, including plan generation. SMODELS and its competitors are essential to implement a new approach to knowledge representation and reasoning: to compute solutions to a problem by computing the stable models (answer sets) of the theory that represents it. Marek and Truszczynski call this paradigm Stable model programming. We are trying to assess the viability of stable logic programming for agent specification and planning in realistic scenarios. To do so, we present an encoding of plan generation within the lines of Lifschitz's Answer set planning and evaluate its performance in the simple scenario of Blocks world. Several optimization techniques stemming from mainstream as well as satisfiability planning are added to our planner, and their impact is discussed.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An automata-theoretic completeness proof for interval temporal logic 27th

An automata-theoretic completeness proof for interval tempor...

引用

27th international Colloquium on Automata, Languages and programming, ICALP 2000

作者： Moszkowski, Ben C. Software Technology Research Lab. SERCentre De Montfort University Hawthorn Building The Gateway LeicesterLE1 9BH United Kingdom

ISBN: (纸本)9783540450221

Interval Temporal logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by representing finite-state automata in ITL and then translating ITL formulas into them. Here we limit ourselves to finite time. the full paper (and another conference paper [15]) extends the approach to infinite time. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

5th international conference on logic programming and nonmonotonic reasoning, LPNMR 1999

引用

5th international conference on logic programming and nonmonotonic reasoning, LPNMR 1999

ISBN: (纸本)3540667490

the proceedings contain 30 papers. the special focus in this conference is on logic programming and nonmonotonic reasoning. the topics include: Fixed parameter complexity in AI and nonmonotonic reasoning;classifying semi-normal default logic on the basis of its expressive power;locally determined logic programs;annotated revision programs;belief, knowledge, revisions, and a semantics of non-monotonic reasoning;an argumentation framework for reasoning about actions and changes;representing transition systems by logic programs;transformations of logic programs related to causality and planning;from causal theories to logic programs;monotone expansion of updates in logical databases;updating extended logic programs through abduction;pushing goal derivation in DLP computations;linear tabulated resolution for well founded semantics;minimal founded semantics for disjunctive logic programming;on the role of negation in choice logic programs;approximating reiter’s default logic;coherent well-founded annotated logic programs;many-valued disjunctive logic programs with probabilistic semantics;extending disjunctive logic programming by T-norms;extending the stable model semantics with more expressive rules;stable model semantics for weight constraint rules;towards first-order nonmonotonic reasoning;comparison of sceptical NAF-free logic programming approaches;characterizations of classes of programs by three-valued operators;using LPNMR for problem specification and code generation;answer set planning;world-modeling vs. world-axiomatizing and extended inheritance techniques to solve real-world problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共78页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：