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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

229 篇 工学
- 218 篇 计算机科学与技术...
- 109 篇 软件工程
- 23 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 信息与通信工程
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 安全科学与工程
47 篇 理学
- 44 篇 数学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
14 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

69 篇 logic programmin...
17 篇 answer set progr...
15 篇 inductive logic ...
12 篇 mathematical log...
11 篇 artificial intel...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 programming
10 篇 programming lang...
9 篇 software enginee...
9 篇 logic
7 篇 application soft...
7 篇 logic gates
7 篇 inductive logic ...
7 篇 semantics
7 篇 programming tech...
7 篇 system testing
6 篇 software enginee...
6 篇 machine learning
6 篇 algorithm analys...

机构

3 篇 new mexico state...
3 篇 univ calabria ar...
3 篇 tu wien inst log...
3 篇 tech univ dresde...
2 篇 technological ed...
2 篇 univ oxford oxfo...
2 篇 univ nebraska om...
2 篇 univ helsinki de...
2 篇 network operatio...
2 篇 univ freiburg in...
2 篇 inria lille nord...
2 篇 tech univ dortmu...
2 篇 ecole polytech i...
2 篇 univ paris 13 li...
2 篇 univ pisa dept c...
2 篇 tech univ munich...
2 篇 portland state u...
2 篇 univ london impe...
2 篇 katholieke univ ...
1 篇 bolsista do prog...

作者

4 篇 riguzzi fabrizio
4 篇 ricca francesco
3 篇 gaggl sarah alic...
3 篇 kramer stefan
3 篇 page david
3 篇 son tran cao
3 篇 srinivasan ashwi...
3 篇 froehler sebasti...
3 篇 alphonse erick
2 篇 muggleton stephe...
2 篇 giordano laura
2 篇 toivonen h.
2 篇 ong irene m.
2 篇 revoredo k.
2 篇 bellodi elena
2 篇 osmani aomar
2 篇 bryant christoph...
2 篇 ray oliver
2 篇 hutter dieter
2 篇 costa vitor sant...

语言

314 篇 英文
2 篇 中文
1 篇 葡萄牙文
1 篇 其他

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

共 318 条记录，以下是151-160 订阅

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

详细简洁

排序：

logic and Computation in a Lambda Calculus with Intersection and Union Types

Logic and Computation in a Lambda Calculus with Intersection...

引用

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

作者： Dougherty, Daniel J. Liquori, Luigi Worcester Polytech Inst Worcester MA 01609 USA INRIA Paris France

ISBN: (纸本)9783642175107

We present an explicitly typed lambda calculus "a la Church" based on the union and intersection types discipline;this system is the counterpart of the standard type assignment calculus "a la Curry." Our typed calculus enjoys the Subject Reduction and Church-Rosser properties, and typed terms are strongly normalizing when the universal type is omitted. Moreover both type checking and type reconstruction are decidable. In contrast to other typed calculi, a system with union types will fail to be "coherent" in the sense of Tannen, Coquand, Gunter, and Scedrov: different proofs of the same typing judgment will not necessarily have the same meaning. In response, we introduce a decidable notion of equality on type-assignment derivations inspired by the equational theory of bicartesian-closed categories.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Counting and Enumeration Problems with Bounded Treewidth

Counting and Enumeration Problems with Bounded Treewidth

引用

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

作者： Pichler, Reinhard Ruemmele, Stefan Woltran, Stefan Vienna Univ Technol A-1040 Vienna Austria

ISBN: (纸本)9783642175107

By Courcelle's theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. this result was extended to counting problems by Arnborg et al. and to enumeration problems by Flum et al. Despite the undisputed importance of these results for proving fixed-parameter tractability, they do not directly yield implementable algorithms. Recently, Gottlob et al. presented a new approach using monadic datalog to close the gap between theoretical tractability and practical computability for MSO-definable decision problems. In the current work we show how counting and enumeration problems can be tackled by an appropriate extension of the datalog approach.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

An Intuitionistic Epistemic logic for Sequential Consistency on Shared Memory

An Intuitionistic Epistemic Logic for Sequential Consistency...

引用

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

作者： Hirai, Yoichi Univ Tokyo Dept Comp Sci Tokyo 1130033 Japan

ISBN: (纸本)9783642175107

In the celebrated Godel Prize winning papers, Herlihy, Shavit, Saks and Zaharoglou gave topological characterization of waitfree computation. In this paper, we characterize waitfree communication logically. First, we give an intuitionistic epistemic logic K boolean OR for asynchronous communication. the semantics for the logic K boolean OR is an abstraction of Herlihy and Shavit's topological model. In the same way Kripke model for intuitionistic logic informally describes an agent increasing its knowledge over time, the semantics of K boolean OR describes multiple agents passing proofs around and developing their knowledge together. On top of the logic K boolean OR, we give an axiom type that characterizes sequential consistency on shared memory. the advantage of intuitionistic logic over classical logic then becomes apparent as the axioms for sequential consistency are meaning less for classical logic because they are classical tautologies. the axioms are similar to the axiom type for prelinearity (phi superset of psi) boolean OR (psi superset of phi). this similarity reflects the analogy between sequential consistency for shared memory scheduling and linearity for Kripke frames: both require total order on schedules or models. Finally, under sequential consistency, we give soundness and completeness between a set of logical formulas called waitfree assertions and a set of models called waitfree schedule models.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Constraint-Directed Search in Computational Finance and Economics

Constraint-Directed Search in Computational Finance and Econ...

引用

16th Annual international conference on the Principles and Practice of Constraint programming

作者： Tsang, Edward Univ Essex Ctr Computat Intelligence Finance & Econ CCFEA Colchester CO4 3SQ Essex England

ISBN: (纸本)9783642153952

Constraints shield solutions from a problem solver. However, in the hands of trained constraint problem solvers, the same constraints that create the problems in the first place can also guide problem solvers to solutions. Constraint satisfaction is all about learning how to flow with the force of the constraints. © 2010 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Global Constraints on Feature Models

Global Constraints on Feature Models

引用

16th Annual international conference on the Principles and Practice of Constraint programming

作者： Karatas, Ahmet Serkan Oguztuzun, Halit Dogru, Ali Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

ISBN: (纸本)9783642153952

Feature modeling has been found very effective for modeling and managing variability in Software Product Lines. the nature of feature models invites, sometimes even requires, the use of global constraints. this paper lays the groundwork for the inclusion of global constraints in automated reasoning on feature models. We present a mapping from extended feature models to constraint logic programming over finite domains, and show that this mapping enables using global constraints on feature attributes, as well as features, for a variety of analysis operations on feature models. We also present performance test results and discuss the benefits of using global constraints.

关键词： constraint logic programming over finite domains feature models Global constraints

来源：评论

学校读者我要写书评

暂无评论

Principles and Practice of Constraint programming, CP 2010 - 16th international conference, Proceedings

Principles and Practice of Constraint Programming, CP 2010 -...

引用

16th international conference on Principles and Practice of Constraint programming, CP 2010

ISBN: (纸本)364215395X

the proceedings contain 49 papers. the topics discussed include: constraint-directed search in computational finance and economics;constraints, graphs, algebra, logic, and complexity;testing expressibility is hard;applying constraint programming to identification and assignment of service professionals;computing the density of states of Boolean formulas;towards parallel non serial dynamic programming for solving hard weighted CSP;making adaptive an interval constraint propagation algorithm exploiting monotonicity;checking-up on branch-and-check;spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows;propagating the bin packing constraint using linear programming;sweeping with continuous domains;a new hybrid tractable class of soft constraint problems;a propagator for maximum weight string alignment with arbitrary pairwise dependencies;and generating special-purpose stateless propagators for arbitrary constraints.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semiring-Induced Propositional logic: Definition and Basic Algorithms

Semiring-Induced Propositional Logic: Definition and Basic A...

引用

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

作者： Larrosa, Javier Oliveras, Albert Rodriguez-Carbonell, Enric Tech Univ Catalonia Barcelona Spain

ISBN: (纸本)9783642175107

In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. the main interest of this extension is that different instantiations of the semiring model different interesting computational problems such as finding a model, counting the number of models, finding the best model with respect to an objective function, finding the best model with respect to several independent objective functions, or finding the set of pareto-optimal models with respect to several objective functions. then we show that this framework unifies several solving techniques and, even more importantly, rephrases them from an algorithmic language to a logical language. As a result, several solving techniques can be trivially and elegantly transferred from one computational problem to another. As an example, we extend the basic DPLL algorithm to our framework producing an algorithm that we call SDPLL. then we enhance the basic SDPLL in order to incorporate the three features that are common in all modern SAT solvers: backjumping, learning and restarts. As a result, we obtain an extremely simple algorithm that captures, unifies and extends in a well-defined logical language several techniques that are valid for arbitrary semirings.

关键词： semiring marginalization problem DPLL

来源：评论

学校读者我要写书评

暂无评论

Constraint-Based Abstract Semantics for Temporal logic: A Direct Approach to Design and Implementation

Constraint-Based Abstract Semantics for Temporal Logic: A Di...

引用

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

作者： Banda, Gourinath Gallagher, John P. Roskilde Univ Roskilde Denmark

ISBN: (纸本)9783642175107

interpretation provides a practical approach to verifying properties of infinite-state systems. We apply the framework of abstract interpretation to derive an abstract semantic function for the modal mu-calculus, which is the basis for abstract model checking. the abstract semantic function is constructed directly from the standard concrete semantics together with a Galois connection between the concrete state-space and an abstract domain. there is no need for mixed or modal transition systems to abstract arbitrary temporal properties, as in previous work in the area of abstract model checking. Using the modal mu-calculus to implement CTL, the abstract semantics gives an over-approximation of the set of states in which an arbitrary CTL formula holds. then we show that this leads directly to an effective implementation of an abstract model checking algorithm for CTL using abstract domains based on linear constraints. the implementation of the abstract semantic function makes use of an SMT solver. We describe an implemented system for proving properties of linear hybrid automata and give some experimental results.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Graded Alternating-Time Temporal logic

Graded Alternating-Time Temporal Logic

引用

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

作者： Faella, Marco Napoli, Margherita Parente, Mimmo Univ Naples Federico II Dept Phys Via Cintia I-80126 Naples Italy Univ Salerno Dipartimento Informatica Applicazioni RM Capocell Fisciano SA Italy

ISBN: (纸本)9783642175107

Graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Recently, temporal logics such as mu-calculus and Computational Tree logic, CTL, augmented with graded modalities have received attention from the scientific community, both from a theoretical side and from an applicative perspective. Both mu-calculus and CTL naturally apply as specification languages for closed systems: in this paper, we add graded modalities to the Alternating-time Temporal logic (ATL) introduced by Alur et al., to study how these modalities may affect specification languages for open systems. We present, and compare with each other, three different semantics. We first consider a natural interpretation which seems suitable to off-line synthesis applications and then we restrict it to the case where players can only employ memoryless strategies. Finally, we strengthen the logic by means of a different interpretation which may find application in the verification of fault-tolerant controllers. For all the interpretations, we efficiently solve the model-checking problem both in the concurrent and turn-based settings, proving its PTIME-completeness. To this aim we also exploit also a characterization of the maximum grading value of a given formula.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

An Alternative to SAT-Based Approaches for Bit-Vectors

An Alternative to SAT-Based Approaches for Bit-Vectors

引用

16th international conference on Tools and Algorithms for the Construction and Analysis of Systems held at the 13th Joint European conferences on theory and Practice of Software

作者： Bardin, Sebastien Herrmann, Philippe Perroud, Florian CEA LIST Software Safety Lab F-91191 Gif Sur Yvette France

ISBN: (纸本)9783642120015

the theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solvers for this theory are based on a bit-level encoding into propositional logic and SAT-based resolution techniques. In this paper, we investigate an alternative approach based on a word-level encoding into bounded arithmetic and Constraint logic programming (CLP) resolution techniques. We define an original CLP framework (domains and propagators) dedicated to bit-vector constraints. this framework is implemented in a prototype and thorough experimental studies have been conducted. the new approach is shown to perform much better than standard CLP-based approaches, and to considerably reduce the gap with the best SAT-based BV solvers.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：