发布求助
文献互助 智能选刊 最新文献

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
More about recursive structures: descriptive complexity and zero-one laws 更多关于递归结构:描述复杂性和0 - 1定律
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561361
T. Hirst, D. Harel
{"title":"More about recursive structures: descriptive complexity and zero-one laws","authors":"T. Hirst, D. Harel","doi":"10.1109/LICS.1996.561361","DOIUrl":"https://doi.org/10.1109/LICS.1996.561361","url":null,"abstract":"This paper continues our work on infinite, recursive structures. We investigate the descriptive complexity of several logics over recursive structures, including first-order, second-order, and fixpoint logic, exhibiting connections between expressibility of a property and its computational complexity. We then address 0-1 laws, proposing a version that applies to recursive structures and using it to prove several non-expressibility results.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"201 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":"115994157","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}
引用次数: 9
Confluence and preservation of strong normalisation in an explicit substitutions calculus 显式替换演算中强归一化的融合与保存
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561460
C. Muñoz
{"title":"Confluence and preservation of strong normalisation in an explicit substitutions calculus","authors":"C. Muñoz","doi":"10.1109/LICS.1996.561460","DOIUrl":"https://doi.org/10.1109/LICS.1996.561460","url":null,"abstract":"Explicit substitutions calculi are formal systems that implement /spl beta/-reduction by means of an internal substitution operator. In that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. The /spl lambda//sub /spl sigma//-calculus of explicit substitutions, proposed by M. Abadi et al. (1991), is a first-order rewriting system that implements substitution and renaming mechanism of /spl lambda/-calculus. However; /spl lambda//sub /spl sigma// does not preserve strong normalisation of /spl lambda/-calculus and it is not a confluent system. Typed variants of /spl lambda//sub /spl sigma// without composition are strongly normalising but not confluent, while variants with composition are confluent but do not preserve strong normalisation. Neither of them enjoys both properties. In this paper we propose the /spl lambda//sub /spl zeta//-calculus. This is, as far as we know, the first confluent calculus of explicit substitutions that preserves strong normalisation.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"1230 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":"116451303","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}
引用次数: 50
A modal /spl mu/-calculus for durational transition systems 持续过渡系统的模态/spl mu/-演算
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561312
Helmut Seidl
{"title":"A modal /spl mu/-calculus for durational transition systems","authors":"Helmut Seidl","doi":"10.1109/LICS.1996.561312","DOIUrl":"https://doi.org/10.1109/LICS.1996.561312","url":null,"abstract":"Durational transition systems are finite transition systems where every transition is additionally equipped with a duration. We consider the problem of interpreting /spl mu/-formulas over durational transition systems. In case the formula contains only operations minimum, maximum, addition, and sequencing, we show that the interpretation ist not only computable but (up to a linear factor) as efficiently computable as the interpretation of /spl mu/-formulas over ordinary finite transition systems.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"12 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":"117073354","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}
引用次数: 3
On the complexity of abduction 关于绑架的复杂性
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561468
V. Marek, A. Nerode, J. Remmel
{"title":"On the complexity of abduction","authors":"V. Marek, A. Nerode, J. Remmel","doi":"10.1109/LICS.1996.561468","DOIUrl":"https://doi.org/10.1109/LICS.1996.561468","url":null,"abstract":"In this paper we consider the complexity of the existence problem for explanations and for minimal explanations for abductive frameworks based on finite predicate programs. We find that although, in general, the problem is very complex, there are classes of frameworks for which the problem is much simpler.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"63 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":"127836042","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}
引用次数: 6
Partial-order methods for model checking: from linear time to branching time 模型检验的部分阶方法:从线性时间到分支时间
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI: 10.1109/LICS.1996.561357
Bernard Willems, P. Wolper
{"title":"Partial-order methods for model checking: from linear time to branching time","authors":"Bernard Willems, P. Wolper","doi":"10.1109/LICS.1996.561357","DOIUrl":"https://doi.org/10.1109/LICS.1996.561357","url":null,"abstract":"Partial-order methods make it possible to check properties of a concurrent system by state-space exploration without considering all interleavings of independent concurrent events. They have been applied to linear-time model checking, but so far only limited results are known about their applicability to branching-time model checking. In this paper, we introduce a general technique for lifting partial-order methods from linear-time to branching-time logics. This technique is shown to be applicable both to reductions that are applied to the structure representing the program before running the model checking procedure, as well as to reductions that can be obtained when model checking is done in an automata-theoretic framework. The latter are extended to branching-time logics by using the model-checking framework based on alternating automata introduced by O. Bernholtz et al. (1994).","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"76 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":"128593250","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}
引用次数: 43
A temporal-logic approach to binding-time analysis 绑定时间分析的时间逻辑方法
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1995-06-21 DOI: 10.1109/LICS.1996.561317
Rowan Davies
{"title":"A temporal-logic approach to binding-time analysis","authors":"Rowan Davies","doi":"10.1109/LICS.1996.561317","DOIUrl":"https://doi.org/10.1109/LICS.1996.561317","url":null,"abstract":"The Curry-Howard isomorphism identifies proofs with typed /spl lambda/-calculus terms, and correspondingly identifies propositions with types. We show how this isomorphism can be extended to relate constructive temporal logic with binding-time analysis. In particular we show how to extend the Curry-Howard isomorphism to include the O (\"next\") operator from linear-time temporal logic. This yields the simply typed /spl lambda//sup O/-calculus which we prove to be equivalent to a multi-level binding-time analysis like those used in partial evaluation for functional programming languages. Further, we prove that normalization in /spl lambda//sup O/ can be done in an order corresponding to the times in the logic, which explains why /spl lambda//sup O/ is relevant to partial evaluation. We then extend /spl lambda//sup O/ to a small functional language, Mini-ML/sup O/, and give an operational semantics for it. Finally, we prove that this operational semantics correctly reflects the binding-times in the language, a theorem which is the functional programming analog of time-ordered normalization.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133653210","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}
引用次数: 203
A fully-abstract model for the /spl pi/-calculus /spl pi/-微积分的完全抽象模型
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1900-01-01 DOI: 10.1109/LICS.1996.561302
M. Fiore, E. Moggi, D. Sangiorgi
{"title":"A fully-abstract model for the /spl pi/-calculus","authors":"M. Fiore, E. Moggi, D. Sangiorgi","doi":"10.1109/LICS.1996.561302","DOIUrl":"https://doi.org/10.1109/LICS.1996.561302","url":null,"abstract":"This paper provides both a fully abstract (domain-theoretic) model for the /spl pi/-calculus and a universal (set-theoretic) model for the finite /spl pi/-calculus with respect to strong late bisimulation and congruence. This is done by: considering categorical models, defining a metalanguage for these models, and translating the /spl pi/-calculus into the metalanguage. A technical novelty of our approach is an abstract proof of full abstraction: The result on full abstraction for the finite /spl pi/-calculus in the set-theoretic model is axiomatically extended to the whole /spl pi/-calculus with respect to the domain-theoretic interpretation. In this proof, a central role is played by the description of non-determinism as a free construction and by the equational theory of the metalanguage.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209477","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}
引用次数: 16
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信