2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第2页

Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? 为什么难以获得一致查询回答的二分法?

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.62

G. Fontaine

引用次数: 26

Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness 区间逻辑ABB的一个等价关系:复杂性和可表达性

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.25

A. Montanari, P. Sala

引用次数: 12

From Monadic Second-Order Definable String Transformations to Transducers 从一元二阶可定义字符串变换到换能器

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.52

R. Alur, Antoine Durand-Gasselin, Ashutosh Trivedi

{"title":"From Monadic Second-Order Definable String Transformations to Transducers","authors":"R. Alur, Antoine Durand-Gasselin, Ashutosh Trivedi","doi":"10.1109/LICS.2013.52","DOIUrl":"https://doi.org/10.1109/LICS.2013.52","url":null,"abstract":"Courcelle (1992) proposed the idea of using logic, in particular Monadic second-order logic (MSO), to define graph to graph transformations. Transducers, on the other hand, are executable machine models to define transformations, and are typically studied in the context of string-to-string transformations. Engelfriet and Hoogeboom (2001) studied two-way finite state string-to-string transducers and showed that their expressiveness matches MSO-definable transformations (MSOT). Alur and Cerny (2011) presented streaming transducers-one-way transducers equipped with multiple registers that can store output strings, as an equi-expressive model. Natural generalizations of streaming transducers to string-to-tree (Alur and D'Antoni, 2012) and infinite-string-to-string (Alur, Filiot, and Trivedi, 2012) cases preserve MSO-expressiveness. While earlier reductions from MSOT to streaming transducers used two-way transducers as the intermediate model, we revisit the earlier reductions in a more general, and previously unexplored, setting of infinite-string-to-tree transformations, and provide a direct reduction. Proof techniques used for this new reduction exploit the conceptual tools (composition theorem and finite additive coloring theorem) presented by Shelah (1975) in his alternative proof of Bϋchi's theorem. Using such streaming string-to-tree transducers we show the decidability of functional equivalence for MSO-definable infinite-string-to-tree transducers.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117307462","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}

引用次数: 13

Arbitrary Action Model Logic and Action Model Synthesis 任意动作模型逻辑和动作模型综合

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.31

James Hales

引用次数: 27

Regular Real Analysis 常规实数分析

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.57

Swarat Chaudhuri, S. Sankaranarayanan, Moshe Y. Vardi

引用次数: 14

Name-Passing Calculi: From Fusions to Preorders and Types 名字传递演算:从融合到预订和类型

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.44

D. Hirschkoff, Jean-Marie Madiot, D. Sangiorgi

引用次数: 9

Duality in Logic and Computation 逻辑和计算中的对偶性

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.64

P. Panangaden

引用次数: 4

Type-Based Productivity of Stream Definitions in the Calculus of Constructions 构造演算中流定义的基于类型的生产力

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.29

J. Sacchini

引用次数: 35

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic 多元多态代数理论:句法、语义、翻译和等式逻辑

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.59

M. Fiore, M. Hamana

{"title":"Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic","authors":"M. Fiore, M. Hamana","doi":"10.1109/LICS.2013.59","DOIUrl":"https://doi.org/10.1109/LICS.2013.59","url":null,"abstract":"We formalise and study the notion of polymorphic algebraic theory, as understood in the mathematical vernacular as a theory presented by equations between polymorphically-typed terms with both type and term variable binding. The prototypical example of a polymorphic algebraic theory is System F, but our framework applies more widely. The extra generality stems from a mathematical analysis that has led to a unified theory of polymorphic algebraic theories with the following ingredients: ; polymorphic signatures that specify arbitrary polymorphic operators (e.g. as in extended λ-calculi and algebraic effects); ; metavariables, both for types and terms, that enable the generic description of meta-theories; ; multiple type universes that allow a notion of translation between theories that is parametric over different type universes; ; polymorphic structures that provide a general notion of algebraic model (including the PL-category semantics of System F); ; a Polymorphic Equational Logic that constitutes a sound and complete logical framework for equational reasoning. Our work is semantically driven, being based on a hierarchical two-levelled algebraic modelling of abstract syntax with variable binding.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132604314","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}

引用次数: 21

On the Boundary of Behavioral Strategies 论行为策略的边界

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.32

F. Mogavero, A. Murano, L. Sauro

{"title":"On the Boundary of Behavioral Strategies","authors":"F. Mogavero, A. Murano, L. Sauro","doi":"10.1109/LICS.2013.32","DOIUrl":"https://doi.org/10.1109/LICS.2013.32","url":null,"abstract":"In the setting of multi-agent games, considerable effort has been devoted to the definition of modal logics for strategic reasoning. In this area, a recent contribution is given by the introduction of Strategy Logic (SL, for short) by Mogavero, Murano, and Vardi. This logic allows to reason explicitly about strategies as first order objects and express in a very natural and elegant way several solution concepts like Nash, resilient, and secure equilibria, dominant strategies, etc. The price that one has to pay for the high expressiveness of SL semantics is that agents strategies it admits may be not behavioral, i.e., a choice of an agent, at a given moment of a play, may depend on the choices another agent can make in another counterfactual play. As the latter moves are unpredictable, this kind of strategies cannot be synthesized in practice. In this paper, we investigate two syntactical fragments of SL, namely the conjunctive-goal and disjunctive-goal, called SL[CG] and SL[DG] for short, and prove that their semantics admit behavioral strategies only. These logics are obtained by forcing SL formulas to be only of the form of conjunctions or disjunctions of goals, which are temporal assertions associated with a binding of agents with strategies. As SL formulas with any Boolean combination of goals turn out to be non behavioral, we have that SL[CG] and SL[DG] represent the maximal fragments of SL describing agent behaviors that are synthesizable. As a consequence of the above results, the model-checking problem for both SL[CG] and SL[DG] is shown to be solvable in 2EXPTIME, as it is for the subsumed logic ATL*.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916415","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}

引用次数: 33