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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

238 篇 工学
- 235 篇 计算机科学与技术...
- 76 篇 软件工程
- 16 篇 电子科学与技术（可...
- 11 篇 电气工程
- 7 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 动力工程及工程热...
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 建筑学
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
160 篇 理学
- 155 篇 数学
- 11 篇 统计学（可授理学、...
- 4 篇 物理学
- 1 篇 化学
- 1 篇 生物学
11 篇 管理学
- 8 篇 管理科学与工程(可...
- 8 篇 工商管理
- 2 篇 图书情报与档案管...
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

83 篇 computer science
32 篇 formal logic
19 篇 logic
19 篇 computational mo...
19 篇 polynomials
16 篇 registers
16 篇 semantics
15 篇 mathematics
13 篇 probabilistic lo...
13 篇 standards
13 篇 delay
12 篇 computer archite...
12 篇 hardware
11 篇 concurrent compu...
11 篇 first-order logi...
11 篇 contracts
11 篇 complexity theor...
10 篇 automata
9 篇 linear logic
9 篇 application soft...

机构

8 篇 univ oxford oxfo...
8 篇 cnrs
6 篇 rhein westfal th...
5 篇 univ warsaw wars...
5 篇 department of co...
4 篇 univ bologna bol...
4 篇 tech univ dresde...
3 篇 inria le chesnay
3 篇 department of co...
3 篇 department of ap...
3 篇 univ tokyo
3 篇 carnegie mellon ...
3 篇 mit laboratory f...
2 篇 department of co...
2 篇 vienna tech univ...
2 篇 international co...
2 篇 univ warsaw inst...
2 篇 shanghai jiao to...
2 篇 univ pisa pisa
2 篇 nyu ny 10003 usa

作者

4 篇 b. awerbuch
4 篇 dal lago ugo
3 篇 vardi moshe y.
3 篇 d.m. tullsen
3 篇 d. peleg
3 篇 bojanczyk mikola...
3 篇 gastin paul
3 篇 kiefer sandra
3 篇 worrell james
3 篇 schweitzer pasca...
2 篇 s. dwarkadas
2 篇 adsul bharat
2 篇 kanovich max i.
2 篇 t. leighton
2 篇 kolaitis phokion...
2 篇 avanzini martin
2 篇 krishna shankara...
2 篇 d.h. albonesi
2 篇 tsukada takeshi
2 篇 skrzypczak micha...

语言

358 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science"

共 360 条记录，以下是31-40 订阅

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

详细简洁

排序：

Separating LREC from LFP 22

Separating LREC from LFP

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Dawar, Anuj Santos, Felipe Ferreira Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom

ISBN: (纸本)9781450393515

LREC= is an extension of frst-order logic with a logarithmic recursion operator. It was introduced by Grohe et al. and shown to capture the complexity class L over trees and interval graphs. It does not capture L in general as it is contained in FPC-fxed-point logic with counting. We show that this containment is strict. In particular, we show that the path systems problem, a classic Pcomplete problem which is defnable in LFP-fxed-point logic-is not defnable in LREC=. this shows that the logarithmic recursion mechanism is provably weaker than general least fxed points. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Probability monads with submonads of deterministic states 22

Probability monads with submonads of deterministic states

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Moss, Sean Perrone, Paolo University of Oxford Department of Computer Science Oxford United Kingdom

ISBN: (纸本)9781450393515

Probability theory can be studied synthetically as the computational effect embodied by a commutative monad. In the recently proposed Markov categories, one works with an abstraction of the Kleisli category and then defnes deterministic morphisms equationally in terms of copying and discarding. the resulting difference between 'pure' and 'deterministic' leads us to investigate the 'sober' objects for a probability monad, for which the two concepts coincide. We propose natural conditions on a probability monad which allow us to identify the sober objects and defne an idempotent sobrifcation functor. Our framework applies to many examples of interest, including the Giry monad on measurable spaces, and allows us to sharpen a previously given version of de Finetti's theorem for Markov categories. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Syllepsis in Homotopy Type theory 22

Syllepsis in Homotopy Type Theory

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Sojakova, Kristina Kavvos, G.A. Inria Paris Prosecco Paris France University of Bristol Department of Computer Science Bristol United Kingdom

ISBN: (纸本)9781450393515

the Eckmann-Hilton argument shows that any two monoid structures on the same set satisfying the interchange law are in fact the same operation, which is moreover commutative. When the monoids correspond to the vertical and horizontal composition of a sufciently higher-dimensional category, the Eckmann-Hilton argument itself appears as a higher cell. this cell is often required to satisfy an additional piece of coherence, which is known as the syllepsis. We show that the syllepsis can be constructed from the elimination rule of intensional identity types in Martin-Löf type theory. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Exponentials as Substitutions and the Cost of Cut Elimination in Linear logic 22

Exponentials as Substitutions and the Cost of Cut Eliminatio...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Accattoli, Beniamino Inria and Lix École Polytechnique France

ISBN: (纸本)9781450393515

this paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions. the idea in itself is not new, but here it is pushed to a new level, inspired by Accattoli and Kesner's linear substitution calculus (LSC). One of the key properties of the LSC is that it naturally models the sub-term property of abstract machines, which is the key ingredient for the study of reasonable time cost models for the w-calculus. the new ESC is then used to design a cut elimination strategy with the sub-term property, providing the frst polynomial cost model for cut elimination with unconstrained exponentials. For the ESC, we also prove untyped confluence and typed strong normalization, showing that it is an alternative to proof nets for an advanced study of cut elimination. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks 22

Greatest HITs: Higher inductive types in coinductive definit...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Kristensen, Magnus Baunsgaard Møgelberg, Rasmus Ejlers Vezzosi, Andrea Department of Computer Science It University of Copenhagen Denmark

ISBN: (纸本)9781450393515

We present Clocked Cubical Type theory, the frst type theory combining multi-clocked guarded recursion with the features of Cubical Type theory. Guarded recursion is an abstract form of step-indexing, which can be used for construction of advanced programming language models. In its multi-clocked version, it can also be used for coinductive programming and reasoning, encoding productivity in types. Combining this with Higher Inductive Types (HITs) the encoding extends to coinductive types that are traditionally hard to represent in type theory, such as the type of fnitely branching labelled transition systems. Among our technical contributions is a new principle of induction under clocks, providing computational content to one of the main axioms required for encoding coinductive types. this principle is verifed using a denotational semantics in a presheaf model. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Clocks

来源：评论

学校读者我要写书评

暂无评论

A Functorial Excursion Between Algebraic Geometry and Linear logic 22

A Functorial Excursion Between Algebraic Geometry and Linear...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Melliès, Paul-André CNRS Université Paris Cité Inria France

ISBN: (纸本)9781450393515

the language of Algebraic Geometry combines two complementary and dependent levels of discourse: on the geometric side, schemes defne spaces of the same cohesive nature as manifolds;on the vectorial side, every scheme X comes equipped with a symmetric monoidal category of quasicoherent modules, which may be seen as generalised vector bundles on the scheme X. In this paper, we use the functor of points approach to Algebraic Geometry developed by Grothendieck in the 1970s to establish that every covariant presheaf X on the category of commutative rings - and in particular every scheme X - comes equipped "above it"with a symmetric monoidal closed category PshModX of presheaves of modules. this category PshModX defnes moreover a model of intuitionistic linear logic, whose exponential modality is obtained by glueing together in an appropriate way the Sweedler dual construction on ring algebras. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction 22

Concrete categories and higher-order recursion: With applica...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Matache, Cristina Moss, Sean Staton, Sam University of Oxford Department of Computer Science Oxford United Kingdom

ISBN: (纸本)9781450393515

We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such as models for probabilistic and differentiable programming, and fully abstract logical relations models. We treat recursion in the spirit of synthetic domain theory. We provide a general construction of a lifting monad starting from a class of admissible monomorphisms in the site of the sheaf category. In this way, we obtain a family of models parametrized by a concrete site and a class of monomorphisms, for which we prove a general computational adequacy theorem. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

the Regular Languages of First-Order logic with One Alternation 22

The Regular Languages of First-Order Logic with One Alternat...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Barloy, Corentin Cadilhac, Michaël Paperman, Charles Zeume, thomas Univ. Lille Cnrs Inria Centrale Lille Umr 9189 CRIStAL France DePaul University United States Ruhr-Universität Bochum Germany

ISBN: (纸本)9781450393515

the regular languages with a neutral letter expressible in frstorder logic with one alternation are characterized. Specifcally, it is shown that if an arbitrary s2 formula defnes a regular language with a neutral letter, then there is an equivalent s2 formula that only uses the order predicate. this shows that the so-called Central Conjecture of Straubing holds for s2 over languages with a neutral letter, the frst progress on the Conjecture in more than 20 years. To show the characterization, lower bounds against polynomial-size depth-3 Boolean circuits with constant top fan-in are developed. the heart of the combinatorial argument resides in studying how positions within a language are determined from one another, a technique of independent interest. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

Smooth approximations and CSPs over finitely bounded homogeneous structures 22

Smooth approximations and CSPs over finitely bounded homogen...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Mottet, Antoine Pinsker, Michael Tu Hamburg Institute for Theoretical Computer Science Hamburg Germany Tu Wien Institute of Discrete Mathematics and Geometry Vienna Austria

ISBN: (纸本)9781450393515

We introduce the novel machinery of smooth approximations, and apply it to confrm the CSP dichotomy conjecture for frst-order reducts of the random tournament, and to give new short proofs of the conjecture for various homogeneous graphs including the random graph (STOC'11, ICALP'16), and for expansions of the order of the rationals (STOC'08). Apart from obtaining these dichotomy results, we show how our new proof technique allows to unify and signifcantly simplify the previous results from the literature. For all but the last structure, we moreover characterize for the frst time those CSPs which are solvable by local consistency methods, again using the same machinery. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

Abstractions for the local-time semantics of timed automata: A foundation for partial-order methods 22

Abstractions for the local-time semantics of timed automata:...

引用

37th annual acm/ieee symposium on logic in computer science, LICS 2022

作者： Govind, R. Herbreteau, Frédéric Srivathsan, B. Walukiewicz, Igor Dept. of Computer Science and Engineering Iit Bombay Mumbai India Univ. Bordeaux Cnrs Bordeaux Inp LaBRI TalenceUMR5800 France Chennai Mathematical Institute Chennai India

ISBN: (纸本)9781450393515

A timed network is a parallel composition of timed automata synchronizing on common actions. We develop a methodology that allows to use partial-order methods when solving the reachability problem for timed networks. It is based on a local-time semantics proposed by [Bengtsson et al. 1998]. A new simulation based abstraction of local-time zones is proposed. the main technical contribution is an efcient algorithm for testing subsumption between local-time zones with respect to this abstraction operator. the abstraction is not fnite for all networks. It turns out that, under relatively mild conditions, there is no fnite abstraction for local-time zones that works for arbitrary timed networks. To circumvent this problem, we introduce a notion of a bounded-spread network. the spread of a network is a parameter that says how far the local times of individual processes need to diverge. For boundedspread networks, we show that it is possible to use subsumption and partial-order methods at the same time. © 2022 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：