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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

358 篇 会议
7 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

257 篇 工学
- 238 篇 计算机科学与技术...
- 134 篇 软件工程
- 24 篇 控制科学与工程
- 15 篇 电气工程
- 11 篇 信息与通信工程
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 3 篇 石油与天然气工程
- 3 篇 农业工程
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
- 2 篇 生物医学工程（可授...
53 篇 理学
- 49 篇 数学
- 4 篇 生物学
- 4 篇 系统科学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
22 篇 管理学
- 14 篇 管理科学与工程(可...
- 10 篇 图书情报与档案管...
- 6 篇 工商管理
6 篇 医学
- 5 篇 基础医学(可授医学...
- 4 篇 临床医学
- 2 篇 公共卫生与预防医...
4 篇 教育学
- 4 篇 教育学
- 1 篇 心理学(可授教育学...
4 篇 农学
- 4 篇 作物学
2 篇 文学
- 1 篇 中国语言文学
1 篇 哲学
- 1 篇 哲学
1 篇 法学
- 1 篇 社会学

主题

75 篇 logic programmin...
19 篇 fuzzy logic
18 篇 programming
18 篇 logic gates
14 篇 inductive logic ...
11 篇 logic
9 篇 computer science
8 篇 integer programm...
8 篇 semantics
7 篇 computer circuit...
7 篇 linear programmi...
7 篇 answer set progr...
7 篇 artificial intel...
7 篇 dynamic programm...
6 篇 languages
6 篇 computer archite...
6 篇 probabilistic lo...
5 篇 optimization
5 篇 wireless sensor ...
5 篇 abstracts

机构

3 篇 univ potsdam pot...
3 篇 univ calabria di...
2 篇 brandeis univ wa...
2 篇 simon fraser uni...
2 篇 katholieke univ ...
2 篇 univ copenhagen ...
2 篇 katholieke univ ...
2 篇 ku leuven depart...
2 篇 department infor...
2 篇 vienna technol u...
2 篇 univ castilla la...
2 篇 carnegie mellon ...
2 篇 univ aarhus daim...
2 篇 at&t bell lab mu...
2 篇 natl univ irelan...
2 篇 natl inst inform...
2 篇 univ castilla la...
2 篇 univ nova lisboa...
2 篇 australian natl ...
2 篇 department of el...

作者

5 篇 gebser martin
5 篇 schaub torsten
4 篇 inoue katsumi
3 篇 nickles matthias
3 篇 fink michael
3 篇 schuller peter
2 篇 mileo alessandra
2 篇 mairson harry g.
2 篇 goncalves ricard...
2 篇 kung-kiu lau
2 篇 soria jose
2 篇 de raedt luc
2 篇 boustia narhimen...
2 篇 j.r. romero
2 篇 a. vallecillo
2 篇 woltran stefan
2 篇 lifschitz vladim...
2 篇 ferilli stefano
2 篇 sighireanu mihae...
2 篇 p. flener

语言

363 篇 英文
3 篇 其他
1 篇 西班牙文
1 篇 中文

检索条件"任意字段=12th International Conference on Inductive Logic Programming"

共 368 条记录，以下是281-290 订阅

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

详细简洁

排序：

Deciding separation logic formulae by SAT and incremental negative cycle elimination

Deciding separation logic formulae by SAT and incremental ne...

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Wang, C Ivancic, F Ganai, M Gupta, A NEC Labs Amer Princeton NJ 08540 USA

ISBN: (纸本)354030553X

Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) integer-valued state variables, such as pipelined processor designs and timed systems, In this paper, we present a fast decision procedure for separation logic, which combines Boolean satisfiability (SAT) with a graph based incremental negative cycle elimination algorithm. Our solver abstracts a separation logic formula into a Boolean formula by replacing each predicate with a Boolean variable. Transitivity constraints over predicates are detected from the constraint graph and added on a need-to basis. Our solver handles Boolean and theory conflicts uniformly at the Boolean level. the graph based algorithm supports not only incremental theory propagation, but also constant time theory backtracking without using a cumbersome history stack. Experimental results on a large set of benchmarks show that our new decision procedure is scalable, and outperforms existing techniques for this logic.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Automating coherent logic

Automating coherent logic

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Bezem, M Coquand, T Univ Bergen Dept Comp Sci N-5020 Bergen Norway Chalmers Univ Technol SE-41296 Gothenburg Sweden Univ Gothenburg SE-41296 Gothenburg Sweden

ISBN: (纸本)354030553X

First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory, lattice theory and projective geometry) can be formulated directly in CL without any clausification or Skolemization. CL has a natural proof theory, reasoning is constructive and proof objects can easily be obtained. We prove completeness of the proof theory and give a linear translation from FOL to CL that preserves logical equivalence. these properties make CL well-suited for providing automated reasoning support to logical frameworks. the proof theory has been implemented in Prolog, generating proof objects that can be verified directly in the proof assistant Coq. the prototype has been tested on the proof of Hessenberg's theorem, which could be automated to a considerable extent. Finally, we compare the prototype to some automated theorem provers on selected problems.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Termination of fair computations in term rewriting

Termination of fair computations in term rewriting

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Lucas, S Meseguer, J Univ Politecn Valencia DSIC E-46071 Valencia Spain Univ Illinois CS Dept Urbana IL 61801 USA

ISBN: (纸本)354030553X

the main goal of this paper is to apply rewriting termination technology-enjoying a quite mature set of termination results and tools-to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a reductionistic theoretical approach to systematically transform, under reasonable assumptions, fair-termination problems into ordinary termination problems of associated relations, to which standard rewriting termination techniques and tools can be applied. Our theoretical results are combined into a practical proof methodology for proving fair-termination that can be automated and can be supported by current termination tools. We illustrate this methodology with some concrete examples and briefly comment on future extensions.

关键词： concurrent programming fairness term rewriting program analysis termination

来源：评论

学校读者我要写书评

暂无评论

Optimizing the runtime processing of types in polymorphic logic programming languages

Optimizing the runtime processing of types in polymorphic lo...

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Nadathur, G Qi, XC Univ Minnesota Digital Technol Ctr Minneapolis MN 55455 USA Univ Minnesota Dept CSE Minneapolis MN 55455 USA

ISBN: (纸本)354030553X

the traditional purpose of types in programming languages of providing correctness assurances at compile time is increasingly being supplemented by a direct role for them in the computational process. In the context of typed logic programming, this is manifest in their effect on the unification operation. their influence takes two different forms. First, in a situation where polymorphism is permitted, type information is needed to determine if different occurrences of the same name in fact denote an identical constant. Second, type information may determine the form of bindings for variables. When types are needed for the second purpose as in the case of higher-order unification, these have to be available with every variable and constant. However, in situations such as first-order and higher-order pattern unification, types have no impact on the variable binding process. As a consequence, type examination is needed in these situations only for the first of the two purposes described and even here a careful preprocessing can considerably reduce their run-time footprint. We develop a scheme for treating types in these contexts that exploits this observation. Under this scheme, type information is elided in most cases and is embedded into term structure when this is not entirely possible. Our approach obviates types when properties known as definitional genericity and type preservation are satisfied and has the advantage of working even when these conditions are violated.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Sheremet, M Tishkovsky, D Afolter, R Zakharyaschev, M Kings Coll London Dept Comp Sci London WC2R 2LS England Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England

ISBN: (纸本)354030553X

the notion of comparative similarity 'X is more similar or closer to Y than to Z' has been investigated in both foundational and applied areas of knowledge representation and reasoning, e.g., in concept formation, similarity- based reasoning and areas of bioinformatics such as protein sequence alignment. In this paper we analyse the computational behaviour of the 'propositional' logic with the binary operator 'closer to a set tau(1) than to a set tau(2)' and nominals interpreted over various classes of distance (or similarity) spaces. In particular, using a reduction to the emptiness problem for certain tree automata, we show that the satisfiability problem for this logic is ExpTime- complete for the classes of all finite symmetric and all finite (possibly non-symmetric) distance spaces. For finite subspaces of the real line (and higher dimensional Euclidean spaces) we prove the undecidability of satisfiability by a reduction of the solvability problem for Diophantine equations. As our closer' operator has the same expressive power as the standard operator > of conditional logic, these results may have interesting implications for conditional logic as well.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Reasoning about incompletely defined programs

Reasoning about incompletely defined programs

引用

12th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Walther, C Schweitzer, S Tech Univ Darmstadt Fachgebiet Programmiermethodik Darmstadt Germany

ISBN: (纸本)354030553X

We consider automated reasoning about recursive partial functions with decidable domain, i.e. functions computed by incompletely defined but terminating functional programs. Incomplete definitions provide an elegant and easy way to write and to reason about programs which may halt with a run time error by throwing an exception or printing an error message, e.g. when attempting to divide by zero. We investigate the semantics of incompletely defined programs, define an interpreter for those programs and discuss the termination of incompletely defined procedures. We then analyze which problems need to be solved if a theorem prover designed for verification of completely defined programs is modified to work for incompletely defined programs as well. We also discuss how to reason about stuck computations which arise when calling incompletely defined procedures with invalid arguments. Our method of automated reasoning about incompletely defined programs has been implemented in the verification tool VeriFun. We conclude by discussing experiences obtained in several case studies with this implementation and also compare and relate our proposal to other work.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Applying robot-in-the-loop-simulation to mobile robot systems

Applying robot-in-the-loop-simulation to mobile robot system...

引用

international conference on Advanced Robotics (ICAR)

作者： Xiaolin Hu Computer Science Department Georgia State University Atlanta GA USA

Simulation-based study plays important roles in robotic systems development. this paper describes robot-in-the-loop simulation, which is a novel simulation method that we developed to allow real robots and robot models to work together for system-wide measurement and test. To support robot-in-the-loop simulation, a simulated virtual environment is developed. Several kinds of sensor/actuator interface models are defined to allow real robots to interact with the virtual environment. To demonstrate the capability of robot-in-the-loop simulation, three mobile robot examples were developed and are presented in the paper in an incremental way. these examples illustrate the usages and configurations of robot-in-the-loop simulation under different situations

关键词： Mobile robots Computational modeling Robot sensing systems Virtual environment System testing Computer simulation Actuators programming logic Decision making

来源：评论

学校读者我要写书评

暂无评论

Automatic induction of first-order logic descriptors type domains from observations

Automatic induction of first-order logic descriptors type do...

引用

14th international conference ILP 2004: inductive logic programming

作者： Ferilli, Stefano Esposito, Floriana Basile, Teresa M. A. Mauro, Nicola Di Department of Computer Science University of Bari Italy

the types of learning systems used in the description language and its related domains are investigated. these learning systems are able to exploit meta-information to improve their performance. An algorithm, which automatically identifies types from types is proposed. the performance of the algorithm in domains with different characteristics, and its robustness with respect to incomplete observations are studied.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

From aspectual requirements to proof obligations for aspect-oriented systems

From aspectual requirements to proof obligations for aspect-...

引用

IEEE international conference on Requirements Engineering

作者： S. Katz A. Rashid Computer Science Department Technion-Israel Institute of Technology Haifa Israel Computing Department Lancaster University Lancaster UK

Aspect-oriented software development (AOSD) techniques support systematic modularization and composition of crosscutting concerns. though AOSD techniques have been proposed to handle crosscutting concerns at various stages during the software life cycle, there is a traceability gap between the aspects at the requirements level and those at later development stages. It is not clear what proof obligations about an aspect-oriented implementation follow from the initial aspectual requirements. this work presents PROBE, a framework for generation of proof obligations for aspect-oriented systems from the initial aspectual requirements and associated trade-offs. the abstract proof obligations are expressed in standard linear temporal logic. Key components of the framework include an extended ontology with parametric temporal formulas and functions, and extensive treatment of conflicts among requirements. the resultant temporal logic assertions, grouped into specifications of aspect implementations, can then be instantiated in terms of the implementation and verification tools.

关键词： programming logic Java Design engineering Computer science Probes Ontologies Bridges Security Real time systems

来源：评论

学校读者我要写书评

暂无评论

Detection of connecting points in thai printed characters by combining inductive logic programming with backpropagation neural network

Detection of connecting points in Thai printed characters by...

引用

12th international conference on Image Analysis and Processing

作者： Sinthupinyo, S Pipanmaekaporn, L Kijsirikul, B Thammasat Univ Dept Comp Sci Phatumtanee 12121 Thailand

ISBN: (纸本)0769519482

this paper presents a method for detecting the connecting points in connected thai printed characters. In thai Optical Character Recognition systems, an important problem that decreases the accuracy is the connected characters. these characters could cause the errors in segmentation process. To attack this problem, we first extract the features of the connecting points in the character images. then, we employ inductive logic programming to produce the rules that will be used to classify the unseen images. Finally, we use a Backpropagation Neural Network to make these rules more flexible. the experimental results show that our method achieves 94.94% accuracy.

关键词： connected characters inductive logic programming and backpropagation neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：