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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

421 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

323 篇 工学
- 317 篇 计算机科学与技术...
- 154 篇 软件工程
- 43 篇 电子科学与技术（可...
- 17 篇 电气工程
- 16 篇 动力工程及工程热...
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 9 篇 化学工程与技术
- 9 篇 生物工程
- 5 篇 机械工程
- 5 篇 环境科学与工程（可...
- 4 篇 建筑学
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 农业工程
- 3 篇 生物医学工程（可授...
195 篇 理学
- 173 篇 数学
- 19 篇 物理学
- 14 篇 统计学（可授理学、...
- 13 篇 系统科学
- 12 篇 生物学
- 9 篇 化学
- 3 篇 地球物理学
52 篇 管理学
- 31 篇 管理科学与工程(可...
- 25 篇 工商管理
- 21 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学
3 篇 农学
- 3 篇 作物学

主题

51 篇 computer science
34 篇 formal logic
23 篇 polynomials
15 篇 logic programmin...
13 篇 graphics process...
13 篇 logic
11 篇 first-order logi...
10 篇 mathematics
9 篇 linear logic
9 篇 registers
9 篇 bandwidth
9 篇 computational mo...
8 篇 costs
8 篇 hardware
7 篇 approximation al...
7 篇 model checking
7 篇 mapreduce
7 篇 logic circuits
7 篇 algorithm design...
6 篇 parallel process...

机构

5 篇 cnrs
5 篇 rhein westfal th...
4 篇 univ warsaw wars...
3 篇 inria le chesnay
3 篇 univ oxford oxfo...
3 篇 department of co...
3 篇 institute of com...
3 篇 tech univ dresde...
3 篇 department of co...
2 篇 univ warsaw inst...
2 篇 shanghai jiao to...
2 篇 nyu ny 10003 usa
2 篇 department of co...
2 篇 comput & inf sci...
2 篇 european centre ...
2 篇 department of co...
2 篇 stanford univ ca...
2 篇 department of co...
2 篇 department of co...
2 篇 ucl england

作者

4 篇 r. kannan
4 篇 a. frieze
4 篇 tullsen dean m.
3 篇 vardi moshe y.
3 篇 sasao tsutomu
3 篇 chong frederic t...
3 篇 bojanczyk mikola...
3 篇 prasad sushil k.
3 篇 stanković radomi...
3 篇 kiefer sandra
3 篇 worrell james
3 篇 thornton mitchel...
3 篇 drechsler rolf
2 篇 raicu ioan
2 篇 kanovich max i.
2 篇 kolaitis phokion...
2 篇 moraga claudio
2 篇 j.s. vitter
2 篇 zhu michelle m.
2 篇 kim hyesoon

语言

420 篇 英文
3 篇 其他

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

共 423 条记录，以下是61-70 订阅

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

详细简洁

排序：

Modal Intuitionistic logics as Dialgebraic logics 20

Modal Intuitionistic Logics as Dialgebraic Logics

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： de Groot, Jim Pattinson, Dirk Australian Natl Univ Coll Engn & Comp Sci Canberra ACT Australia

ISBN: (纸本)9781450371049

Duality is one of the key techniques in the categorical treatment of modal logics. From the duality between (modal) algebras and (descriptive) frames one derives e.g. completeness (via a syntactic characterisation of algebras) or definability (using a suitable version of the Goldblatt-thomason theorem). this is by now well understood for classical modal logics and modal logics based on distributive lattices, via extensions of Stone and Priestley duality, respectively. What is conspicuously absent is a comprehensive treatment of modal intuitionistic logic. this is the gap we are closing in this paper. Our main conceptual insight is that modal intuitionistic logics do not appear as algebra/coalgebra dualities, but instead arise naturally as dialgebras. Our technical contribution is the development of dualities for dialgebras, together with their logics, that instantiate to large class of modal intuitionistic logics and their frames as special cases. We derive completeness and expressiveness results in this general case. For modal intuitionistic logic, this systematises the existing treatment in the literature.

关键词： modal logic coalgebraic logic dialgebras

来源：评论

学校读者我要写书评

暂无评论

Temporal Constraint Satisfaction Problems in Fixed-Point logic 20

Temporal Constraint Satisfaction Problems in Fixed-Point Log...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Bodirsky, Manuel Pakusa, Wied Rydval, Jakub Tech Univ Dresden Dresden Germany Rhein Westfal TH Aachen Aachen Germany

ISBN: (纸本)9781450371049

Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting. the border between the two regimes can be described by a strong height-one Maltsev condition. For infinite-domain CSPs, the situation is more complicated even if the template structure of the CSP is model-theoretically tame. We prove that there is no Maltsev condition that characterizes Datalog already for the CSPs of first-order reducts of (Q;<);such CSPs are called temporal CSPs and are of fundamental importance in infinite-domain constraint satisfaction. Our main result is a complete classification of temporal CSPs that can be expressed in one of the following logical formalisms: Datalog, fixed-point logic (with or without counting), or fixed-point logic with the Boolean rank operator. the classification shows that many of the equivalent conditions in the finite fail to capture expressibility in Datalog or fixed-point logic already for temporal CSPs.

关键词： temporal constraint satisfaction problems fixed-point logic Maltsev conditions

来源：评论

学校读者我要写书评

暂无评论

On Computability of logical Approaches to Branching-Time Property Verification of Programs 20

On Computability of Logical Approaches to Branching-Time Pro...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Tsukada, Takeshi Univ Tokyo Tokyo Japan

ISBN: (纸本)9781450371049

this paper studies the hardness of branching-time property verification of Turing-complete programming languages, as well as logical approaches to the verification problem. As these approaches reduce the verification problem to logical problems, e.g. the satisfiability problem of Horn clauses with certain extensions, it is natural to ask whether the logical problems are as hard as the verification problem or strictly harder. this paper reveals that logical problems used in most approaches are far more difficult than the verification problem;the only exception is the validity problem of first-order arithmetic with fixed-point operators. We also answers some other natural questions, for example, whether the extensions of Horn clauses are necessarily.

关键词： program verification branching-time property computability fixed-point logic constrained Horn clause analytical hierarchy

来源：评论

学校读者我要写书评

暂无评论

Descriptive complexity of real computation and probabilistic independence logic 20

Descriptive complexity of real computation and probabilistic...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Hannula, Miika Kontinen, Juha Van den Bussche, Jan Virtema, Jonni Univ Helsinki Helsinki Finland Hasselt Univ Hasselt Belgium Hokkaido Univ Sapporo Hokkaido Japan

ISBN: (纸本)9781450371049

We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in nondeterministic polynomial time by S-BSS machines. We show that NP on S-BSS machines is strictly included in NP on BSS machines and that every NP language on SBSS machines is a countable disjoint union of closed sets in the usual topology of R-n. Moreover, we establish that on Boolean inputs NP on S-BSS machines without real constants characterises a natural fragment of the complexity class (a class of problems polynomial time reducible to the true existential theory of the reals) and hence lies between N P and PS PACE. Finally we apply our results to determine the data complexity of probabilistic independence logic.

关键词： Blum-Shub-Smale machines descriptive complexity team semantics independence logic real arithmetic

来源：评论

学校读者我要写书评

暂无评论

Cones as a model of intuitionistic linear logic 20

Cones as a model of intuitionistic linear logic

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Ehrhard, thomas Univ Paris CNRS IRIF F-75013 Paris France

ISBN: (纸本)9781450371049

For overcoming the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, we introduced with Pagani and Tasson a model of probabilistic higher order computation based on (positive) cones, and a class of totally monotone functions that we called "stable". then Crubille proved that this model is a conservative extension of the earlier probabilistic coherence space model. We continue these investigations by showing that the category of cones and linear and Scott-continuous functions is a model of intuitionistic linear logic. To define the tensor product, we use the special adjoint functor theorem, and we prove that this operation is an extension of the standard tensor product of probabilistic coherence spaces. We also show that these latter are dense in cones, thus allowing to lift the main properties of the tensor product of probabilistic coherence spaces to general cones. Finally we define in the same way an exponential of cones and extend measurability to these new operations.

关键词： Denotational semantics probabilistic programming languages linear logic

来源：评论

学校读者我要写书评

暂无评论

logic Beyond Formulas: A Proof System on Graphs 20

Logic Beyond Formulas: A Proof System on Graphs

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Acclavio, Matteo Horne, Ross Strassburger, Lutz Univ Luxembourg Comp Sci Esch Sur Alzette Luxembourg INRIA Equipe Partout Ecole Polytech LIX UMR 7161 Rocquencourt France

ISBN: (纸本)9781450371049

In this paper we present a proof system that operates on graphs instead of formulas. We begin our quest with the well-known correspondence between formulas and cographs, which are undirected graphs that do not have P-4 (the four-vertex path) as vertex-induced subgraph;and then we drop that condition and look at arbitrary (undirected) graphs. the consequence is that we lose the tree structure of the formulas corresponding to the cographs. therefore we cannot use standard proof theoretical methods that depend on that tree structure. In order to overcome this difficulty, we use a modular decomposition of graphs and some techniques from deep inference where inference rules do not rely on the main connective of a formula. For our proof system we show the admissibility of cut and a generalization of the splitting property. Finally, we show that our system is a conservative extension of multiplicative linear logic (MLL) with mix, meaning that if a graph is a cograph and provable in our system, then it is also provable in MLL+mix.

关键词： Proof theory cographs graph modules prime graphs cut elimination deep inference splitting analycity

来源：评论

学校读者我要写书评

暂无评论

Modal logics with Composition on Finite Forests: Expressivity and Complexity 20

Modal Logics with Composition on Finite Forests: Expressivit...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Bednarczyk, Bartosz Demri, Stephane Fervari, Raul Mansutti, Alessio Tech Univ Dresden Dresden Germany Univ Wroclaw Wroclaw Poland Univ Paris Saclay ENS Paris Saclay CNRS LSV Gif Sur Yvette France Univ Nacl Cordoba FAMAF Cordoba Argentina Consejo Nacl Invest Cient & Tecn Buenos Aires DF Argentina

ISBN: (纸本)9781450371049

We study the expressivity and complexity of two modal logics interpreted on finite forests and equipped with standard modalities to reason on submodels. the logic ML(vertical bar) extends the modal logic K with the composition operator vertical bar from ambient logic, whereas ML(*) features the separating conjunction * from separation logic. Both operators are second-order in nature. We show that ML(vertical bar) is as expressive as the graded modal logic GML (on trees) whereas ML(*) is strictly less expressive than GML. Moreover, we establish that the satisfiability problem is TOWER-complete for ML(*), whereas it is (only) AEXP(POL)-complete for ML(vertical bar), a result which is surprising given their relative expressivity. As by-products, we solve open problems related to sister logics such as static ambient logic and modal separation logic.

关键词： modal logic on trees separation logic static ambient logic graded modal logic expressive power complexity

来源：评论

学校读者我要写书评

暂无评论

Consuming and Persistent Types for Classical logic 20

Consuming and Persistent Types for Classical Logic

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Kesner, Delia Vial, Pierre Univ Paris Paris France Inst Univ France Paris France Inria LS2N CNRS Paris France

ISBN: (纸本)9781450371049

We prove that type systems are able to capture exact measures related to dynamic properties of functional programs with control operators, which allow implementing intricate continuations and backtracking. Our type systems give the number of evaluation steps to normal form as well as the size of this normal form without any evaluation being needed. We focus on Parigot's lambda mu-calculus, a computational interpretation of classical natural deduction, and our type systems are based upon non-idempotent intersection and union types. We introduce two kinds of arrows: consuming ones, which type function applications that are evaluated/destroyed during reduction, and persistent ones, which type those that are never consumed. these two forms of arrows are the essential tool of our typing systems to deal with control operators, as we are going to show. the main contribution of this paper is a type framework capturing exact measures within the lambda mu-calculus for 3 different evaluation strategies, namely, head, leftmost-outermost and maximal, associated to the well-known notions of head, weak and strong normalization respectively. Moreover, this is done in a parametric way: we do not provide one type system for each reduction strategy, as it is usually done in the literature, but we give a unique typing system parametrizing key concepts and factorizing common proofs.

关键词： classical logic lambda-mu calculus intersection and union types exact measures natural deduction

来源：评论

学校读者我要写书评

暂无评论

An Efficient Normalisation Procedure for Linear Temporal logic and Very Weak Alternating Automata 20

An Efficient Normalisation Procedure for Linear Temporal Log...

引用

35th annual acm/ieee symposium on logic in computer science (LICS)

作者： Sickert, Salomon Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450371049

In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formula of the form Lambda(n)(i=)(1) GF(phi i) VFG(psi i), where phi(i), and psi(i) contain only past operators. Some years later, Chang, Manna, and Pnueli built on this result to derive a similar normal form for LTL. Both normalisation procedures have a non-elementary worst-case blow-up, and follow an involved path from formulas to counter-free automata to star-free regular expressions and back to formulas. We improve on both points. We present a direct and purely syntactic normalisation procedure for LTL yielding a normal form, comparable to the one by Chang, Manna, and Pnueli, that has only a single exponential blow-up. As an application, we derive a simple algorithm to translate LTL into deterministic Rabin automata. the algorithm normalises the formula, translates it into a special very weak alternating automaton, and applies a simple determinisation procedure, valid only for these special automata.

关键词： Linear Temporal logic Normal Form Weak Alternating Automata Deterministic Automata

来源：评论

学校读者我要写书评

暂无评论

Forbidden Induced Subgraphs and the Loś-Tarski theorem

Forbidden Induced Subgraphs and the Loś-Tarski Theorem

引用

36th annual acm/ieee symposium on logic in computer science, LICS 2021

作者： Chen, Yijia Flum, Jorg Shanghai Jiao Tong University Department of Computer Science China Mathematisches Institut Albert-Ludwigs-Universität Freiburg Germany

ISBN: (纸本)9781665448956

Let \mathcal C be a class of finite and infinite graphs that is closed under induced subgraphs. the well-known Loś-Tarski theorem from classical model theory implies that \mathcal C is definable in first-order logic (FO) by a sentence if and only if \mathcal C has a finite set of forbidden induced finite subgraphs. It provides a powerful tool to show nontrivial characterizations of graphs of small vertex cover, of bounded tree-depth, of bounded shrub-depth, etc. in terms of forbidden induced finite subgraphs. Furthermore, by the Completeness theorem, we can compute from the corresponding forbidden induced subgraphs. Our results (a) and (b) show that this machinery fails on finite graphs.(a)there is a class of finite graphs that is definable in FO and closed under induced subgraphs but has no finite set of forbidden induced subgraphs.(b)Even if we only consider classes \mathcal C of finite graphs that can be characterized by a finite set of forbidden induced subgraphs such a characterization cannot be computed from an FO-sentence that defines \mathcal C and the size of the characterization cannot be bounded by f(||) for any computable function *** their importance in graph theory, our results also significantly strengthen similar known theorems for arbitrary structures. © 2021 ieee.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共43页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：