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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,808 篇 会议
36 篇 期刊文献
4 册 图书
1 篇 科技报告

馆藏范围

3,847 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

2,078 篇 工学
- 1,910 篇 计算机科学与技术...
- 797 篇 软件工程
- 348 篇 电气工程
- 206 篇 电子科学与技术（可...
- 125 篇 信息与通信工程
- 77 篇 控制科学与工程
- 55 篇 材料科学与工程（可...
- 54 篇 机械工程
- 43 篇 动力工程及工程热...
- 16 篇 生物工程
- 15 篇 建筑学
- 15 篇 化学工程与技术
- 14 篇 仪器科学与技术
- 13 篇 力学（可授工学、理...
- 13 篇 生物医学工程（可授...
- 10 篇 光学工程
- 10 篇 土木工程
- 10 篇 安全科学与工程
915 篇 理学
- 843 篇 数学
- 68 篇 统计学（可授理学、...
- 52 篇 物理学
- 27 篇 系统科学
- 21 篇 生物学
- 14 篇 化学
132 篇 管理学
- 91 篇 管理科学与工程(可...
- 62 篇 工商管理
- 42 篇 图书情报与档案管...
17 篇 经济学
- 17 篇 应用经济学
17 篇 教育学
- 16 篇 教育学
10 篇 法学
- 10 篇 社会学
7 篇 农学
3 篇 医学
2 篇 哲学
2 篇 军事学

主题

1,060 篇 computer science
542 篇 logic
240 篇 calculus
232 篇 polynomials
217 篇 automata
207 篇 computer archite...
198 篇 computational mo...
176 篇 complexity theor...
172 篇 logic gates
169 篇 formal logic
169 篇 logic programmin...
162 篇 hardware
161 篇 computer languag...
152 篇 algebra
149 篇 equations
137 篇 probabilistic lo...
136 篇 computer metathe...
132 篇 semantics
129 篇 mathematics
111 篇 computer program...

机构

17 篇 department of co...
15 篇 univ oxford oxfo...
15 篇 department of co...
14 篇 computer laborat...
14 篇 school of comput...
13 篇 department of el...
12 篇 cnrs
12 篇 carnegie mellon ...
12 篇 department of co...
11 篇 rhein westfal th...
10 篇 inria
10 篇 univ bologna bol...
10 篇 ibm thomas j. wa...
10 篇 stanford univ ca...
10 篇 univ oxford dept...
10 篇 univ warsaw wars...
9 篇 tsinghua univers...
9 篇 at and t bell la...
9 篇 computer science...
9 篇 department of co...

作者

15 篇 m.y. vardi
14 篇 vardi moshe y.
12 篇 halpern joseph y...
11 篇 kolaitis phokion...
11 篇 t.a. henzinger
10 篇 pnueli amir
10 篇 alur rajeev
10 篇 r. alur
10 篇 henzinger thomas...
9 篇 bojanczyk mikola...
9 篇 m. grohe
8 篇 a. pnueli
8 篇 sherwood timothy
8 篇 n. immerman
8 篇 p.g. kolaitis
8 篇 immerman neil
8 篇 panangaden praka...
8 篇 f. pfenning
8 篇 rolf drechsler
8 篇 m. otto

语言

3,838 篇 英文
6 篇 其他
5 篇 中文

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

共 3849 条记录，以下是131-140 订阅

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

详细简洁

排序：

Anchored LTL Separation 14

Anchored LTL Separation

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Maretic, Grgur Petric Dashti, Mohammad Torabi Basin, David Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781450328869

Gabbay's separation theorem is a fundamental result for linear temporal logic (LTL). We show that separating a restricted class of LTL formulas, called anchored LTL, is elementary if and only if the translation from LTL to the linear temporal logic with only future temporal connectives is elementary. To prove this result, we define a canonical separation for LTL, and establish a correspondence between a canonical separation of anchored LTL formulas and the omega-automata that recognize these formulas. The canonical separation of anchored LTL formulas has two further applications. First, we constructively prove that the safety closure of any LTL property is an LTL property, thus proving the decomposition theorem for LTL: every LTL formula is equivalent to the conjunction of a safety LTL formula and a liveness LTL formula. Second, we characterize safety, liveness, absolute liveness, stable, and fairness properties in LTL. Our characterization is effective: We reduce the problem of deciding whether an LTL formula defines any of these properties to the validity problem for LTL.

关键词： Linear Temporal logic omega-automata Safety Liveness

来源：评论

学校读者我要写书评

暂无评论

Asymptotic behaviour in temporal logic 14

Asymptotic behaviour in temporal logic

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Asarin, Eugene Blockelet, Michel Degorre, Aldric Dima, Catalin Mu, Chunyan Univ Paris Diderot LIAFA Paris France CNRS Paris France Univ Paris Est Creteil LACL Creteil France Univ Birmingham Sch Comp Sci Birmingham W Midlands England

ISBN: (纸本)9781450328869

We study the "approximability" of unbounded temporal operators with time-bounded operators, as soon as some time bounds tend to infinity. More specifically, for formulas in the fragments PLTL lozenge and PLTL square of the Parametric Linear Temporal logic of Alur et al., we provide algorithms for computing the limit entropy as all parameters tend to 1. As a consequence, we can decide the problem whether the limit entropy of a formula in one of the two fragments coincides with that of its time-unbounded transformation, obtained by replacing each occurrence of a time-bounded operator into its time-unbounded version. The algorithms proceed by translation of the two fragments of PLTL into two classes of discrete-time timed automata and analysis of their strongly-connected components.

关键词： entropy temporal logic

来源：评论

学校读者我要写书评

暂无评论

Decidable Elementary Modal logics 12

Decidable Elementary Modal Logics

引用

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

作者： Michaliszyn, Jakub Otop, Jan Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland

ISBN: (纸本)9780769547695

In this paper, the modal logic over classes of structures definable by universal first-order Horn formulas is studied. We show that the satisfiability problems for those logics are decidable, confirming the conjecture from [5]. We provide a full classification of logics defined by universal first-order Horn formulas, with respect to the complexity of satisfiability of modal formulas over the classes of frames they define. It appears, that except for the trivial case of inconsistent formulas for which the problem is in P, local satisfiability is either NP-complete or PSPACE-complete, and global satisfiability is NP-complete, PSPACE-complete, or EXPTIME-complete. While our results hold even if we allow to use equality, we show that inequality leads to undecidability.

关键词： modal logic decidability elementary logic

来源：评论

学校读者我要写书评

暂无评论

Factor Varieties and Symbolic Computation 16

Factor Varieties and Symbolic Computation

引用

31st annual acm-ieee symposium on logic in computer science (LICS)

作者： Salibra, Antonino Manzonetto, Giulio Favro, Giordano Univ Ca Foscari Venezia Venice Italy Univ Paris 13 LIPN CNRS UMR 7030 F-93430 Villetaneuse France

ISBN: (纸本)9781450343916

We propose an algebraization of classical and non-classical logics, based on factor varieties and decomposition operators. In particular, we provide a new method for determining whether a propositional formula is a tautology or a contradiction. This method can be automatized by defining a term rewriting system that enjoys confluence and strong normalization. This also suggests an original notion of logical gate and circuit, where propositional variables becomes logical gates and logical operations are implemented by substitution. Concerning formulas with quantifiers, we present a simple algorithm based on factor varieties for reducing first-order classical logic to equational logic. We achieve a completeness result for first-order classical logic without requiring any additional structure.

关键词： universal algebra equational logic factor variety discriminator variety multi-valued logic factor circuit

来源：评论

学校读者我要写书评

暂无评论

Unified Semantics and Proof System for Classical, Intuitionistic and Affine logics 16

Unified Semantics and Proof System for Classical, Intuitioni...

引用

31st annual acm-ieee symposium on logic in computer science (LICS)

作者： Liang, Chuck Hofstra Univ Hempstead NY 11550 USA

ISBN: (纸本)9781450343916

This paper modifies our previous work in combining classical logic with intuitionistic logic [16, 17] to also include affine linear logic, resulting in a system we call Affine Control logic. A propositional system with six binary connectives is defined and given a phase space interpretation. Choosing classical, intuitionistic or affine reasoning is entirely dependent on the subformula property. Moreover, the connectives of these logics can mix without restriction. We give a sound and complete sequent calculus that requires novel proof transformations for cut elimination. Compared to linear logic, classical fragments of proofs are better isolated from non-classical fragments. One of our goals is to allow non-classical restrictions to coexist with computational interpretations of classical logic such as found in the lambda mu calculus. In fact, we show that the transition between different modes of proof, classical, intuitionistic and affine, can be interpreted by delimited control operators. We also discuss how to extend the definition of focused proofs to this logic.

关键词： linear logic proof theory phase semantics classical logic lambda-mu calculus delimited continuations focusing

来源：评论

学校读者我要写书评

暂无评论

How Good Is a Strategy in a Game With Nature? 15

How Good Is a Strategy in a Game With Nature?

引用

annual acm/ieee symposium on logic in computer science

作者： Carayol, Arnaud Serre, Olivier Univ Paris Est LIGM Champs Sur Marne France CNRS F-75700 Paris France Univ Paris 07 LIAFA F-75221 Paris 05 France

ISBN: (纸本)9781479988754

We consider games with two antagonistic players - Eloise (modelling a program) and Abelard (modelling a byzantine environment) - and a third, unpredictable and uncontrollable player, that we call Nature. Motivated by the fact that the usual probabilistic semantics very quickly leads to undecidability when considering either infinite game graphs or imperfect information, we propose two alternative semantics that leads to decidability where the probabilistic one fails: one based on counting and one based on topology.

关键词： Games Probabilistic logic Semantics Color computer science Probability distribution Topology

来源：评论

学校读者我要写书评

暂无评论

On the Hoare Theory of Monadic Recursion Schemes 14

On the Hoare Theory of Monadic Recursion Schemes

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Mamouras, Konstantinos Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450328869

The equational theory of monadic recursion schemes is known to be decidable by the result of Senizergues on the decidability of the problem of DPDA equivalence. In order to capture some properties of the domain of computation, we augment equations with certain hypotheses. This preserves the decidability of the theory, which we call simple implicational theory. The asymptotically fastest algorithm known for deciding the equational theory, and also for deciding the simple implicational theory, has running time that is non-elementary. We therefore consider a restriction of the properties about schemes to check: instead of arbitrary equations f equivalent to g between schemes, we focus on propositional Hoare assertions {p}f{q}, where f is a scheme and p, q are tests. Such Hoare assertions have a straightforward encoding as equations. We investigate the Hoare theory of monadic recursion schemes, that is, the set of valid implications whose conclusions are Hoare assertions and whose premises are of a certain simple form. We present a sound and complete Hoare-style calculus for this theory. We also show that the Hoare theory can be decided in exponential time, and that it is complete for this class.

关键词： Hoare logic propositional Hoare logic monadic recursion schemes monadic program schemes sound and complete Hoare calculus

来源：评论

学校读者我要写书评

暂无评论

Preservation and decomposition theorems for bounded degree structures 14

Preservation and decomposition theorems for bounded degree s...

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Harwath, Frederik Heimberg, Lucas Schweikardt, Nicole Goethe Univ Frankfurt Main Inst Informat Frankfurt Germany

ISBN: (纸本)9781450328869

We provide elementary algorithms for two preservation theorems for first-order sentences with modulo m counting quantifiers (FO+MODm) on the class C-d of all finite structures of degree at most d: For each FO+MODm-sentence that is preserved under extensions (homomorphisms) on C-d, a C-d-equivalent existential (existential-positive) FO-sentence can be constructed in 6-fold (4-fold) exponential time. For FO-sentences, the algorithm has 5-fold (4-fold) exponential time complexity. This is complemented by lower bounds showing that for FO-sentences a 3-fold exponential blow-up of the computed existential (existential-positive) sentence is unavoidable. Furthermore, we show that for an input FO-formula, a C-d-equivalent Feferman-Vaught decomposition can be computed in 3-fold exponential time. We also provide a matching lower bound.

关键词： computational logic first-order logic modulo counting quantifiers structures of bounded degree Hanf locality elementary algorithms preservation theorems existential preservation homomorphism preservation Los-Tarski Feferman-Vaught

来源：评论

学校读者我要写书评

暂无评论

Pattern logics and Auxiliary Relations 14

Pattern Logics and Auxiliary Relations

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Figueira, Diego Libkin, Leonid Univ Edinburgh Edinburgh Midlothian Scotland

ISBN: (纸本)9781450328869

A common theme in the study of logics over finite structures is adding auxiliary predicates to enhance expressiveness and convey additional information. Examples include adding an order or arithmetic for capturing complexity classes, or the power of real-life declarative languages. A recent trend is to add a data-value comparison relation to words, trees, and graphs, for capturing modern data models such as XML and graph databases. Such additions often result in the loss of good properties of the underlying logic. Our goal is to show that such a loss can be avoided if we use pattern-based logics, standard in XML and graph data querying. The essence of such logics is that auxiliary relations are tested locally with respect to other relations in the structure. These logics are shown to admit strong versions of Hanf and Gaifman locality theorems, which are used to prove a homomorphism preservation theorem, and a decidability result for the satisfiability problem. We discuss applications of these results to pattern logics over data forests, and consequently to querying XML data.

关键词： First-order logic pattern finite model theory locality homomorphism preservation theorem data trees XML decidability

来源：评论

学校读者我要写书评

暂无评论

Faster decision of first-order graph properties 14

Faster decision of first-order graph properties

引用

Joint Meeting of the 23rd EACSL annual Conference on computer science logic (CSL) / 29th annual acm/ieee symposium on logic in computer science (LICS)

作者： Williams, Ryan Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450328869

First-order logic captures a vast number of computational problems on graphs. We study the time complexity of deciding graph properties definable by first-order sentences in prenex normal form with k variables. The trivial algorithm for this problem runs in O(n(k)) time on n-node graphs (the big-O hides the dependence on k). Answering a question of Miklos Ajtai, we give the first algorithms running faster than the trivial algorithm, in the general case of arbitrary first-order sentences and arbitrary graphs. One algorithm runs in O(n(k-3+omega)) <= O(n(k-0.627)) time for all k >= 3, where omega < 2.373 is the n x n matrix multiplication exponent. By applying fast rectangular matrix multiplication, the algorithm can be improved further to run in n(k-1+o(1)) time, for all k >= 9. Finally, we observe that the exponent of k - 1 is optimal, under the popular hypothesis that CNF satisfiability with n variables and m clauses cannot be solved in (2 - epsilon)(n) . poly(m) time for some epsilon > 0.

关键词： first-order logic graph algorithms matrix multiplication satisfiability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共385页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：