2009 24th Annual IEEE Symposium on Logic In Computer Science最新文献_第3页

Combining Ehrenfeucht-Fraïssé Games 结合ehrenfeucht - fraisse游戏

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.50

B. Rossman

引用次数: 0

Computation and the Periodic Table 计算与元素周期表

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.43

J. Baez

引用次数: 0

Applications of Game Semantics: From Program Analysis to Hardware Synthesis 游戏语义的应用:从程序分析到硬件综合

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.26

D. Ghica

引用次数: 36

The Complexity of Positive First-order Logic without Equality 不相等的正一阶逻辑的复杂性

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1145/2071368.2071373

B. Martin, Jos Martin

引用次数: 11

Clipping: A Semantics-Directed Syntactic Approximation 裁剪:语义导向的句法近似

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.25

D. Ghica, Adam Bakewell

引用次数: 7

Qualitative Determinacy and Decidability of Stochastic Games with Signals 带有信号的随机对策的定性确定性和可判决性

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1145/3107926

N. Bertrand, B. Genest, H. Gimbert

{"title":"Qualitative Determinacy and Decidability of Stochastic Games with Signals","authors":"N. Bertrand, B. Genest, H. Gimbert","doi":"10.1145/3107926","DOIUrl":"https://doi.org/10.1145/3107926","url":null,"abstract":"We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, Buchi or co-Buchi winning objectives. We prove two qualitative determinacy results. First, in a reachability game either player $1$ can achieve almost-surely the reachability objective, or player 2 can ensure surely the complementary safety objective, or both players have positively winning strategies. Second, in a Buchi game if player 1 cannot achieve almost-surely the Buchi objective, then player 2 can ensure positively the complementary co-Buchi objective. We prove that players only need strategies with finite-memory, whose sizes range from no memory at all to doubly-exponential number of states, with matching lower bounds. Together with the qualitative determinacy results, we also provide fix-point algorithms for deciding which player has an almost-surely winning or a positively winning strategy and for computing the finite memory strategy. Complexity ranges from EXPTIME to 2-EXPTIME with matching lower bounds, and better complexity can be achieved for some special cases where one of the players is better informed than her opponent.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"2005 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125618258","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}

引用次数: 63

The Structure of First-Order Causality 一阶因果关系的结构

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.19

S. Mimram

{"title":"The Structure of First-Order Causality","authors":"S. Mimram","doi":"10.1109/LICS.2009.19","DOIUrl":"https://doi.org/10.1109/LICS.2009.19","url":null,"abstract":"Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order propositional logic. One of the main difficulties that has to be faced during the elaboration of this kind of semantics is to characterize definable strategies, that is strategies which actually behave like a proof. This is usually done by restricting the model to strategies satisfying subtle combinatorial conditions, whose preservation under composition is often difficult to show. Here, we present an original methodology to achieve this task, which requires to combine advanced tools from game semantics, rewriting theory and categorical algebra. We introduce a diagrammatic presentation of the monoidal category of definable strategies of our model, by the means of generators and relations: those strategies can be generated from a finite set of atomic strategies and the equality between strategies admits a finite axiomatization, this equational structure corresponding to a polarized variation of the notion of bialgebra. This work thus bridges algebra and denotational semantics in order to reveal the structure of dependencies induced by first-order quantifiers, and lays the foundations for a mechanized analysis of causality in programming languages.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134242827","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

Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications 基于时间自动机规范的连续时间马尔可夫链的定量模型检验

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.2168/LMCS-7(1:12)2011

Taolue Chen, Tingting Han, J. Katoen, A. Mereacre

引用次数: 124

An Improved Lower Bound for the Complementation of Rabin Automata Rabin自动机互补的改进下界

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.13

Yang Cai, Ting Zhang, Haifeng Luo

引用次数: 11

Functional Reachability 功能可达性

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.48

C. Ong, N. Tzevelekos

引用次数: 10