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

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
Linear higher-order pre-unification 线性高阶预统一
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614967
I. Cervesato, F. Pfenning
{"title":"Linear higher-order pre-unification","authors":"I. Cervesato, F. Pfenning","doi":"10.1109/LICS.1997.614967","DOIUrl":"https://doi.org/10.1109/LICS.1997.614967","url":null,"abstract":"We develop an efficient representation and a pre-unification algorithm in the style of Huet (1975) for the linear /spl lambda/-calculus /spl lambda//sup /spl rarr//spl rArr/0&T/ which includes intuitionistic functions (/spl rarr/), linear functions (/spl rArr/), additive pairing (&), and additive unit (T). Applications lie in proof scorch, logic programming, and logical frameworks based on linear type theories. We also show that, surprisingly, a similar pre-unification algorithm does not exist for certain sublanguages.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"5 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":"122562317","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}
引用次数: 22
Towards a mathematical operational semantics 走向数学运算语义
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/lics.1997.614955
D. Turi, G. Plotkin
{"title":"Towards a mathematical operational semantics","authors":"D. Turi, G. Plotkin","doi":"10.1109/lics.1997.614955","DOIUrl":"https://doi.org/10.1109/lics.1997.614955","url":null,"abstract":"We present a categorical theory of 'well-behaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets the following for free: an operational model satisfying the rules and a canonical, internally fully abstract denotational model which satisfies the operational rules. The theory is based on distributive laws and bialgebras; it specialises to the known classes of well-behaved rules for structural operational semantics, such as GSOS.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"132 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":"116624821","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}
引用次数: 407
Quantitative analysis and model checking 定量分析和模型检验
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614940
M. Huth, M. Kwiatkowska
{"title":"Quantitative analysis and model checking","authors":"M. Huth, M. Kwiatkowska","doi":"10.1109/LICS.1997.614940","DOIUrl":"https://doi.org/10.1109/LICS.1997.614940","url":null,"abstract":"Many notions of models in computer science provide quantitative information, or uncertainties, which necessitate a quantitative model checking paradigm. We present such a framework for reactive and generative systems based on a non-standard interpretation of the modal mu-calculus, where /spl mu/x./spl phi//vx./spl phi/ are interpreted as least/greatest fired points over the infinite lattice of maps from states to the unit interval. By letting formulas denote lower bounds of probabilistic evidence of properties, the values computed by our quantitative model checker can serve as satisfactory correctness guarantees in cases where conventional qualitative model checking fails. Since fixed point iteration in this infinite domain is computationally unfeasible, we establish that the computation of fixed points may be restated as a conventional, and on average efficient, optimization problem in linear programming; this holds for a fragment of the modal mu-calculus which subsumes CTL. Our semantics induces a state equivalence which is strictly in between probabilistic bisimulation and probabilistic ready bisimulation.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"112 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":"129125896","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}
引用次数: 156
Complexity of power default reasoning 权力默认推理的复杂性
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614959
Guo-Qiang Zhang, W. Rounds
{"title":"Complexity of power default reasoning","authors":"Guo-Qiang Zhang, W. Rounds","doi":"10.1109/LICS.1997.614959","DOIUrl":"https://doi.org/10.1109/LICS.1997.614959","url":null,"abstract":"This paper derives a new and surprisingly low complexity result for inference in a new form of Reiter's propositional default logic (1980). The problem studied here is the default inference problem whose fundamental importance was pointed out by Kraus, Lehmann, and Magidor (1980). We prove that \"normal\" default inference, in propositional logic, is a problem complete for co-NP(3), the third level of the Boolean hierarchy. Our result (by changing the underlying semantics) contrasts favorably with a similar result of Gottlob (1992), who proves that standard default inference is II/sub 2//sup P/-complete. Our inference relation also obeys all of the laws for preferential consequence relations set forth by Kraus, Lehmann, and Magidor (1990). In particular we get the property of being able to reason by cases and the law of cautious monotony. Both of these laws fail for standard propositional default logic. The key technique for our results is the use of Scott's domain theory to integrate defaults into partial model theory of the logic, instead of keeping defaults as quasiproof rules in the syntax. In particular, reasoning disjunctively entails using the Smyth powerdomain.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"1 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":"129972049","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}
引用次数: 15
The monadic quantifier alternation hierarchy over graphs is infinite 图上一元量词的交替层次是无限的
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614951
O. Matz, W. Thomas
{"title":"The monadic quantifier alternation hierarchy over graphs is infinite","authors":"O. Matz, W. Thomas","doi":"10.1109/LICS.1997.614951","DOIUrl":"https://doi.org/10.1109/LICS.1997.614951","url":null,"abstract":"We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas. thus, the \"monadic analogue\" of the polynomial hierarchy is found to be strict, which solves a problem of Fagin. The proof is based on automata theoretic concepts (rather than Ehrenfeucht-Fraisse games) and starts from a restricted class of graph-like structures, namely finite two-dimensional grids. We investigate monadic second-order definable sets of grids where the width of grids is a function of the height. In this context, the infiniteness of the quantifier alternation hierarchy is witnessed by n-fold exponential functions for increasing n. It is notable that these witness sets of the monadic hierarchy all belong to the complexity class NP, the first level of the polynomial hierarchy.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"86 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":"116093613","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}
引用次数: 47
Games and definability for system F 系统F的对策与可定义性
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614935
Dominic J. D. Hughes
{"title":"Games and definability for system F","authors":"Dominic J. D. Hughes","doi":"10.1109/LICS.1997.614935","DOIUrl":"https://doi.org/10.1109/LICS.1997.614935","url":null,"abstract":"We develop a game-theoretic model of the polymorphic /spl lambda/-calculus, system F, as a fibred category F. Our main result is that every morphism /spl sigma/ of the model defines a normal form s/sub /spl sigma// of system F, whose interpretation is /spl sigma/. Thus the model gives a precise, non-syntactic account of the calculus.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"47 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":"122409895","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}
引用次数: 31
Unique fixpoint induction for value-passing processes 值传递过程的唯一不动点归纳
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614942
J. Rathke
{"title":"Unique fixpoint induction for value-passing processes","authors":"J. Rathke","doi":"10.1109/LICS.1997.614942","DOIUrl":"https://doi.org/10.1109/LICS.1997.614942","url":null,"abstract":"We investigate the use of unique fixpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique fixpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new, generalised, rule is shown to be derivable from existing formulations of unique fixpoint induction for value-passing calculi, thereby providing original completeness results. An example of the use of this new rule is presented in detail.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"10 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":"115154890","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}
引用次数: 11
Complete cuboidal sets in axiomatic domain theory 公理化领域理论中的完全立方集
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614954
M. Fiore, G. Plotkin, J. Power
{"title":"Complete cuboidal sets in axiomatic domain theory","authors":"M. Fiore, G. Plotkin, J. Power","doi":"10.1109/LICS.1997.614954","DOIUrl":"https://doi.org/10.1109/LICS.1997.614954","url":null,"abstract":"We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, via, that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"1 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":"132190620","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}
引用次数: 28
Automata-driven automated induction 自动驱动的自动感应
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614920
A. Bouhoula, J. Jouannaud
{"title":"Automata-driven automated induction","authors":"A. Bouhoula, J. Jouannaud","doi":"10.1109/LICS.1997.614920","DOIUrl":"https://doi.org/10.1109/LICS.1997.614920","url":null,"abstract":"This work investigates inductive theorem proving techniques for first-order functions whose meaning and domains can be specified by Horn Clauses built up from the equality and finitely many unary membership predicates. In contrast with other works in the area, constructors are not assumed to be free. Techniques originating from tree automata are used to describe ground constructor terms in normal form, on which the induction proofs are built up. Validity of (free) constructor clauses is checked by on original technique relying on the recent discovery of a complete axiomatisation of finite trees and their rational subsets. Validity of clauses with defined symbols or non-free constructor terms is reduced to the latter case by appropriate inference rules using a notion of ground reducibility for these symbols. We show how to check this property by generating proof obligations which can be passed over to the inductive prover.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"39 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":"116196105","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
Full abstraction for functional languages with control 具有控制的函数式语言的完全抽象
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI: 10.1109/LICS.1997.614931
J. Laird
{"title":"Full abstraction for functional languages with control","authors":"J. Laird","doi":"10.1109/LICS.1997.614931","DOIUrl":"https://doi.org/10.1109/LICS.1997.614931","url":null,"abstract":"This paper considers the consequences of relaxing the bracketing condition on 'dialogue games', showing that this leads to a category of games which can be 'factorized' into a well-bracketed substructure, and a set of classically typed morphisms. These are shown to be sound denotations for control operators, allowing the factorization to be used to extend the definability result for PCF to one for PCF with control operators at atomic types. Thus we define a fully abstract and effectively presentable model of a functional language with non-local control as part of a modular approach to modelling non-functional features using games.","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"30 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":"121231200","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}
引用次数: 149
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信