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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,428 篇 会议
70 册 图书
56 篇 期刊文献

馆藏范围

1,553 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,261 篇 工学
- 1,246 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

388 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
16 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
6 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1554 条记录，以下是1131-1140 订阅

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

详细简洁

排序：

Set constraints in logic programming 7

引用

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

作者： Marek, Victor W. Remmel, Jeffrey B. Department of Computer Science University of Kentucky LexingtonKY40506 United States Department of Mathematics University of California La JollaCA92093 United States

ISBN: (纸本)9783540207214

We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form 〈X, F〉 where X is a finite set of propositional atoms and F is an arbitrary family of subsets of X. We call such atoms set constaints and show that the concept of stable model can be generalized to programs admitting set constraints both in the bodies and the heads of clauses. Natural tools to investigate the fixpoint semantics for such programs are nondeterministic operators in complete lattices. We prove two fixpoint theorems for such operators. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set programming 9

Complexity of Model Checking and Bounded Predicate Arities f...

引用

9th international conference on Principles of Knowledge Representation and reasoning, KR 2004

作者： Eiter, thomas Faber, Wolfgang Fink, Michael Pfeifer, Gerald Woltran, Stefan Institut für Informationssysteme TU Wien Favoritenstraße 9-11 WienA-1040 Austria SUSE LINUX AG Maxfeldstr. 5 NürnbergD-90409 Germany

ISBN: (纸本)1577351991

Answer Set programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is well-understood, less attention has been paid to the case of non-ground programs, which is much more important from a KR language perspective. Existing Answer Set programming systems employ different representations of models, but the consequences of these representations for answer set computation and reasoning tasks have not been analyzed in detail. In this paper, we present novel complexity results on answer set checking for non-ground programs under two methods for representing answer sets and a variety of syntactic restrictions. In particular, we consider set-based and bitmap-based representations, which are popular in implementations of Answer Set programming systems. Based on these results, we also derive new complexity results for the canonical reasoning tasks over answer sets, under the assumption that predicate arities are bounded by some constant. Our results imply that in such a setting - which appears to be a reasonable assumption in practice - more efficient implementations than those currently available may be feasible. Copyright © 2004, American Association for artificial intelligence (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

6th international Symposium on Practical Aspects of Declarative Languages, PADL 2004

6th International Symposium on Practical Aspects of Declarat...

引用

6th international Symposium on Practical Aspects of Declarative Languages, PADL 2004

ISBN: (纸本)9783540248361

the proceedings contain 17 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: An algebraic theory of polymorphic temporal media;supporting decisions in complex, uncertain domains with declarative languages;a typeful approach to object-oriented programming with multiple inheritance;compositional model-views with generic graphical user interfaces;a type-preserving xml schema-Haskell data binding;improved compilation of prolog to c using moded types and determinism information;pruning in the extended Andorra model;improving the quality of plans in answer set planning;a system for reasoning about answer set programs in prolog;simplifying dynamic programming via tabling;symbolic execution of behavioral requirements;observing functional logic computations;a program generator for customized generic Fortran extensions;implementing cut elimination and a case study of simulating dependent types in Haskell.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Possible worlds semantics for probabilistic logic programs

引用

20th international conference on logic programming, ICLP 2004

作者： Dekhtyar, Alex Dekhtyar, Michael I. Department of Computer Science University of Kentucky United States Department of Computer Science Tver State University Russia

ISBN: (纸本)3540226710

In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic logic Programs (p-programs) of Ng and Subrahmanian. P-programs represent imprecision using probability intervals. Our semantics, based on the possible worlds semantics, considers all point probability distributions that satisfy a given p-program. In the paper, we provide the exact characterization of such models of a p-program. We show that the set of models of a p-program cannot, in general case, be described by single intervals associated with atoms of the program. We provide algorithms for efficient construction of this set of models and study their complexity. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Defeasible deontic control for discrete events based on EVALPSN

引用

4th international conference, RSCTC 2004

作者： Nakamatsu, Kazumi Komaba, Hayato Suzuki, Atsuyuki Lie, Chung-Lun Chung, Sheng-Luen School of S.H.S.E. University of Hyogo Himeji 670-0092 Japan Dept. Information Shizuoka University Hamamatsu 432-8011 Japan Dept. Electric NTUST Taipei 106 Taiwan

ISBN: (纸本)3540221174

We have developed an annotated logic program called an EVALPSN(Extended Vector Annotated logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and applied EVALPSN to automatic safety verification, traffic signal control, robot action control, etc.. Generally, discrete event control can be represented as deontic rules such as it is forbidden for both the cat and mouse to occupy the same room simultaneously, and must deal with contradiction to avoid unexpected system states. We show that such discrete event control can be easily formalized in EVALPSN. In this paper, we introduce the application of EVALPSN to discrete event control with taking a famous example Cat and Mouse.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

15th international conference on Algorithmic Learning theory, ALT 2004

15th International Conference on Algorithmic Learning Theory...

引用

15th international conference on Algorithmic Learning theory, ALT 2004

ISBN: (纸本)9783540233565

the proceedings contain 37 papers. the special focus in this conference is on Inductive Inference, PAC Learning, Boosting and Statistical Supervised Learning. the topics include: Applications of regularized least squares to classification problems;probabilistic inductive logic programming;hidden Markov modelling techniques for haplotype analysis;learning languages from positive data and negative counterexamples;inductive inference of term rewriting systems from positive data;on the data consumption benefits of accepting increased uncertainty;comparison of query learning and gold-style learning in dependence of the hypothesis space;boosting based on divide and merge;more theoretical justification for practical algorithms;complexity of pattern classes and lipschitz property;on kernels, margins, and low-dimensional mappings;estimation of the data region using extreme-value distributions;universal convergence of semimeasures on individual random sequences;a criterion for the existence of predictive complexity for binary games;full information game with gains and losses;prediction with expert advice by following the perturbed leader for general weights;on the convergence speed of MDL predictions for Bernoulli sequences;on the complexity of working set selection;convergence of a generalized gradient selection approach for the decomposition method;Newton diagram and stochastic complexity in mixture of binomial distributions;learnability of relatively quantified generalized formulas;the subsumption lattice and query learning;learning tree languages from positive examples and membership queries and statistical learning in digital wireless communications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Combining Answer Set programming with Description logics for the Semantic Web 9

Combining Answer Set Programming with Description Logics for...

引用

9th international conference on Principles of Knowledge Representation and reasoning, KR 2004

作者： Eiter, thomas Lukasiewicz, thomas Schindlauer, Roman Tompits, Hans Institut für Informationssysteme Technische Universität Wien 184/3 Favoritenstraße 9-11 ViennaA-1040 Austria Dipartimento di Informatica e Sistemistica Università di Roma "La Sapienza" Via Salaria 113 RomeI-00198 Italy

ISBN: (纸本)1577351991

Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of logic programming under the answer set semantics with the description logics S HI F (D) and S HOI N (D), which underly the Web ontology languages OWL Lite and OWL DL, respectively. this combination allows for building rules on top of ontologies but also, to a limited extent, building ontologies on top of rules. We introduce description logic programs (dl-programs), which consist of a description logic knowledge base L and a finite set of description logic rules (dl-rules) P. Such rules are similar to usual rules in logic programs with negation as failure, but may also contain queries to L, possibly default negated, in their bodies. We define Herbrand models for dl-programs, and show that satisfiable positive dl-programs have a unique least Herbrand model. More generally, consistent stratified dl-programs can be associated with a unique minimal Herbrand model that is characterized through iterative least Herbrand models. We then generalize the (unique) minimal Herbrand model semantics for positive and stratified dl-programs to a strong answer set semantics for all dl-programs, which is based on a reduction to the least model semantics of positive dl-programs. We also define a weak answer set semantics based on a reduction to the answer sets of ordinary logic programs. Strong answer sets are weak answer sets, and both properly generalize answer sets of ordinary normal logic programs. We then give fixpoint characterizations for the (unique) minimal Herbrand model semantics of positive and stratified dl-programs, and show how to compute these models by finite fixpoint iterations. Furthermore, we give a precise picture of the complexity of deciding strong and weak answer set existence for a dl-program. Copyright © 2004, American Association for artificial intelligence (***). All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A defeasible logic programming system for the Web

A defeasible logic programming system for the Web

引用

international conference on Tools for artificial intelligence (ICTAI)

作者： G. Antoniou A. Bikakis G. Wagner Computer Science Department University of Crete Greece Department of Technology Management Information Systems Eindhovan University of Technology Netherlands

Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. this work describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. the system (a) is syntactically compatible with RuleML; (b) features strict and defeasible rules and priorities; (c) is based on a translation to logic programming with declarative semantics; and (d) is flexible and adaptable to different intuitions within defeasible reasoning.

关键词： logic programming Ontologies Semantic Web Computer science Technology management Management information systems Microstrip OWL Computational complexity User interfaces

来源：评论

学校读者我要写书评

暂无评论

A program logic for resource verification

引用

17th international conference on theorem Proving in Higher Order logics, TPHOLs 2004

作者： Aspinall, David Beringer, Lennart Hofmann, Martin Loidl, Hans-Wolfgang Momigliano, Alberto Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh EdinburghEH9 3JZ United Kingdom Institut für Informatik Ludwig-Maximilians Universität MünchenD-80538 Germany

ISBN: (纸本)3540230173

We present a program logic for reasoning about resource consumption of programs written in Grail, an abstract fragment of the Java Virtual Machine Language. Serving as the target logic of a certifying compiler, the logic exploits Grail's dual nature of combining a functional interpretation with object-oriented features and a cost model for the JVM. We present the resource-aware operational semantics of Grail, the program logic, and prove soundness and completeness. All of the work described has been formalised in the theorem prover Isabelle/HOL, which provides us with an implementation of the logic as well as confidence in the results. We conclude with examples of using the logic for proving resource bounds on code resulting from compiling high-level functional programs. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A dynamic reasoning architecture for computer network management

A dynamic reasoning architecture for computer network manage...

引用

international conference on Tools for artificial intelligence (ICTAI)

作者： S. Gaglio L. Gatani G. Lo Presti G. Lo Re A. Urso DINFO Università di Palermo Palermo Italy ICAR-C.N.R. Istituto di Calcolo e Reti ad Alte Prestazioni Palermo Italy

this work focuses on improving network management and monitoring by the adoption of artificial intelligence techniques. In order to allow automated reasoning on networking concepts, we defined an accurate ontological model capable of describing as better as possible the networking domain. the thorough representation of the domain knowledge is used by a logical reasoner, which is an expert system capable of performing high-level management tasks.

关键词： Computer architecture Computer network management artificial intelligence Monitoring Internet Scalability Proposals logic programming Calculus Ontologies

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 110 111 112 113 114 115 116 117 118 119 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：