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

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)最新文献

筛选
英文 中文
Two-Variable Logic on Words with Data 数据词的双变量逻辑
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.51
M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, C. David
{"title":"Two-Variable Logic on Words with Data","authors":"M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, C. David","doi":"10.1109/LICS.2006.51","DOIUrl":"https://doi.org/10.1109/LICS.2006.51","url":null,"abstract":"In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the two-variable first-order logic FO2(~,<,+1) is decidable over finite and over infinite data words, where ~ is a binary predicate testing the data value equality and +1,< are the usual successor and order predicates. The complexity of the problem is at least as hard as Petri net reachability. Several extensions of the logic are considered, some remain decidable while some are undecidable","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134516203","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}
引用次数: 207
First Order Formulas with Modular Ppredicates 带模谓词的一阶公式
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.24
Laura Chaubard, J. Pin, Howard Straubing
{"title":"First Order Formulas with Modular Ppredicates","authors":"Laura Chaubard, J. Pin, Howard Straubing","doi":"10.1109/LICS.2006.24","DOIUrl":"https://doi.org/10.1109/LICS.2006.24","url":null,"abstract":"Two results by Schutzenberger (1965) and by McNaughton and Papert (1971) lead to a precise description of the expressive power of first order logic on words interpreted as ordered colored structures. In this paper, we study the expressive power of existential formulas and of Boolean combinations of existential formulas in a logic enriched by modular numerical predicates. We first give a combinatorial description of the corresponding regular languages, and then give an algebraic characterization in terms of their syntactic morphisms. It follows that one can effectively decide whether a given regular language is captured by one of these two fragments of first order logic. The proofs rely on nontrivial techniques of semigroup theory: stamps, derived categories and wreath products","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150993","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
LTL with the Freeze Quantifier and Register Automata LTL与冻结量化器和寄存器自动机
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1145/1507244.1507246
Stephane Demri, R. Lazic
{"title":"LTL with the Freeze Quantifier and Register Automata","authors":"Stephane Demri, R. Lazic","doi":"10.1145/1507244.1507246","DOIUrl":"https://doi.org/10.1145/1507244.1507246","url":null,"abstract":"Temporal logics, first-order logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the data, temporal logics are extended with the freeze quantifier, first-order logics with predicates over the data domain, and automata with registers or pebbles. We investigate relative expressiveness and complexity of standard decision problems for LTL with the freeze quantifier (LTLdarr), 2-variable first-order logic (FO2) over data words, and register automata. The only predicate available on data is equality. Previously undiscovered connections among those formalisms, and to counter automata with incrementing errors, enable us to answer several questions left open in recent literature. We show that the future-time fragment of LTLdarr which corresponds to FO2 over finite data words can be extended considerably while preserving decidability, but at the expense of non-primitive recursive complexity, and that most of further extensions are undecidable. We also prove that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122231654","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}
引用次数: 317
Stochastic games with branching-time winning objectives 具有分支时间获胜目标的随机博弈
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.48
T. Brázdil, V. Brozek, Vojtěch Forejt, A. Kucera
{"title":"Stochastic games with branching-time winning objectives","authors":"T. Brázdil, V. Brozek, Vojtěch Forejt, A. Kucera","doi":"10.1109/LICS.2006.48","DOIUrl":"https://doi.org/10.1109/LICS.2006.48","url":null,"abstract":"We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and winning strategies may require memory and or randomization. Our main results concern history-dependent strategies. In particular, we show that the problem whether there exists a history-dependent winning strategy in 1frac12-player games is highly undecidable, even for objectives formulated in the Lscr(F<sup>=5/8 </sup>,F<sup>=1</sup>,F<sup>>0</sup>,G<sup>=1</sup>) fragment of PCTL. On the other hand, we show that the problem becomes decidable (and in fact EXPTIME-complete) for the Lscr(F<sup>=1</sup>,F<sup>>0</sup>,G<sup>=1</sup>) fragment of PCTL, where winning strategies require only finite memory. This result is tight in the sense that winning strategies for Lscr(F<sup>=1</sup>,F<sup>>0</sup>,G<sup>=1</sup>,G<sup>>0 </sup>) objectives may already require infinite memory","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116199431","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}
引用次数: 43
An Abstraction-Refinement Framework for Multi-Agent Systems 多智能体系统的抽象-细化框架
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.10
T. Ball, O. Kupferman
{"title":"An Abstraction-Refinement Framework for Multi-Agent Systems","authors":"T. Ball, O. Kupferman","doi":"10.1109/LICS.2006.10","DOIUrl":"https://doi.org/10.1109/LICS.2006.10","url":null,"abstract":"Abstraction is a key technique for reasoning about systems with very large or even infinite state spaces. When a system is composed of reactive components, the interaction between the components is modeled by a multi-player game and verification corresponds to finding winners in the game. We describe an abstraction-refinement framework for multi-player games, with respect to specifications in the alternating mu-calculus (AMC). Our framework is based on abstract alternating transition systems (AATSs). Each agent in an AATS has transitions that over-approximate its power and transitions that under-approximate its power. We define the framework, define a 3-valued semantics for AMC formulas in an AATS, study the model-checking problem, define an abstraction preorder between AATSs, suggest a refinement procedure (in case model checking returns an indefinite answer), and study the completeness of the framework. For the case of predicate abstraction, we show how reasoning can be automated with a theorem prover. Abstractions of multi-player games have been studied in the past. Our main contribution with respect to earlier work is that we study general (rather than only turn-based) ATSs, we add a refinement procedure on top of the model checking procedure, and our abstraction preorder is parameterized by a set of agents","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"394 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117287595","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}
引用次数: 32
Fixed-Parameter Hierarchies inside PSPACE PSPACE中的固定参数层次结构
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.25
Guoqiang Pan, Moshe Y. Vardi
{"title":"Fixed-Parameter Hierarchies inside PSPACE","authors":"Guoqiang Pan, Moshe Y. Vardi","doi":"10.1109/LICS.2006.25","DOIUrl":"https://doi.org/10.1109/LICS.2006.25","url":null,"abstract":"Treewidth measures the \"tree-likeness\" of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this work, we study the impact of treewidth bounds on QBF, a canonical PSPACE-complete problem. This problem is known to be fixed-parameter tractable if both the treewidth and alternation depth are taken as parameters. We show here that the function bounding the complexity in the parameters is provably nonelementary (assuming P is different than NP). This yields a strict hierarchy of fixed-parameter tractability inside PSPACE. As a tool for proving this result, we first prove a similar hierarchy for model checking QPTL, quantified propositional temporal logic. Finally, we show that QBF, restricted to instances with a slowly increasing (log*) treewidth, is still PSPACE-complete","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123782055","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}
引用次数: 37
Approximate Satisfiability and Equivalence 近似可满足性和等价性
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1137/070703776
E. Fischer, F. Magniez, M. D. Rougemont
{"title":"Approximate Satisfiability and Equivalence","authors":"E. Fischer, F. Magniez, M. D. Rougemont","doi":"10.1137/070703776","DOIUrl":"https://doi.org/10.1137/070703776","url":null,"abstract":"Inspired by property testing, we relax the classical satisfiability UvDashF between a finite structure U of a class K and a formula F, to a notion of epsiv-satisfiability UvDashepsiv F, and the classical equivalence F1equivF2 between two formulas F1 and F2, to epsiv-equivalence F1equivepsivF2 for epsiv>0. We consider the class of strings and trees with the edit distance with moves, and show that these approximate notions can be efficiently decided. We use a statistical embedding of words (resp. trees) into lscr1, which generalizes the original Parikh mapping, obtained by sampling O(f(epsiv)) finite samples of the words (resp. trees). We give a tester for equality and membership in any regular language, in time independent of the size of the structure. Using our geometrical embedding, we can also test the equivalence between two regular properties on words, defined by monadic second order formulas. Our equivalence tester has polynomial time complexity in the size of the automaton (or regular expression), for a fixed epsiv, whereas the exact version of the equivalence problem is PSPACE-complete. Last, we extend the geometric embedding, and hence the tester algorithms, to infinite regular languages and to context-free languages. For context-free languages, the equivalence tester has an exponential time complexity, whereas the exact version is undecidable","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131540630","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}
引用次数: 32
Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel’s Impact on Logic, Mathematics, and Computer Science 动摇的基础还是突破性的重组?库尔特对逻辑、数学和计算机科学的影响的百年评估
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.47
J. Dawson
{"title":"Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt G&#246;del&#146;s Impact on Logic, Mathematics, and Computer Science","authors":"J. Dawson","doi":"10.1109/LICS.2006.47","DOIUrl":"https://doi.org/10.1109/LICS.2006.47","url":null,"abstract":"The publication of Godel's incompleteness theorems has frequently been portrayed as a devastating event, from which mathematics has not yet recovered. Yet those same theorems have also been hailed as proving that the powers of the human mind surpass those of any computer. Both those views, however, are caricatures. Godel's impact on modern logic has been profound, but the incompleteness theorems did not cause widespread upset at the time of their publication, and subsequent mathematical work outside logic has hardly been affected by them. Nor is mathematics any less \"secure\" than it was before Godel's work","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126592180","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
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata 从不确定Buchi和street自动机到确定奇偶自动机
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-3(3:5)2007
Nir Piterman
{"title":"From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata","authors":"Nir Piterman","doi":"10.2168/LMCS-3(3:5)2007","DOIUrl":"https://doi.org/10.2168/LMCS-3(3:5)2007","url":null,"abstract":"In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Specifically, starting from a nondeterministic Buchi automaton with n states our construction yields a deterministic parity automaton with n<sup>2n+2</sup> states and index 2n (instead of a Rabin automaton with (12)<sup>n</sup>n<sup>2n</sup> states and n pairs). Starting from a nondeterministic Streett automaton with n states and k pairs our construction yields a deterministic parity automaton with n<sup>n(k+2)+2</sup>(k+1)<sup>2n(K+1)</sup> states and index 2n(k+1) (instead of a Rabin automaton with (12)<sup>n(k+1)</sup>n <sup>n(k+2)</sup>(k+1)<sup>2n(k+1)</sup> states and n(k+1) pairs). The parity condition is much simpler than the Rabin condition. In applications such as solving games and emptiness of tree automata handling the Rabin condition involves an additional multiplier of n<sup>2</sup>n!(or(n(k+1))<sup>2</sup>(n(k+1))! in the case of Streett) which is saved using our construction","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451148","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}
引用次数: 310
The Boundedness Problem for Monadic Universal First-Order Logic 一元泛一阶逻辑的有界性问题
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.50
M. Otto
{"title":"The Boundedness Problem for Monadic Universal First-Order Logic","authors":"M. Otto","doi":"10.1109/LICS.2006.50","DOIUrl":"https://doi.org/10.1109/LICS.2006.50","url":null,"abstract":"We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula phi(X, x), positive in X, decide whether there is a uniform finite bound on the least fixed point recursion based on phi. Few fragments of FO are known to have a decidable boundedness problem; boundedness is known to be undecidable for many fragments. We here show that monadic boundedness is decidable for purely universal FO formulae without equality in which each non-recursive predicate occurs in just one polarity (e.g., only negatively). The restrictions are shown to be essential: waving either the polarity constraint or allowing positive occurrences of equality, the monadic boundedness problem for universal formulae becomes undecidable. The main result is based on a model theoretic analysis involving ideas from modal and guarded logics and a reduction to the monadic second-order theory of trees","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645304","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书