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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献

馆藏范围

355 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 190 篇 软件工程
- 19 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
87 篇 理学
- 71 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
37 篇 管理学
- 28 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
4 篇 教育学
- 4 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

86 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 ontology
8 篇 logic gates
8 篇 functional progr...
6 篇 inductive logic ...
6 篇 temporal logic
5 篇 logic design
4 篇 computer archite...
4 篇 logic
4 篇 logic circuits
4 篇 computer program...
4 篇 nonvolatile memo...
3 篇 computer science
3 篇 fuzzy logic

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.
2 篇 eiter t

语言

347 篇 英文
8 篇 其他
4 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 355 条记录，以下是201-210 订阅

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

详细简洁

排序：

An experimental study of search strategies and heuristics in answer set programming

An experimental study of search strategies and heuristics in...

引用

3rd international workshop on Answer Set programming: Advances in Theory and Implementation, ASP 2005, Co-located Event with the 19th international Joint Conference on Artificial Intelligence, IJCAI 2005

作者： Giunchiglia, Enrico Maratea, Marco STAR-Lab. DIST University of Genova viale Francesco Causa 13 16145 Genova Italy

Answer Set programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called "tight", the main search procedures used by ASP and SAT systems are equivalent, i.e., that they explore search trees with the same branching nodes. In this paper, we focus on the experimental evaluation of different search strategies, heuristics and their combinations that have been shown to be effective in the SAT community, in ASP systems. Our results show that, despite the strong link between ASP and SAT, it is not always the case that search strategies, heuristics and/or their combinations that currently dominate in SAT are also bound to dominate in ASP. We provide a detailed experimental evaluation for this phenomenon and we shed light on future development of efficient Answer Set solvers.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A backjumping technique for disjunctive logic programming

A backjumping technique for disjunctive logic programming

引用

作者： Faber, Wolfgang Leone, Nicola Ricca, Francesco Italy

In this work we present a backjumping technique for Disjunctive logic programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been proposed for propositional satisfiability testing, which have been adapted to non-disjunctive Answer Set programming (ASP) recently [1,2]. We focus on backjumping without clause learning. We provide a new theoretical framework for backjumping on Disjunctive logic Programs. We optimize the reason calculus, reducing the information to be stored, while fully preserving the correctness and the efficiency of the jumping technique. We implement the proposed technique in DLV, the state-of-the-art DLP system. We have conducted several experiments on hard random problems in order to assess the impact of backjumping. Our conclusion is that when lookahead is employed, there is basically no advantage when enabling backjumping. However, when lookahead is disabled, we can observe that the number of choices in general decreases by a non-negligible factor. In our (naive) implementation this gain is (often more than) compensated by the additional overhead incurred by the reason calculus. It is unclear whether one can reduce this overhead by a more efficient implementation. We therefore conjecture that, at least on hard unstructured instances, backjumping only has an impact when lookahead is not active and when clause learning is employed in addition.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A preliminary report on integrating of answer set and constraint solving

A preliminary report on integrating of answer set and constr...

引用

作者： Baselice, Sabrina Bonatti, Piero Gelfond, M. Dipartimento di Scienze Fisiche Università Federico II Complesso Universitario di Monte Sant'Angelo Via Cinthia Napoli Italy Texas Tech. University Department of Computer Science Lubbock TX United States

Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. This prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Reducing propositional theories in equilibrium logic to logic programs

Reducing propositional theories in equilibrium logic to logi...

引用

作者： Cabalar, Pedro Pearce, David Valverde, Agustín Dept. of Computation Univ. of Corunna Spain Dept. of Informatics Statistics and Telematics Univ. Rey Juan Carlos Móstoles Madrid Spain Dept. of Applied Mathematics Univ. of Malaga Spain

The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity constraints on this process. We want the transformed program to be equivalent in a strong sense so that theory parts can be transformed independent of the wider context in which they might be embedded. It was only recently established [2] that propositional theories are indeed equivalent (in a strong sense) to logic programs. Here this result is extended with the following contributions. (i) We show how to effectively obtain an equivalent program starting from an arbitrary theory. (ii) We show that in general there is no polynomial transformation if we require the resulting program to share precisely the vocabulary or signature of the initial theory. (iii) Extending previous work we show how polynomial transformations can be achieved if one allows the resulting program to contain new atoms. The program obtained is still in a strong sense equivalent to the original theory, and the answer sets of the theory can be retrieved from it.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

An integrated architecture for surveillance and monitoring in an archaeological site 3

An integrated architecture for surveillance and monitoring i...

引用

3rd ACM international workshop on Video Surveillance and Sensor Networks, VSSN 2005

作者： Ardizzone, Edoardo La Cascia, Marco Lo Re, Giuseppe Ortolani, Marco DINFO - University of Palermo Viale delle Scienze ed. 6 Palermo90128 Italy

ISBN: (纸本)1595932429

This paper describes an on-going work aimed at designing and deploying a system for the surveillance and monitoring of an archaeological site, namely the "Valley of the Temples" in Agrigento, Italy. Given the relevance of the site from an artistical and historical point of view, it is important to protect the monuments from malicious or simply incautious behavior;however, the vastity of the area to be monitored and the vague definition of its boundaries make it unpractical to provide extensive coverage through traditional sensors or similar devices. We describe the design of an architecture for the surveillance of the site and for the monitoring of the visitors' behavior consisting in an integrated framework of networked sensors and cameras. Information will be collected by a minimal set of cameras deployed only at critical spots and coupled with higher-performance wireless sensor nodes. Both sets of devices will be supported by more densely deployed lower-cost wireless sensor so that the system will fulfill the concurrent goals of being minimally intrusive and remaining both responsive and efficient. Sensed data will be processed locally whenever possible and convenient, or otherwise sent to a central intelligent unit that will perform further and more sophisticated analyses using a reasoning system, will infer a higher level representation of the outdoor environment, and finally will be able to fine-tune the action of remote devices. © 2005 ACM.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Secure UML information flow using flow UML

Secure UML information flow using flow UML

引用

作者： Alghathbar, Khaled Wijesekera, Duminda Farkas, Csilla Dept. of Information and Software Engineering and CSIS George Mason University MS 4A4 Fairfax VA 22030 United States Information Security Laboratory Dept. of Computer Science and Engineering University of South Carolina Columbia SC 29208 United States

ISBN: (纸本)9728865252

FlowUML is a logic-based system to validate information flow policies at the requirements specification phase of UML based designs. It uses Horn clauses to specify information flow polices that can be checked against flow information extracted from UML sequence diagrams. FlowUML policies can be written at a coarse grain level of caller-callee relationships or at a finer level involving passed attributes.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Multi-level Method Understanding Using Microprints

Multi-level Method Understanding Using Microprints

引用

IEEE international workshop on Visualizing Software for Understanding and Analysis (VISSOFT)

作者： S. Ducasse M. Lanza R. Robbes LISTIC Université de Savoie France Faculty of Informatics University of Lugano Switzerland

Understanding classes and methods is a key activity in object-oriented programming, since classes represent the primary abstractions from which applications are built, while methods contain the actual program logic. The main problem of this task is to quickly grasp the purpose and inner structure of a class. To achieve this goal, one must be able to overview multiple methods at once. In this paper, we present microprints, pixel-based representations of methods enriched with semantic information. We present three specialized microprints each dealing with a specific aspect we want to understand of methods: (1) state access, (2) control flow, and (3) invocation relationship

关键词： Visualization Informatics Color Object oriented programming logic programming Information analysis Java Printers Switches Delay

来源：评论

学校读者我要写书评

暂无评论

Rule-based topological vulnerability analysis

Rule-based topological vulnerability analysis

引用

3rd international workshop on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2005

作者： Swarup, Vipin Jajodia, Sushil Pamula, Joseph MITRE Corporation 7515 Colshire Drive McLean VA 22102 Center for Secure Information Systems George Mason University Fairfax VA 22030-4444

ISBN: (纸本)354029113X

Attack graphs represent known attack sequences that attackers can use to penetrate computer networks. Recently, many researchers have proposed techniques for automatically generating attack graphs for a given computer network. These techniques either use model checkers to generate attack graphs and suffer from scalability problems, or they are based on an assumption of monotonicity and are unable to represent real-world situations. In this paper, we present a vulnerability analysis technique that is more scalable than model-checker-based solutions and more expressive than monotonicity-based solutions. We represent individual attacks as the transition rules of a rule-based system. We define noninterfering rulesets and present efficient, scalable algorithms for those sets. We then consider arbitrary nonmonotonic rulesets and present a series of optimizations which permit us to perform vulnerability assessment efficiently in most practical cases. We motivate the issues and illustrate our techniques using a substantial example. © Springer-Verlag Berlin Heidelberg 2005.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Modeling and logic control design for production system: a matrix based approach

Modeling and logic control design for production system: a m...

引用

IEEE international Conference on Industrial Informatics (INDIN)

作者： A. Polic A. Hace K. Jezernik Faculty of Electrical Engineering and Computer science University of Maribor Maribor Slovenia

This paper introduces a novel, more systematic approach to the modeling and control design of machine logic control. The machine logic control is considered to be an event-driven system. A matrix representation of Petri nets is used, for modeling the structure of discrete event-driven system. Its dynamics is described by state-transition equations. The control of discrete event system is introduced by drawing a clear distinction between the plant and the controller model. The proposed approach is illustrated by simulation and experimental results for the lab-scale linear drive position initialization procedure.

关键词： logic design Control design Production systems Programmable control Automatic control Actuators Control systems Petri nets Discrete event systems logic programming

来源：评论

学校读者我要写书评

暂无评论

Cobalt: A Language for Writing Provably-Sound Compiler Optimizations

Cobalt: A Language for Writing Provably-Sound Compiler Optim...

引用

Proceedings pf the 3rd international workshop on Compiler Optimization Meets Compiler Verification (COCV 2004)

作者： Lerner, Sorin Millstein, Todd Chambers, Craig Department of Computer Science and Engineering University of Washington Seattle WA United States Computer Science Department University of California Los Angeles Los Angeles CA United States

We overview the current status and future directions of the Cobalt project. Cobalt is a domain-specific language for implementing compiler optimizations as guarded rewrite rules. Cobalt optimizations operate over a C-like intermediate representation including unstructured control flow, pointers to local variables and dynamically allocated memory, and recursive procedures. The design of Cobalt engenders a natural inductive strategy for proving the soundness of optimizations. This strategy is fully automated by requiring an automatic theorem prover to discharge a small set of simple proof obligations for each optimization. We have written a variety of forward and backward intraprocedural dataflow optimizations in Cobalt, including constant propagation and folding, branch folding, full and partial redundancy elimination, full and partial dead assignment elimination, and simple forms of points-to analysis. The implementation of our soundness-checking strategy employs the Simplify automatic theorem prover, and we have used this implementation to automatically prove the above optimizations correct. An execution engine for Cobalt optimizations is implemented as part of the Whirlwind compiler infrastructure. © 2005 Elsevier B.V. All rights reserved.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：