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

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

筛选
英文 中文
The unifiability problem in ground AC theories 地面交流理论中的统一性问题
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287572
P. Narendran, M. Rusinowitch
{"title":"The unifiability problem in ground AC theories","authors":"P. Narendran, M. Rusinowitch","doi":"10.1109/LICS.1993.287572","DOIUrl":"https://doi.org/10.1109/LICS.1993.287572","url":null,"abstract":"It is shown that unifiability is decidable in theories presented by a set of ground equations with several associative-communicative symbols (ground AC theories). This result applies, for instance, to finitely presented commutative semigroups, and it extends the authors' previous work (P. Narendran and M. Rusinwithch, 1991) where they gave an algorithm for solving the uniform word problem in ground AC theories.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"16 1","pages":"364-370"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75664342","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}
引用次数: 8
On completeness of the mu -calculus 关于微积分的完备性
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287593
I. Walukiewicz
{"title":"On completeness of the mu -calculus","authors":"I. Walukiewicz","doi":"10.1109/LICS.1993.287593","DOIUrl":"https://doi.org/10.1109/LICS.1993.287593","url":null,"abstract":"The long-standing problem of the complete axiomatization of the propositional mu -calculus introduced by D. Kozen (1983) is addressed. The approach can be roughly described as a modified tableau method in the sense that infinite trees labeled with sets of formulas are investigated. The tableau method has already been used in the original paper by Kozen. The reexamination of the general tableau method presented is due to advances in automata theory, especially S. Safra's determinization procedure (1988), connections between automata on infinite trees and games, and experience with the model checking. A finitary complete axiom system for the mu -calculus is obtained. It can be roughly described as a system for propositional modal logic with the addition of a induction rule to reason about least fixpoints.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"10 1","pages":"136-146"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72967675","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}
引用次数: 30
Asymptotic probabilities of languages with generalized quantifiers 具有广义量词的语言的渐近概率
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287587
G. Fayolle, S. Grumbach, C. Tollu
{"title":"Asymptotic probabilities of languages with generalized quantifiers","authors":"G. Fayolle, S. Grumbach, C. Tollu","doi":"10.1109/LICS.1993.287587","DOIUrl":"https://doi.org/10.1109/LICS.1993.287587","url":null,"abstract":"The impact of adding certain families of generalized quantifiers to first-order logic (FO) on the asymptotic behavior of sentences is studied. All the results are stated and proved for languages disallowing free variables in the scope of generalized quantifiers. For a class K of finite structures closed under isomorphism, the quantifier Q/sub K/ is said to be strongly monotonic, sm, if membership in the class is preserved under a loose form of extensions. The first theorem (O/1 law for FO with any set of sm quantifiers) subsumes a previous criterion for proving that almost no graphs satisfy a given property. A O/1 law for FO with Hartig quantifiers (equicardinality quantifiers) and a limit law for a fragment of FO with Rescher quantifiers (expressing inequalities of cardinalities) are also established. It is also proved that the O/1 law fails for the extension of FO with Hartig quantifiers if the above syntactic restriction is relaxed, giving the best upper bound for the existence of a O/1 law for FO with Hartig quantifiers.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"199-207"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76140573","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}
引用次数: 15
Rules of definitional reflection 定义反射规则
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287585
P. Schroeder-Heister
{"title":"Rules of definitional reflection","authors":"P. Schroeder-Heister","doi":"10.1109/LICS.1993.287585","DOIUrl":"https://doi.org/10.1109/LICS.1993.287585","url":null,"abstract":"The author discusses two rules of definitional reflection: the logical version of definitional reflection, as used in the extended logic programming language GCLA, and the omega version of definitional reflection. The logical version is a left-introduction rule completely analogous to the left-introduction rules for logical operators in Gentzen-style sequent systems, whereas the omega version extends the logical version by a principle related to the omega rule in arithmetic. Correspondingly, the interpretation of free variables differs between the two approaches, resulting in different principles of closure of inference rules under substitution. This difference is crucial for the computational interpretation of definitional reflection.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"4 1","pages":"222-232"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79467833","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}
引用次数: 124
A typed pattern calculus 类型化模式演算
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287581
D. Kesner, Laurence Puel, V. Tannen
{"title":"A typed pattern calculus","authors":"D. Kesner, Laurence Puel, V. Tannen","doi":"10.1109/LICS.1993.287581","DOIUrl":"https://doi.org/10.1109/LICS.1993.287581","url":null,"abstract":"The theory of programming with pattern-matching function definitions has been studied mainly in the framework of first-order rewrite systems. The authors present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern definitions and their types. In this calculus, type-checking guarantees the absence of runtime errors caused by nonexhaustive pattern-matching definitions. Its operational semantics is deterministic in a natural way, without the imposition of ad hoc solutions such as clause order or best fit. The calculus is designed as a computational interpretation of the Gentzen sequent proofs for the intuitionistic propositional logic. The basic properties connecting typing and evaluation, subject reduction, and strong normalization are proved. The authors believe that this calculus offers a rational reconstruction of the pattern-matching features found in successful functional languages.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"262-274"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84843598","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}
引用次数: 48
Set constraints are the monadic class 集合约束是一元类
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287598
L. Bachmair, H. Ganzinger, Uwe Waldmann
{"title":"Set constraints are the monadic class","authors":"L. Bachmair, H. Ganzinger, Uwe Waldmann","doi":"10.1109/LICS.1993.287598","DOIUrl":"https://doi.org/10.1109/LICS.1993.287598","url":null,"abstract":"The authors investigate the relationship between set constraints and the monadic class of first-order formulas and show that set constraints are essentially equivalent to the monadic class. From this equivalence, they infer that the satisfiability problem for set constraints is complete for NEXPTIME. More precisely, it is proved that this problem has a lower bound of NTIME(c/sup n/log n/), for some c>0. The relationship between set constraints and the monadic class also gives decidability and complexity results for certain practically useful extensions of set constraints, in particular \"negative\" projections and subterm equality tests.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"36 1","pages":"75-83"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85359977","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}
引用次数: 126
Local and asynchronous beta-reduction (an analysis of Girard's execution formula) 局部和异步beta缩减(对吉拉德执行公式的分析)
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287578
V. Danos, L. Regnier
{"title":"Local and asynchronous beta-reduction (an analysis of Girard's execution formula)","authors":"V. Danos, L. Regnier","doi":"10.1109/LICS.1993.287578","DOIUrl":"https://doi.org/10.1109/LICS.1993.287578","url":null,"abstract":"The authors build a confluent, local, asynchronous reduction on lambda -terms, using infinite objects (partial injections of Girard's (1988) algebra L*), which is simple (only one move), intelligible (semantic setting of the reduction), and general (based on a large-scale decomposition of beta ), and may be mechanized.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"6 1","pages":"296-306"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72723934","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}
引用次数: 41
Some desirable conditions for feasible functionals of type 2 二类可行泛函的若干理想条件
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287576
Anil Seth
{"title":"Some desirable conditions for feasible functionals of type 2","authors":"Anil Seth","doi":"10.1109/LICS.1993.287576","DOIUrl":"https://doi.org/10.1109/LICS.1993.287576","url":null,"abstract":"We consider functionals of type 2 as transformers between functions of type 1. An intuitively feasible functional must preserve the complexity of the input function in some broad sense. We show that the well quasi-order functional, which has been proposed by S.A. Cook (1990) as being intuitively feasible, fails to preserve the class of Kalmar elementary functions. For the basic feasible functionals (BFF), we show that there are arbitrarily large complexity classes of type 1 functions, under the classical definition of a complexity class, which contain polynomial-time functions and are closed under composition but are not preserved by the BFF. However, for a more natural definition of a complexity class of type 1 functions, BFF is shown to preserve all such complexity classes. BFF is the largest known class with this property. We prove BFF to be the largest class of type 2 functionals which satisfies Cook's conditions and the Ritchie-Cobham property, and preserves all classes of type 1 computable functions that contain polynomial-time functions and are closed under composition and limited recursion on notation. These results give some evidence that basic feasible functionals may be the right notion of type 2 feasibility.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"55 1","pages":"320-331"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75078715","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
Encoding the calculus of constructions in a higher-order logic 用高阶逻辑对构造演算进行编码
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287584
A. Felty
{"title":"Encoding the calculus of constructions in a higher-order logic","authors":"A. Felty","doi":"10.1109/LICS.1993.287584","DOIUrl":"https://doi.org/10.1109/LICS.1993.287584","url":null,"abstract":"The author presents an encoding of the calculus of constructions (CC) in a higher-order intuitionistic logic (I) in a direct way, so that correct typing in CC corresponds to intuitionistic provability in a sequent calculus for I. In addition, she demonstrates a direct correspondence between proofs in these two systems. The logic I is an extension of hereditary Harrop formulas (hh), which serve as the logical foundation of the logic programming language lambda Prolog. Like hh, I has the uniform proof property, which allows a complete nondeterministic search procedure to be described in a straightforward manner. Via the encoding, this search procedure provides a goal directed description of proof checking and proof search in CC.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"4 1","pages":"233-244"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73600442","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}
引用次数: 12
An exponential separation between the matching principle and the pigeonhole principle 匹配原理和鸽子洞原理之间的指数分离
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI: 10.1109/LICS.1993.287577
P. Beame, T. Pitassi
{"title":"An exponential separation between the matching principle and the pigeonhole principle","authors":"P. Beame, T. Pitassi","doi":"10.1109/LICS.1993.287577","DOIUrl":"https://doi.org/10.1109/LICS.1993.287577","url":null,"abstract":"The combinatorial matching principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the matching principle requires exponential-size bounded-depth Frege proofs. M. Ajtai (1990) previously showed that the matching principle does not have polynomial-size bounded-depth Frege proofs even with the pigeonhole principle as an axiom schema. His proof utilizes nonstandard model theory and is nonconstructive. We improve Ajtai's lower bound from barely superpolynomial to exponential, and eliminate the nonstandard model theory. Our lower bound is also related to the inherent complexity of particular search classes. In particular, oracle separations between the complexity classes PPA and PPAD and between PPA and PPP follow from our techniques.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"14 1","pages":"308-319"},"PeriodicalIF":0.0,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75284394","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}
引用次数: 26
首页 上一页 下一页 尾页
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学术官方微信