[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science最新文献_第2页

An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules 命令式高阶框架规则的观察完全程序逻辑

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2005-01-01 DOI: 10.1109/LICS.2005.5

Kohei Honda, N. Yoshida, Martin Berger

引用次数: 7

VTC circ: A Second-Order Theory for TCcirc VTC circ: tcirc的二阶理论

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-07-13 DOI: 10.1109/LICS.2004.1319632

Phuong Nguyen, S. Cook

{"title":"VTC circ: A Second-Order Theory for TCcirc","authors":"Phuong Nguyen, S. Cook","doi":"10.1109/LICS.2004.1319632","DOIUrl":"https://doi.org/10.1109/LICS.2004.1319632","url":null,"abstract":"We introduce a finitely axiomatizable second-order theory, which is VTC/sup 0/ associated with the class FO-uniform TC/sup 0/. It consists of the base theory V/sup 0/ for AC/sup 0/ reasoning together with the axiom NUMONES, which states the existence of a \"counting array\" Y for any string X: the ith row of Y contains only the number of 1 bits up to (excluding) bit i of X. We introduce the notion of \"strong /spl Delta//sub 1//sup B/-definability\" for relations in a theory, and use a recursive characterization of the TC/sup 0/ relations (rather than functions) to show that the TC/sup 0/ relations are strongly /spl Delta//sub 1//sup B/-definable. It follows that the TC/sup 0/ functions are /spl Sigma//sub 1//sup B/-definable in VTC/sup 0/. We prove a general witnessing theorem for second-order theories and conclude that the/spl Sigma//sub 1//sup B/ theorems of VTC/sup 0/ are witnessed by TC/sup 0/ functions. We prove that VTC/sup 0/ is RSUV isomorphic to the first order theory /spl Delta//sub 1//sup b/-CR of Johannsen and Pollett (the \"minimal theory for TC/sup 0/\"), /spl Delta//sub 1//sup b/-CR includes the /spl Delta//sub 1//sup b/ comprehension rule, and J and P ask whether there is an upper bound to the nesting depth required for this rule. We answer \"yes\", because VTC/sup 0/ , and therefore /spl Delta//sub 1//sup b/-CR, are finitely axiomatizable. Finally, we show that /spl Sigma//sub 1//sup B/ theorems of VTC/sup 0/ translate to families of tautologies which have polynomial-size constant-depth TC/sup 0/-Frege proofs. We also show that PHP is a /spl Sigma//sub 0//sup B/ theorem of VTC/sup 0/. These together imply that the family of propositional tautologies associated with PHP has polynomial-size constant-depth TC/sup 0/-Frege proofs.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"4 1","pages":"378-387"},"PeriodicalIF":0.0,"publicationDate":"2004-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88711628","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}

引用次数: 1

The Omega Rule is II_2^0-Hard in the lambda beta -Calculus 规则是II_2^0-微积分中很难

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-07-13 DOI: 10.1109/LICS.2004.1319614

B. Intrigila, R. Statman

引用次数: 1

Logic in Computer Science, 2004. Proceedings of the 19th Annual IEEE Symposium on 计算机科学中的逻辑，2004。第19届IEEE年度研讨会论文集

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-01-01 DOI: 10.1109/LICS.2004.1319609

S. Abramsky, Ghica, A. Murawski, C. Ong, I. Stark

引用次数: 0

A Landscape with Games in the Backgroun 以游戏为背景的风景

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-01-01 DOI: 10.1109/LICS.2004.1319630

I. Walukiewicz

引用次数: 2

Dense Real-Time Games 密集的实时游戏

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2002-07-22 DOI: 10.1109/LICS.2002.1029826

M. Faella, S. L. Torre, A. Murano

{"title":"Dense Real-Time Games","authors":"M. Faella, S. L. Torre, A. Murano","doi":"10.1109/LICS.2002.1029826","DOIUrl":"https://doi.org/10.1109/LICS.2002.1029826","url":null,"abstract":"The rapid development of complex and safety-critical systems requires the use of reliable verification methods and tools for system design (synthesis). Many systems of interest are reactive, in the sense that their behavior depends on the interaction with the environment. A natural framework to model them is a two-player game: the system versus the environment. In this context, the central problem is to determine the existence of a winning strategy according to a given winning condition. We focus on real-time systems, and choose to model the related game as a nondeterministic timed automaton. We express winning conditions by formulas of the branching-time temporal logic TCTL. While timed games have been studied in the literature, timed games with dense-time winning conditions constitute a new research topic. The main result of this paper is an exponential-time algorithm to check for the existence of a winning strategy for TCTL games where equality is not allowed in the timing constraints. Our approach consists on translating to timed tree automata both the game graph and the winning condition, thus reducing the considered decision problem to the emptiness problem for this class of automata. The proposed algorithm matches the known lower bound on timed games. Moreover, if we relax the limitation we have placed on the timing constraints, the problem becomes undecidable.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"101 1","pages":"167-176"},"PeriodicalIF":0.0,"publicationDate":"2002-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81160284","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}

引用次数: 58

Complexity Classes, Propositional Proof Systems, and Formal Theories 复杂性类，命题证明系统和形式理论

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2002-07-22 DOI: 10.1109/LICS.2002.10000

S. Cook

引用次数: 1

A Stratified Semantics of General References A Stratified Semantics of General References 一般引用的分层语义

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2002-01-01 DOI: 10.1109/LICS.2002.1029818

Amal J. Ahmed, A. Appel, Roberto Virga

引用次数: 6

Fragments of Existential Second-Order Logic without 0-1 Laws 无0-1律的存在二阶逻辑的片段

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1998-06-21 DOI: 10.1109/LICS.1998.705685

J. L. Bars

引用次数: 10

Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 第十二届IEEE计算机科学逻辑研讨会论文集，波兰华沙，1997年6月29日- 7月2日

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-01-01 DOI: 10.1109/LICS.1997.614950

K. Etessami, Moshe Y. Vardi, T. Wilke

引用次数: 20