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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

18 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

18 篇 理学
- 18 篇 数学
18 篇 工学
- 18 篇 计算机科学与技术...
- 17 篇 软件工程
- 1 篇 电气工程
- 1 篇 信息与通信工程

主题

4 篇 monadic second-o...
2 篇 model checking
2 篇 finite model the...
1 篇 computer circuit...
1 篇 combinatorics
1 篇 formal logic
1 篇 epistemic logic
1 篇 random graphs
1 篇 infinitary logic...
1 篇 weighted automat...
1 篇 logics for ptime
1 篇 inductive logic
1 篇 formal power ser...
1 篇 z3
1 篇 regular language...
1 篇 second-order log...
1 篇 linear orderings
1 篇 natural deductio...
1 篇 counting functio...
1 篇 relative clause

机构

2 篇 tel aviv univers...
2 篇 univ michigan de...
2 篇 steklov mathemat...
2 篇 tel aviv univ bl...
2 篇 universität des ...
1 篇 microsoft res re...
1 篇 hebrew univ jeru...
1 篇 university of mi...
1 篇 tech univ dortmu...
1 篇 microsoft resear...
1 篇 microsoft resear...
1 篇 humboldt univ d-...
1 篇 hebrew univ jeru...
1 篇 technion israel ...
1 篇 rutgers piscataw...
1 篇 indiana univ dep...
1 篇 univ oxford comp...
1 篇 univ leipzig ins...
1 篇 fudan univ peopl...
1 篇 university of mi...

作者

3 篇 blass andreas
2 篇 rabinovich alexa...
2 篇 chen yijia
2 篇 flum joerg
2 篇 shelah saharon
1 篇 lev d. beklemish...
1 篇 bes alexis
1 篇 andreas blass
1 篇 kotek tomer
1 篇 beklemishev lev ...
1 篇 hodges wilfrid
1 篇 schwentick thoma...
1 篇 nachum dershowit...
1 篇 droste manfred
1 篇 artemov sergei
1 篇 eiter thomas
1 篇 dershowitz nachu...
1 篇 mera sergio
1 篇 moss lawrence s.
1 篇 makowsky johann ...

语言

19 篇 英文

检索条件"任意字段=YuriFest: Symposium on Logic in Computer Science"

共 19 条记录，以下是1-10 订阅

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

详细简洁

排序：

Decidable Expansions of Labelled Linear Orderings

Decidable Expansions of Labelled Linear Orderings

引用

yurifest: symposium on logic in computer science

作者： Bes, Alexis Rabinovich, Alexander Tel Aviv Univ Blavatnik Sch Comp Sci IL-69978 Tel Aviv Israel

Let M = (A, ) where (A, denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type omega or -omega, and the monadic second-order theory of M is decidable, then there ex... 详细信息

ISBN: (纸本)9783642150241

Let M = (A, <, <(P)over bar>) where (A, <) is a linear ordering and <(P)over bar> denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type omega or -omega, and the monadic second-order theory of M is decidable, then there exists a non-trivial expansion M' of M by a monadic predicate such that the monadic second-order theory of M' is still decidable.

关键词： monadic second-order logic decidability definability linear orderings

来源：评论

学校读者我要写书评

暂无评论

Tracking Evidence

Tracking Evidence

引用

yurifest: symposium on logic in computer science

作者： Artemov, Sergei CUNY Grad Ctr New York NY 10016 USA

ISBN: (纸本)9783642150241

In this case study we describe an approach to a general logical framework for tracking evidence within epistemic contexts. We consider as basic an example which features two justifications for a true statement, one which is correct and one which is not. We formalize this example in a system of Justification logic with two knowers: the object agent and the observer, and we show that whereas the object agent does not logically distinguish between factive and non-factive justifications, such distinctions can be attained at the observer level by analyzing the structure of evidence terms. Basic logic properties of the corresponding two-agent Justification logic system have been established, which include Kripke-Fitting completeness. We also argue that a similar evidence-tracking approach can be applied to analyzing paraconsistent systems.

关键词： justification epistemic logic evidence

来源：评论

学校读者我要写书评

暂无评论

Existential Fixed-Point logic, Universal Quantifiers, and Topoi

Existential Fixed-Point Logic, Universal Quantifiers, and To...

引用

yurifest: symposium on logic in computer science

作者： Blass, Andreas Univ Michigan Dept Math Ann Arbor MI 48109 USA

ISBN: (纸本)9783642150241

When one views (multi-sorted) existential fixed-point logic (EFPL) as a database query language, it is natural to extend it by allowing universal quantification over certain sorts. These would be the sorts for which one has the "closed-world" information that all entities of that sort in the real world are represented in the database. We investigate the circumstances under which this extension of EFPL retains various pleasant properties. We pay particular attention to the pleasant property of preservation by the inverse-image parts of geometric morphisms of topoi, because, as we show, this preservation property implies many of the other pleasant properties of EFPL.

关键词： Fixed point logic quantifier topos geometric morphism polynomial time Hoare logic finite model

来源：评论

学校读者我要写书评

暂无评论

Fields of logic and Computation II 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Lev D. Beklemishev Andreas Blass Nachum Dershowitz Bernd Finkbeiner Wolfram Schulte

ISBN: (数字)9783319235349

ISBN: (纸本)9783319235332

This Festschrift is published in honor of Yuri Gurevich's 75th birthday. Yuri Gurevich has made fundamental contributions on the broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these areas are reflected in the 20 articles in this Festschrift and in the presentations at the "yurifest" symposium, which was held in Berlin, Germany, on September 11 and 12, 2015. The yurifest symposium was co-located with the 24th EACSL Annual Conference on computer science logic (CSL 2015).

关键词： Programming Techniques

来源：评论

学校读者我要写书评

暂无评论

logics for Two Fragments beyond the Syllogistic Boundary

Logics for Two Fragments beyond the Syllogistic Boundary

引用

yurifest: symposium on logic in computer science

作者： Moss, Lawrence S. Indiana Univ Dept Math Bloomington IN 47405 USA

ISBN: (纸本)9783642150241

This paper is a contribution to natural logic, the study of logical systems for linguistic reasoning. We construct a system with the following properties: its syntax is closer to that of a natural language than is first-order logic;it can faithfully represent simple sentences with standard quantifiers, subject relative clauses (a recursive construct), and negation on nouns and verbs. We also give a proof system which is complete and has the finite model property. We go further by adding comparative adjective phrases, assuming interpretations by transitive relations. This last system has all the previously-mentioned properties as well. The paper was written for theoretical computer scientists and logicians interested in areas such as decidability questions for fragments of first-order logic, modal logic, and natural deduction.

关键词： natural logic natural deduction relative clause comparative adjective clecidability

来源：评论

学校读者我要写书评

暂无评论

Existential Fixed-Point logic as a Fragment of Second-Order logic

Existential Fixed-Point Logic as a Fragment of Second-Order ...

引用

symposium on logic in computer science Celebrating Yuri Gurevich's 75th Birthday (yurifest)

作者： Blass, Andreas Univ Michigan Dept Math Ann Arbor MI 48109 USA

ISBN: (纸本)9783319235349;9783319235332

The standard translation of existential fixed-point formulas into second-order logic produces strict universal formulas, that is, formulas consisting of universal quantifiers on relations (not functions) followed by an existential first-order formula. This form implies many of the pleasant properties of existential fixed-point logic, but not all. In particular, strict universal sentences can express some co-NP-complete properties of structures, whereas properties expressible by existential fixed-point formulas are always in P. We therefore investigate what additional syntactic properties, beyond strict universality, are enjoyed by the second-order translations of existential fixed-point formulas. In particular, do such syntactic properties account for polynomial-time model-checking?

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

On Failure of 0-1 Laws

On Failure of 0-1 Laws

引用

symposium on logic in computer science Celebrating Yuri Gurevich's 75th Birthday (yurifest)

作者： Shelah, Saharon Hebrew Univ Jerusalem Einstein Inst Math IL-91904 Jerusalem Israel Rutgers State Univ Dept Math Hill Ctr Piscataway NJ 08854 USA

Let alpha is an element of (0, 1)(R) be irrational and G(n) = G(n,1/n alpha) be the random graph with edge probability 1/n(alpha);we know that it satisfies the 0-1 law for first order logic. We deal with the failure o... 详细信息

ISBN: (纸本)9783319235349;9783319235332

关键词： Finite model theory Zero-one laws Random graphs Inductive logic Infinitary logic on finite structures

来源：评论

学校读者我要写书评

暂无评论

An Extension of the Ehrenfeucht-Fraisse Game for First Order logics Augmented with Lindstrom Quantifiers

An Extension of the Ehrenfeucht-Fraisse Game for First Order...

引用

symposium on logic in computer science Celebrating Yuri Gurevich's 75th Birthday (yurifest)

作者： Haber, Simi Shelah, Saharon Bar Ilan Univ IL-5290002 Ramat Gan Israel Hebrew Univ Jerusalem IL-91904 Jerusalem Israel Rutgers Piscataway NJ 08854 USA

We propose an extension of the Ehrenfeucht-Fraisse game able to deal with logics augmented with Lindstrom quantifiers. We describe three different games with varying balance between simplicity and ease of use.

ISBN: (纸本)9783319235349;9783319235332

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

logics for Weighted Timed Pushdown Automata

Logics for Weighted Timed Pushdown Automata

引用

symposium on logic in computer science Celebrating Yuri Gurevich's 75th Birthday (yurifest)

作者： Droste, Manfred Perevoshchikov, Vitaly Univ Leipzig Inst Informat D-04109 Leipzig Germany

ISBN: (纸本)9783319235349;9783319235332

Weighted dense-timed pushdown automata with a timed stack were introduced by Abdulla, Atig and Stenman to model the behavior of real-time recursive systems. Motivated by the decidability of the optimal reachability problem for weighted timed pushdown automata and weighted logic of Droste and Gastin, we introduce a weighted MSO logic on timed words which is expressively equivalent to weighted timed pushdown automata. To show the expressive equivalence result, we prove a decomposition theorem which establishes a connection between weighted timed pushdown languages and visibly pushdown languages of Alur and Mudhusudan;then we apply their result about the logical characterization of visibly pushdown languages.

关键词： Timed automata Weighted automata Monadic second-order logic Weighted logic Formal power series Pushdown automata Timed stack

来源：评论

学校读者我要写书评

暂无评论

Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs

Fixed-Point Definability and Polynomial Time on Chordal Grap...

引用

yurifest: symposium on logic in computer science

作者： Grohe, Martin Humboldt Univ D-1086 Berlin Germany

ISBN: (纸本)9783642150241

The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems in finite model theory and database theory. Partial results have been obtained for specific classes of structures. In particular, it is known that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. The introductory part of this paper is a short survey of the state-of-the-art in the quest for a logic capturing polynomial time. The main part of the paper is concerned with classes of graphs defined by excluding induced subgraphs. Two of the most fundamental such classes are the class of chordal graphs and the class of line graphs. We prove that capturing polynomial time on either of these classes is as hard as capturing it on the class of all graphs. In particular, this implies that fixed-point logic with counting does not capture polynomial time on these classes. Then we prove that fixed-point logic with counting does capture polynomial time on the class of all graphs that are both chordal and line graphs.

关键词： Descriptive complexity theory fixed-point logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：