18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.最新文献_第2页

Spectra of monadic second-order formulas with one unary function 一类一元函数一元二阶公式的谱

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210069

Y. Gurevich, S. Shelah

引用次数: 27

Logical definability and query languages over unranked trees 逻辑可定义性和未排序树上的查询语言

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210057

L. Libkin, F. Neven

{"title":"Logical definability and query languages over unranked trees","authors":"L. Libkin, F. Neven","doi":"10.1109/LICS.2003.1210057","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210057","url":null,"abstract":"Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention, primarily as an abstraction of XML (Extensible Markup Language) documents. In this paper, we study logical definability over unranked trees, as well as collections of unranked trees, that can be viewed as databases of XML documents. The traditional approach to definability is to view each tree as a structure of a fixed vocabulary, and study the expressive power of various logics on trees. A different approach, based on model theory, considers a structure whose universe is the set of all trees, and studies definable sets and relations; this approach extends smoothly to the setting of definability over collections of trees. We study the latter, model-theoretic approach. We find sets of operations on unranked trees that define regular tree languages, and show that some natural restrictions correspond to logics studied in the context of XML pattern languages. We then look at relational calculi over collections of unranked trees, and obtain quantifier-restriction results that give us bounds on the expressive power and complexity. As unrestricted relational calculi can express problems complete for each level of the polynomial hierarchy, we look at their restrictions, corresponding and find several calculi with low (NC/sup 1/) data complexity that can express important XML properties like DTD validation and XPath evaluation.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Types and programming languages: the next generation 类型和编程语言:下一代

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210042

B. Pierce

{"title":"Types and programming languages: the next generation","authors":"B. Pierce","doi":"10.1109/LICS.2003.1210042","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210042","url":null,"abstract":"Summary form only given. This tutorial surveys the state of the art in type systems for programming languages, focusing on the achievements and changes in emphasis during the past decade. The first part of the talk considers the trajectory of work on object types, one of the major hot topics of the early and mid-'90s. Following some fundamental conceptual breakthroughs, the focus of attention in this area has shifted from foundational research to applications to the development and analysis of real-world language designs. The next part outlines recent progress on a number of \"bread and butter\" type systems topics and their applications in new programming languages: subtyping, polymorphism, type inference, effect systems, dependent types, and type systems for modular programming. The final section introduces some newer topics that have emerged (or gained unexpected prominence) in the past few years, including type systems for concurrent and distributed languages, high-level type systems for low-level languages such as assembly and C, substructural type systems based on linear logic and its relatives, modal type systems, the burgeoning area of language-based security, and native language support for statistically typed XML processing.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134344122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Abstract saturation-based inference 抽象的基于饱和的推理

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210046

N. Dershowitz, C. Kirchner

引用次数: 15

New directions in instantiation-based theorem proving 基于实例的定理证明新方向

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210045

H. Ganzinger, Konstantin Korovin

引用次数: 140

Reasoning about hierarchical storage 关于分层存储的推理

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210043

Amal J. Ahmed, Limin Jia, D. Walker

引用次数: 36

Dependent intersection: a new way of defining records in type theory 依赖交集:类型论中定义记录的一种新方法

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210048

Alexei Kopylov

引用次数: 64

System ST /spl beta/-reduction and completeness 系统ST /spl beta/-降低和完整性

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210041

Christophe Raffalli

引用次数: 1

Strong bisimilarity on basic parallel processes in PSPACE-complete pspace完备中基本并行过程的强双相似性

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210061

P. Jančar

引用次数: 71

Homomorphism closed vs. existential positive 同态封闭vs存在积极

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210071

T. Feder, Moshe Y. Vardi

引用次数: 43