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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,159 篇 会议
58 册 图书
37 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

922 篇 工学
- 870 篇 计算机科学与技术...
- 470 篇 软件工程
- 93 篇 控制科学与工程
- 66 篇 电气工程
- 43 篇 信息与通信工程
- 13 篇 机械工程
- 10 篇 土木工程
- 8 篇 建筑学
- 8 篇 石油与天然气工程
- 7 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 农业工程
242 篇 理学
- 203 篇 数学
- 19 篇 系统科学
- 18 篇 物理学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
97 篇 管理学
- 62 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 37 篇 工商管理
13 篇 教育学
- 12 篇 教育学
11 篇 医学
- 8 篇 基础医学(可授医学...
- 7 篇 临床医学
10 篇 法学
- 6 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 文学
3 篇 哲学

主题

254 篇 logic programmin...
53 篇 artificial intel...
50 篇 fuzzy logic
42 篇 semantics
40 篇 formal logic
40 篇 mathematical log...
32 篇 computer circuit...
31 篇 logics and meani...
26 篇 software enginee...
23 篇 integer programm...
22 篇 temporal logic
21 篇 programming tech...
20 篇 programming lang...
19 篇 programming
19 篇 calculations
19 篇 knowledge repres...
17 篇 computer science
17 篇 logic
17 篇 answer set progr...
14 篇 software enginee...

机构

9 篇 univ bath dept c...
9 篇 vienna univ tech...
5 篇 univ london impe...
5 篇 rhein westfal th...
5 篇 univ london impe...
5 篇 univ texas dept ...
4 篇 tu wien austria
4 篇 simon fraser uni...
4 篇 department of co...
4 篇 guangxi key labo...
4 篇 univ liverpool d...
4 篇 univ potsdam ins...
4 篇 carnegie mellon ...
4 篇 univ glamorgan c...
4 篇 univ potsdam ins...
3 篇 univ potsdam ins...
3 篇 theoretical comp...
3 篇 saitama univ dep...
3 篇 microsoft resear...
3 篇 univ potsdam pot...

作者

12 篇 schaub torsten
12 篇 de vos marina
10 篇 brain martin
9 篇 ricca francesco
8 篇 gebser martin
8 篇 russo alessandra
7 篇 gore rajeev
6 篇 leone nicola
6 篇 andrei voronkov
6 篇 xu yang
6 篇 giesl juergen
5 篇 cliffe owen
5 篇 eiter thomas
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 gupta gopal
5 篇 tompits hans
5 篇 schaub t
4 篇 mileo alessandra
4 篇 chang liang

语言

1,233 篇 英文
13 篇 其他
8 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=7th International Conference on Logic for Programming and Automated Reasoning"

共 1254 条记录，以下是581-590 订阅

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

详细简洁

排序：

Non-oblivious Strategy Improvement

Non-oblivious Strategy Improvement

引用

16th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)

作者： Fearnley, John Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

ISBN: (纸本)9783642175107

We study strategy improvement algorithms for mean-payoff and parity games. We describe a structural property of these games, and we show that these structures can affect the behaviour of strategy improvement. We show how awareness of these structures can be used to accelerate strategy improvement algorithms. We call our algorithms non-oblivious because they remember properties of the game that they have discovered in previous iterations. We show that non-oblivious strategy improvement algorithms perform well on examples that are known to be hard for oblivious strategy improvement. Hence, we argue that previous strategy improvement algorithms fail because they ignore the structural properties of the game that they are solving.

关键词： Structural properties

来源：评论

学校读者我要写书评

暂无评论

Combining Collaborative Filtering and Semantic Content-based Approaches to Recommend Web Services

Combining Collaborative Filtering and Semantic Content-based...

引用

4th Annual IEEE international conference on Semantic Computing (ICSC)

作者： Lecue, Freddy Univ Manchester Booth St East Manchester Lancs England

ISBN: (纸本)9780769541549

As the abundance of web services on the World Wide Web increase, designing effective approaches for web service selection and recommendation has become more and more important. In this paper we focus on an approach dynamically offering services that fit the end-users' interests. To this end, we present a hybrid approach, coupling pure and classic collaborative-filtering methods and a semantic content-based method. On the one hand the former methods are used to automatically recommend services depending on other similar users, based on profiles, preferences and historical experience. On the other hand our semantic content-based approach performs Description logic based reasoning on semantic descriptions of services, in order to analysis semantic similarity of services. this approach further restricts the potential results and then ensuring a semantic recommendation of services. Finally we discuss its advantages and weaknesses.

关键词： Service recommendation Web services World Wide Web automated reasoning collaborative-filtering methods content-based recommendation description logic based reasoning historical experience information filtering preferences experience profiles experience semantic Web semantic content-based method semantic descriptions semantic web service selection web service recommendation web service selection

来源：评论

学校读者我要写书评

暂无评论

Single-Facility Scheduling over Long Time Horizons by logic-Based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-...

引用

7th international conference Integration of AI and OR Techniques in Constraint programming for Combinatorial Optimization Problems

作者： Coban, Elvin Hooker, John N. Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

ISBN: (纸本)9783642135194

logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizons that are divided into segments separated by shutdown times (such as weekends). the objective is to find feasible solutions, minimize makespan, or minimize total tardiness.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Incremental reasoning on Streams and Rich Background Knowledge

Incremental Reasoning on Streams and Rich Background Knowled...

引用

7th Extended Semantic Web conference (ESWC2010)

作者： Barbieri, Davide Francesco Braga, Daniele Ceri, Stefano Della Valle, Emanuele Grossniklaus, Michael Politecn Milan Dipartimento Elettron & Informaz I-20133 Milan Italy

ISBN: (纸本)9783642134852

this article presents a technique for Stream reasoning, consisting in incremental maintenance of materializations of ontological entailments in the presence of streaming information. Previous work, delivered in the context of deductive databases, describes the use of logic programming for the incremental maintenance of such entailments. Our contribution is a new technique that exploits the nature of streaming data in order to efficiently maintain materialized views or RDF triples, which can be used by a reasoner. By adding expiration time information to each RDF triple, we show that;it is possible to compute a new complete and correct materialization whenever a new window of streaming data. arrives, by dropping explicit statements and entailments that are no longer valid, and then computing when the RDF triples inserted within the window will expire. We Provide experimental evidence that our approach significantly reduces the time required to compute a new materialization at each window change, and opens up for several further optimizations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Formal Framework for Compositional Verification of Organic Computing Systems

A Formal Framework for Compositional Verification of Organic...

引用

7th international conference on Autonomic and Trusted Computing

作者： Nafz, Florian Seebach, Hella Steghoefer, Jan-Philipp Baeumler, Simon Reif, Wolfgang Univ Augsburg Dept Software Engn & Programming Languages D-86135 Augsburg Germany

ISBN: (纸本)9783642165757

Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall verification task is applying composition theorem. In this paper we present a technique for formal specification and compositional verification of Organic Computing systems. Separation of self-x and functional behavior has amongst others, advantages for the formal specification. We present how the specification of self-x behavior can be integrated into an approach for compositional verification of concurrent systems, based on Interval Temporal logic. the presented approach has full tool support with the KIV interactive theorem prover.

关键词： Organic Computing Formal Methods Compositional reasoning

来源：评论

学校读者我要写书评

暂无评论

Linguistic fuzzy logic enhancement of a trust mechanism for distributed networks

Linguistic fuzzy logic enhancement of a trust mechanism for ...

引用

10th IEEE international conference on Computer and Information Technology, CIT-2010, 7th IEEE international conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Mármol, Félix Gómez Marín-Blázquez, Javier G. Pérez, Gregorio Martínez Departamento de Ingeniería de La Información y Las Comunicaciones Facultad de Informática University of Murcia Campus de Espinardo s/n 30.071 Murcia Spain

ISBN: (纸本)9780769541082

Trust is, in some cases, being considered as a requirement in highly distributed communication scenarios. Before accessing a particular service, a trust model is then being used in these scenarios to determine if the service provider can be trusted or not. It is done usually on behalf of the final user or service customer, and with little intervention of him/her. this is usually happening with the main aim of automatizing the process, but also because trust models are normally making use of reasoning mechanisms and models difficult to understand by humans. In this paper we propose the adaptation of a bio-inspired trust model to deal with linguistic fuzzy labels, which are closer to the human way of thinking. this Linguistic Fuzzy Trust Model also uses fuzzy reasoning. Results show that the new model keeps the accuracy of the underlying bio-inspired trust model and the level of client satisfaction, while enhancing the interpretability of the model. © 2010 IEEE.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and threshold Formulae

A Quasipolynomial Cut-Elimination Procedure in Deep Inferenc...

引用

16th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)

作者： Bruscoli, Paola Guglielmi, Alessio Gundersen, Tom Parigot, Michel Univ Bath Bath BA2 7AY Avon England Univ Paris CNRS Lab PPS Paris France

ISBN: (纸本)9783642175107

Jerabek showed in 2008 that cuts in propositional-logic deep-inference proofs can be eliminated in quasipolynomial time. the proof is an indirect one relying on a result of Atserias, Galesi and Pudlak about monotone sequent calculus and a correspondence between this system and cut-free deep-inference proofs. In this paper we give a direct proof of Jerabek's result: we give a quasipolynomial-time cut-elimination procedure in propositional-logic deep inference. the main new ingredient is the use of a computational trace of deep-inference proofs called atomic flows, which are both very simple (they trace only structural rules and forget logical rules) and strong enough to faithfully represent the cut-elimination procedure.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Global Caching for Coalgebraic Description logics

Global Caching for Coalgebraic Description Logics

引用

5th international Joint conference on automated reasoning

作者： Gore, Rajeev Kupke, Clemens Pattinson, Dirk Schroeder, Lutz Australian Natl Univ Comp Sci Lab Canberra ACT 0200 Australia Imperial Coll London Dept Comp London SW7 2AZ England Univ Bremen DFKI Bremen Bremen Germany Univ Bremen Dept Comp Sci D-28359 Bremen Germany

ISBN: (纸本)9783642142024

Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal complexity EXPTIME. the algorithm uses the (known) tableau rules for the underlying modal logics, and is based on on global caching, which raises hopes of practically feasible implementation. Instantiation of this result to concrete logics yields new algorithms in all cases including standard relational hybrid logic.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Declarative Agent Languages and Technologies VII - 7th international Workshop, DALT 2009, Revised Selected and Invited Papers

Declarative Agent Languages and Technologies VII - 7th Inter...

引用

7th international Workshop on Declarative Agent Languages and Technologies, DALT 2009

ISBN: (纸本)3642113540

the proceedings contain 15 papers. the topics discussed include: the refinement of choreographed multi-agent systems;goal generation from possibilistic beliefs based on trust and distrust;monitoring directed obligations with flexible deadlines: a rule-based approach;unifying the intentional and institutional semantics of speech acts;tableaux for acceptance logic;ontology and time evolution of obligations and prohibitions using semantic web technology;prioritized goals and subgoals in a logical account of goal change - a preliminary report;declarative and numerical analysis of edge creation process in trust-based social networks;computing utility from weighted description logic preference formulas;explaining and predicting the behavior of BDI-based agents in role-playing games;correctness properties for multiagent systems;and reasoning and planning with cooperative actions for multiagents using answer set programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Synthesis-Based Loose programming

Synthesis-Based Loose Programming

引用

7th international conference on the Quality of Information and Communications Technology (QUATIC)

作者： Lamprecht, Anna-Lena Naujokat, Stefan Margaria, Tiziana Steffen, Bernhard Tech Univ Dortmund Chair Programming Syst D-44227 Dortmund Germany Univ Potsdam Chair Serv & Software Engn D-14882 Potsdam Germany

ISBN: (纸本)9780769542416

In this paper we present loose programming, an approach designed to enable process developers to design their application-specific processes in an intuitive style. Key to this approach is the concept of loose specification, a graphical formalism that allows developers to express their processes just by sketching them as kinds of flow graphs without caring about types, precise knowledge about the available process components or the availability of resources. they only have to specify the rough process flow graphically in terms of ontologically defined 'semantic' entities. these loose specifications are then concretized to fully executable process code automatically by means of a combination of 1) data-flow analysis, ensuring the availability of the required resources, 2) temporal logic-based process synthesis, resolving type conflicts and taking care of correct component instantiation, and 3) model checking, to ensure global intents and invariants expressed in temporal logic.

关键词： application-specific processes data flow analysis data flow analysis data-flow analysis flow graphs graphical formalism intuitive style loose specification loose specification model checking process developers software engineering synthesis synthesis based loose programming temporal logic-based process synthesis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：