18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.最新文献_第4页

A proof theory for generic judgments: an extended abstract 一般判断的证明理论:扩展的抽象

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210051

D. Miller, Alwen Tiu

引用次数: 79

Advice about logical AI 关于逻辑AI的建议

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210064

J. McCarthy

引用次数: 0

Polynomial-time algorithms from ineffective proofs 多项式时间算法的无效证明

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210052

Paulo Oliva

引用次数: 6

The planning spectrum - one, two, three, infinity 规划频谱，1、2、3、无穷

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210063

M. Pistore, Moshe Y. Vardi

{"title":"The planning spectrum - one, two, three, infinity","authors":"M. Pistore, Moshe Y. Vardi","doi":"10.1109/LICS.2003.1210063","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210063","url":null,"abstract":"Linear temporal logic (LTL) is widely used for defining conditions on the execution paths of dynamic systems. In the case of dynamic systems that allow for nondeterministic evolutions, one has to specify, along with an LTL formula /spl phi/, which are the paths that are required to satisfy the formula. Two extreme cases are the universal interpretation A./spl phi/, which requires to satisfy the formula for all the possible execution paths, and the existential interpretation E./spl phi/ which requires to satisfy the formula for some execution paths. When LTL is applied to the definition of goals in planning problems on nondeterministic domains, these two extreme cases are too restrictive. It is often impossible to develop plans that achieve the goal in all the nondeterministic evolutions of a system, and it is too weak to require that the goal is satisfied by some executions. In this paper we explore alternative interpretations of an LTL formula that are between these extreme cases. We define a language that permits an arbitrary combination of the A and E quantifiers, thus allowing, for instance, to require that each finite execution can be extended to an execution satisfying an LTL formulas (AE./spl phi/), or that there is some finite execution whose extensions all satisfy an LTL formula (EA./spl phi/). We show that only eight of these combinations of path quantifiers are relevant, corresponding to an alternation of the quantifiers of length one (A and E), two (AE and EA), three (AEA and EAE), and infinity ((AE)/sup /spl omega// and (EA)/sup /spl omega//). We also present a planning algorithm for the new language that is based on an automata-theoretic approach, and studies its complexity.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129519021","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}

引用次数: 24

Model checking guarded protocols 模型检查保护协议

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210076

E. Emerson, Vineet Kahlon

{"title":"Model checking guarded protocols","authors":"E. Emerson, Vineet Kahlon","doi":"10.1109/LICS.2003.1210076","DOIUrl":"https://doi.org/10.1109/LICS.2003.1210076","url":null,"abstract":"The parameterized model checking problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, C||U/sup n/, comprised of a control process, C, and finitely, but arbitrarily, many copies of a user process, U, executing concurrently with interleaving semantics. We delineate the decidability/undecidability boundary of the PMCP for all possible systems that arise by letting processes coordinate using different subsets of the following communication primitives: conjunctive Boolean guards, disjunctive Boolean guards, pairwise rendezvous, asynchronous rendezvous and broadcast actions. Our focus is on the following linear time properties: (p1) LTL/spl bsol/X formulae over C; (p2) LTL formulae over C; (p3) regular properties specified as regular automata; and (p4) /spl omega/-regular automata. We also establish a hierarchy based on the relative expressive power of the primitives by showing that disjunctive guards and pairwise rendezvous are equally expressive, in that we can reduce the PMCP for regular and /spl omega/-regular properties for systems with disjunctive guards and pairwise rendezvous are equally expressive, in that we can reduce the PMCP for regular and /spl omega/-regular properties for systems with disjunctive guards to ones with pairwise rendezvous and vise versa, but that each of asynchronous rendezvous and broadcasts is strictly more expressive than pairwise rendezvous (and disjunctive guards). Moreover, for systems with conjunctive guards, we give a simple characterization of the decidability/undecidability boundary of the PMCP by showing that allowing stuttering sensitive properties bridges the gap between decidability (for p1) and undecidability (for p2). A broad framework for modeling snoopy cache protocols is also presented for which the PMCP for p3 is decidable and that can model all snoopy cache protocols given by Culler and Emerson (1988) thereby overcoming the undecidability results.","PeriodicalId":280809,"journal":{"name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122618962","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}

引用次数: 56

Convergence law for random graphs with specified degree sequence 给定次序列随机图的收敛律

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210070

J. Lynch

引用次数: 12

Model-checking trace event structures 模型检查跟踪事件结构

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210077

P. Madhusudan

引用次数: 30

Will deflation lead to depletion? On non-monotone fixed point inductions 通货紧缩会导致经济枯竭吗?关于非单调不动点归纳

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 2003-06-22 DOI: 10.1109/LICS.2003.1210055

E. Grädel, S. Kreutzer

引用次数: 12

Satisfiability in alternating-time temporal logic 交替时间时间逻辑的可满足性

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 1900-01-01 DOI: 10.1109/LICS.2003.1210060

G. van Drimmelen

引用次数: 5

Proceedings 18th Annual IEEE Symposium on Logic in Computer Science 第18届IEEE计算机科学逻辑研讨会论文集

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. Pub Date : 1900-01-01 DOI: 10.1109/LICS.2003.1210038

引用次数: 9