Proceedings 11th Annual IEEE Symposium on Logic in Computer Science最新文献_第2页

Semantics of normal logic programs and contested information 正常逻辑程序和竞争信息的语义

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561457

Shekhar Pradhan

引用次数: 4

Counting module quantifiers on finite linearly ordered trees 有限线性有序树上的模块量词计数

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561465

Juha Nurmonen

引用次数: 4

Completing partial combinatory algebras with unique head-normal forms 补全具有唯一头范式的部分组合代数

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561461

I. Bethke, J. Klop, R. D. Vrijer

引用次数: 11

Solving linear equations over polynomial semirings 求解多项式半环上的线性方程

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561463

P. Narendran

引用次数: 38

Game semantics and abstract machines 游戏语义和抽象机器

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561456

V. Danos, Hugo Herbelin, L. Regnier

引用次数: 81

Relating word and tree automata 关联词和树自动机

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561360

O. Kupferman, S. Safra, Moshe Y. Vardi

{"title":"Relating word and tree automata","authors":"O. Kupferman, S. Safra, Moshe Y. Vardi","doi":"10.1109/LICS.1996.561360","DOIUrl":"https://doi.org/10.1109/LICS.1996.561360","url":null,"abstract":"In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's, it was known that deterministic Buchi word automata are less expressive than nondeterministic Buchi word automata. The proof is easy and can be stated in a few lines. In the late 60's, Rabin proved that Buchi tree automata are less expressive than Rabin tree automata. This proof is much harder. In this work we relate the expressiveness gap between deterministic and nondeterministic Buchi word automata and the expressiveness gap between Buchi and Rabin tree automata. We consider tree automata that recognize derived languages. For a word language L, the derived language of L, denoted L/spl Delta/, is the set of all trees all of whose paths are in L. Since often we want to specify that all the computations of the program satisfy some property, the interest in derived languages is clear. Our main result shows that L is recognizable by a nondeterministic Buchi word automaton but not by a deterministic Buchi word automaton iff L/spl Delta/ is recognizable by a Rabin tree automaton and not by a Buchi tree automaton. Our result provides a simple explanation to the expressiveness gap between Buchi and Rabin tree automata. Since the gap between deterministic and nondeterministic Buchi word automata is well understood, our result also provides a characterization of derived languages that can be recognized by Buchi tree automata. Finally, it also provides an exponential determinization of Buchi tree automata that recognize derived languages.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128939329","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}

引用次数: 41

Linear logic, monads and the lambda calculus 线性逻辑，单子和微积分

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561458

Nick Benton, P. Wadler

引用次数: 121

An Until hierarchy for temporal logic 时间逻辑的Until层次结构

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561310

K. Etessami, T. Wilke

{"title":"An Until hierarchy for temporal logic","authors":"K. Etessami, T. Wilke","doi":"10.1109/LICS.1996.561310","DOIUrl":"https://doi.org/10.1109/LICS.1996.561310","url":null,"abstract":"We prove there is a strict hierarchy of expressive power according to the Until depth of linear temporal logic (TL) formulas: for each k, there is a very natural property that is not expressible with k nestings of Until operators, regardless of the number of applications of other operators, but is expressible by a formula with Until depth k+1. Our proof uses a new Ehrenfeucht-Fraisse (EF) game designed specifically for TL. These properties can all be expressed in first-order logic with quantifier depth and size O(log k), and we use them to observe some interesting relationships between TL and first-order expressibility. We then use the EF game in a novel way to effectively characterize (1) the TL properties expressible without Until, as well as (2) those expressible without both Until and Next. By playing the game \"on finite automata\", we prove that the automata recognizing languages expressible in each of the two fragments have distinctive structural properties. The characterization for the first fragment was originally proved by Cohen, Perrin, and Pin (1993) using sophisticated semigroup-theoretic techniques. They asked whether such a characterization exists for the second fragment. The technique we develop is general and can potentially be applied in other contexts.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120944741","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}

引用次数: 51

On the structure of queries in constraint query languages 约束查询语言中查询的结构

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561300

Michael Benedikt, L. Libkin

引用次数: 46

Decidability problems for the prenex fragment of intuitionistic logic 直觉逻辑前缀片段的可决性问题

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561467

A. Degtyarev, A. Voronkov

引用次数: 31