Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science最新文献_第4页

Ramified higher-order unification 分支高阶统一

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614966

J. Goubault-Larrecq

引用次数: 1

The complexity of subtype entailment for simple types 简单类型的子类型蕴涵的复杂性

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614961

F. Henglein, J. Rehof

{"title":"The complexity of subtype entailment for simple types","authors":"F. Henglein, J. Rehof","doi":"10.1109/LICS.1997.614961","DOIUrl":"https://doi.org/10.1109/LICS.1997.614961","url":null,"abstract":"A subtyping /spl tau//spl les//spl tau/' is entailed by a set of subtyping constraints C, written C |=/spl tau//spl les//spl tau/', if every valuation (mapping of type variables to ground types) that satisfies C also satisfies /spl tau//spl les//spl tau/'. We study the complexity of subtype entailment for simple types over lattices of base types. We show that: deciding C |=/spl tau//spl les//spl tau/' is coNP-complete; deciding C |=/spl alpha//spl les//spl beta/ for consistent, atomic C and /spl alpha/, /spl beta/ atomic can be done in linear time. The structural lower (coNP-hardness) and upper (membership in coNP) bounds as well as the optimal algorithm for atomic entailment are new. The coNP-hardness result indicates that entailment is strictly harder than satisfiability, which is known to be in PTIME for lattices of base types. The proof of coNP-completeness gives an improved algorithm for deciding entailment and puts a precise complexity-theoretic marker on the intuitive \"exponential explosion\" in the algorithm. Central to our results is a novel characterization of C |=/spl alpha//spl les//spl beta/ for atomic, consistent C. This is the basis for correctness of the linear-time algorithm as well as a complete axiomatization of C |=/spl alpha//spl les//spl beta/ for atomic C by extending the usual proof rules for subtype inference. It also incorporates the fundamental insight for understanding the structural complexity bounds in the general case.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127931648","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}

引用次数: 45

Induction and recursion on the partial real line via biquotients of bifree algebras 三自由度代数双商在部分实线上的归纳法与递推法

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614963

M. Escardó, T. Streicher

引用次数: 4

A relational account of call-by-value sequentiality 按值调用顺序的关系描述

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-11 DOI: 10.1109/LICS.1997.614953

J. Riecke, Anders Sandholm

引用次数: 36

Bisimulation for labelled Markov processes 标记马尔可夫过程的双模拟

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-01-04 DOI: 10.1109/LICS.1997.614943

R. Blute, Josée Desharnais, A. Edalat, P. Panangaden

{"title":"Bisimulation for labelled Markov processes","authors":"R. Blute, Josée Desharnais, A. Edalat, P. Panangaden","doi":"10.1109/LICS.1997.614943","DOIUrl":"https://doi.org/10.1109/LICS.1997.614943","url":null,"abstract":"In this paper we introduce a new class of labelled transition systems-Labelled Markov Processes-and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space). The mathematical theory of such systems is completely new from the point of view of the extant literature on probabilistic process algebra; of course, it uses classical ideas from measure theory and Markov process theory. The notion of bisimulation builds on the ideas of Larsen and Skou and of Joyal, Nielsen and Winskel. The main result that we prove is that a notion of bisimulation for Markov processes on Polish spaces, which extends the Larsen-Skou definition for discrete systems, is indeed an equivalence relation. This turns our to be a rather hard mathematical result which, as far as we know, embodies a new result in pure probability theory. This work heavily uses continuous mathematics which is becoming an important part of work on hybrid systems.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191848","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}

引用次数: 328

An expressively complete linear time temporal logic for Mazurkiewicz traces 马祖凯维奇迹的表达完备线性时间时间逻辑

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-12-02 DOI: 10.1109/LICS.1997.614946

P. Thiagarajan, I. Walukiewicz

引用次数: 105

On the complexity of reasoning in Kleene algebra 论Kleene代数中推理的复杂性

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1900-01-01 DOI: 10.1109/LICS.1997.614947

D. Kozen

引用次数: 50