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

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)最新文献

筛选
英文 中文
How to optimize proof-search in modal logics: a new way of proving redundancy criteria for sequent calculi 如何优化模态逻辑中的证明搜索:一种证明序列演算冗余准则的新方法
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855787
A. Voronkov
{"title":"How to optimize proof-search in modal logics: a new way of proving redundancy criteria for sequent calculi","authors":"A. Voronkov","doi":"10.1109/LICS.2000.855787","DOIUrl":"https://doi.org/10.1109/LICS.2000.855787","url":null,"abstract":"We present a bottom-up decision procedure for propositional modal logic K based on the inverse method. The procedure is based on the \"inverted\" version of a sequent calculus. To restrict the search space; we prove a number of redundancy criteria for derivations in the sequent calculus. We introduce a new technique of proving redundancy criteria, based on the analysis of tableau-based derivations in K. Moreover another new technique is used to prove completeness of proof-search with a strong notion of subsumption. This technique is based on so-called traces. A new formalization of the inverse method in the form of a path calculus considerably simplifies all proofs as compared to the previously published presentations of the inverse method. Experimental results reported elsewhere demonstrate that our method is competitive with many state-of-the-art implementations of K.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971706","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}
引用次数: 5
A decision procedure for term algebras with queues 具有队列的项代数的决策过程
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1145/371316.371494
T. Rybina, A. Voronkov
{"title":"A decision procedure for term algebras with queues","authors":"T. Rybina, A. Voronkov","doi":"10.1145/371316.371494","DOIUrl":"https://doi.org/10.1145/371316.371494","url":null,"abstract":"In software verification, it is often required to prove statements about heterogeneous domains containing elements of various sorts, such as counters, stacks, lists, trees and queues. Any domain with counters, stacks, lists, and trees (but not queues) can be easily seen as a special case of the term algebra, and hence a decision procedure for term algebras can be applied to decide the first-order theory of such a domain. We present a quantifier-elimination procedure for the first-order theory of term algebras extended with queues. The complete axiomatization and decidability of this theory can be immediately derived from the procedure.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384525","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
View-based query processing and constraint satisfaction 基于视图的查询处理和约束满足
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855784
Diego Calvanese, Giuseppe De Giacomo, M. Lenzerini, Moshe Y. Vardi
{"title":"View-based query processing and constraint satisfaction","authors":"Diego Calvanese, Giuseppe De Giacomo, M. Lenzerini, Moshe Y. Vardi","doi":"10.1109/LICS.2000.855784","DOIUrl":"https://doi.org/10.1109/LICS.2000.855784","url":null,"abstract":"View-based query processing requires answering a query posed to a database only on the basis of the information on a set of views, which are again queries over the same database. This problem is relevant in many aspects of database management, and has been addressed by means of two basic approaches: query rewriting and query answering. In the former approach, one tries to compute a rewriting of the query in terms of the views, whereas in the latter, one aims at directly answering the query based on the view extensions. We study view based query processing for the case of regular-path queries, which are the basic querying mechanisms for the emergent field of semistructured data. Based on recent results, we first show that a rewriting is in general a co-NP function wrt to the size of view extensions. Hence, the problem arises of characterizing which instances of the problem admit a rewriting that is PTIME. A second contribution of the work is to establish a tight connection between view based query answering and constraint satisfaction problems, which allows us to show that the above characterization is going to be difficult. As a third contribution, we present two methods for computing PTIME rewritings of specific forms. The first method, which is based on the established connection with constraint satisfaction problems, gives us rewritings expressed in Datalog with a fixed number of variables. The second method, based on automata-theoretic techniques, gives us rewritings that are formulated as unions of conjunctive regular-path queries with a fixed number of variables.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125545502","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}
引用次数: 94
Dominator trees and fast verification of proof nets 支配树和快速验证证明网
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855768
A. Murawski, C. Ong
{"title":"Dominator trees and fast verification of proof nets","authors":"A. Murawski, C. Ong","doi":"10.1109/LICS.2000.855768","DOIUrl":"https://doi.org/10.1109/LICS.2000.855768","url":null,"abstract":"We consider the following decision problems. PROOFNET: given a multiplicative linear logic (MLL) proof structure, is it a proof net? ESSNET: given an essential net (of an intuitionistic MLL sequent), is it correct? The authors show that linear-time algorithms for ESSNET can be obtained by constructing the dominator tree of the input essential net. As a corollary, by showing that PROOFNET is linear-time reducible to ESSNET (by the trip translation), we obtain a linear-time algorithm for PROOFNET. We show further that these linear-time algorithms can be optimized to simple one-pass algorithms: each node of the input structure is visited at most once. As another application of dominator trees, we obtain linear time algorithms for sequentializing proof nets (i.e. given a proof net, find a derivation for the underlying MLL sequent) and essential nets.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563118","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}
引用次数: 33
Better is better than well: on efficient verification of infinite-state systems 好胜于好:关于无穷状态系统的有效验证
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855762
P. Abdulla, Aletta Nylén
{"title":"Better is better than well: on efficient verification of infinite-state systems","authors":"P. Abdulla, Aletta Nylén","doi":"10.1109/LICS.2000.855762","DOIUrl":"https://doi.org/10.1109/LICS.2000.855762","url":null,"abstract":"Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However, many of these constraint systems suffer from a \"constraint explosion problem\", as the number of the generated constraints grows exponentially with the size of the problem. We demonstrate that a refinement of the theory of well quasi-orderings, called the theory of better quasi-orderings is more appropriate for symbolic model checking, since it allows inventing constraint systems which are both well quasi-ordered and compact. We apply our methodology to derive new constraint systems for verification of systems with unboundedly many clocks, broadcast protocols, lossy channel systems, and integral relational automata. The new constraint systems are exponentially more succinct than existing ones, and their well quasi-ordering cannot be shown by previous methods in the literature.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127096976","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}
引用次数: 61
Efficient and flexible matching of recursive types 有效和灵活的递归类型匹配
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855786
J. Palsberg, Tian Zhao
{"title":"Efficient and flexible matching of recursive types","authors":"J. Palsberg, Tian Zhao","doi":"10.1109/LICS.2000.855786","DOIUrl":"https://doi.org/10.1109/LICS.2000.855786","url":null,"abstract":"Equality and subtyping of recursive types have been studied in the 1990s by: R.M. Amadaio and L. Cardelli (1993); D. Kozen et al. (1993); M. Brandt and F. Henglein (1997) and others. Potential applications include automatic generation of bridge code for multi-language systems and type-based retrieval of software modules from libraries. J. Auerbach et al. (1998) advocate a highly flexible combination of matching rules for which there, until now, are no efficient algorithmic techniques. We present an efficient decision procedure for a notion of type equality that includes unfolding of recursive types, and associativity and commutativity of product types, as advocated by Auerbach et al. For two types of size at most n, our algorithm decides equality in O(n/sup 2/) time. The algorithm iteratively prunes a set of type pairs, and eventually it produces a set of pairs of equal types. In each iteration, the algorithm exploits a so-called coherence property of the set of type pairs produced in the preceding iteration. The algorithm takes O(n) iterations, each of which takes O(n) time, for a total of O(n/sup 2/) time.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745411","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}
引用次数: 22
Satisfiability testing: recent developments and challenge problems 可满足性测试:最近的发展和挑战问题
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855767
B. Selman
{"title":"Satisfiability testing: recent developments and challenge problems","authors":"B. Selman","doi":"10.1109/LICS.2000.855767","DOIUrl":"https://doi.org/10.1109/LICS.2000.855767","url":null,"abstract":"Recently, there has been much progress in the area of prepositional reasoning and search. Current techniques can handle problem instances with thousands of variables and up to a million clauses. This has led to new applications in areas such as planning, scheduling, protocol verification, and software testing. Much of the recent progress has resulted from a better understanding of the computational characteristics of the satisfiability problem. In particular, by exploiting connections between combinatorial problems and models from statistical physics, we now have methods that enable a much finer-grained characterization of computational complexity than the standard worst-case complexity measures. These findings provide insights into new algorithmic strategies based on randomization and distributed algorithm portfolios. I will survey the recent progress in this area and I will discuss the current state-of-the-art in propositional reasoning focusing on a series of challenge problems concerning propositional encodings, compilation techniques, approximate reasoning, robustness, and scalability.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130848214","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
A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering 具有Knuth-Bendix序的项代数的存在论判定程序
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) Pub Date : 2000-06-26 DOI: 10.1109/LICS.2000.855777
Konstantin Korovin, A. Voronkov
{"title":"A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering","authors":"Konstantin Korovin, A. Voronkov","doi":"10.1109/LICS.2000.855777","DOIUrl":"https://doi.org/10.1109/LICS.2000.855777","url":null,"abstract":"The authors show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering. They achieve this by giving a procedure for solving Knuth-Bendix ordering constraints. As for complexity, NP-hardness of the set of satisfiable quantifier-free formulas can be shown in the same way as by R. Nieuwenhuis (1993). The algorithm presented does not give an NP upper bound; we point out parts of our algorithm that may cause nonpolynomial behavior.","PeriodicalId":300113,"journal":{"name":"Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124331161","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学术官方微信