2009 24th Annual IEEE Symposium on Logic In Computer Science最新文献

A Unified Sequent Calculus for Focused Proofs 集中证明的统一序贯演算

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

Chuck C. Liang, D. Miller

引用次数: 22

Graph Reachability and Pebble Automata over Infinite Alphabets 无限字母上的图可达性和卵石自动机

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

Tony Tan

引用次数: 25

Graded Computation Tree Logic 分级计算树逻辑

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

A. Bianco, F. Mogavero, A. Murano

{"title":"Graded Computation Tree Logic","authors":"A. Bianco, F. Mogavero, A. Murano","doi":"10.1145/2287718.2287725","DOIUrl":"https://doi.org/10.1145/2287718.2287725","url":null,"abstract":"In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard existential and universal modalities in such a way that they can express statements about a given number of immediately accessible worlds. These modalities have been recently investigated with respect to the mu-calculus, which have provided succinctness, without affecting the satisfiability of the extended logic, i.e., it remains solvable in ExpTime. A natural question that arises is how logics that allow reasoning about paths could be affected by considering graded path modalities. In this paper, we investigate this question in the case of the branching-time temporal logic CTL (GCTL, for short). We prove that, although GCTL is more expressive than CTL, the satisfiability problem for GCTL remains solvable in ExpTime. This result is obtained by exploiting an automata-theoretic approach. In particular, we introduce the class of partitioning alternating Büchi tree automata and show that the emptiness problem for them is ExpTime-Complete. The satisfiability result turns even more interesting as we show that GCTL is exponentially more succinct than graded mu-calculus.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"13 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":"122183615","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}

引用次数: 39

Logics with Rank Operators 逻辑与秩运算符

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

A. Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner

{"title":"Logics with Rank Operators","authors":"A. Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner","doi":"10.1109/LICS.2009.24","DOIUrl":"https://doi.org/10.1109/LICS.2009.24","url":null,"abstract":"We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations of the counting operations in FP+C (i.e. fixed-point logic with counting) that allow us to count the dimension of a definable vector space, rather than just count the cardinality of a definable set. The logics we define have data complexity contained in polynomial time and all known examples of polynomial time queries that are not definable in FP+C are definable in FP+rk, the extension of FP with rank operators. For each prime number p and each positive integer n, we have rank operators rk_p for determining the rank of a matrix over the finite field GF_p defined by a formula over n-tuples. We compare the expressive power of the logics obtained by varying the values p and n can take. In particular, we show that increasing the arity of the operators yields an infinite hierarchy of expressive power. The rank operators are surprisingly expressive, even in the absence of fixed-point operators. We show that FO+rk_p can define deterministic and symmetric transitive closure. This allows us to show that, on ordered structures, FO+rk_p captures the complexity class MOD_pL, for all prime values of p.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"12 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":"130409368","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}

引用次数: 52

Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus 多态对象演算的完全抽象逻辑双相似性

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

Luís Dominguez

引用次数: 0

Psi-calculi: Mobile Processes, Nominal Data, and Logic 微积分:移动过程，标称数据和逻辑

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

Jesper Bengtson, Magnus Johansson, J. Parrow, B. Victor

{"title":"Psi-calculi: Mobile Processes, Nominal Data, and Logic","authors":"Jesper Bengtson, Magnus Johansson, J. Parrow, B. Victor","doi":"10.1109/LICS.2009.20","DOIUrl":"https://doi.org/10.1109/LICS.2009.20","url":null,"abstract":"A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Other proposed extensions of the pi-calculus can be formulated as psi-calculi; examples include the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and a predicate logic for assertions. Our labelled operational semantics and definition of bisimulation is straightforward, without a structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi. The proofs have been checked in the interactive proof checker Isabelle. We are the first to formulate a truly compositional labelled operational semantics for calculi of this calibre. Expressiveness and therefore modelling convenience significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"1 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":"129299817","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}

引用次数: 66

A Logic for PTIME and a Parameterized Halting Problem PTIME与参数化停机问题的逻辑

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1007/978-3-642-15025-8_14

Yijia Chen, J. Flum

引用次数: 20

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience 赢得并发可达性游戏需要双倍的耐心

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

Kristoffer Arnsfelt Hansen, M. Koucký, Peter Bro Miltersen

引用次数: 33

Substructural Operational Semantics as Ordered Logic Programming 有序逻辑规划的子结构操作语义

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

F. Pfenning, R. Simmons

引用次数: 40

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations 具有等价关系的二变量一阶逻辑的有限可满足性

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

Emanuel Kieronski, Lidia Tendera

引用次数: 44