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

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献

筛选
英文 中文
Abstraction in Data Integration 数据集成中的抽象
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470716
Gianluca Cima, Marco Console, M. Lenzerini, Antonella Poggi
{"title":"Abstraction in Data Integration","authors":"Gianluca Cima, Marco Console, M. Lenzerini, Antonella Poggi","doi":"10.1109/LICS52264.2021.9470716","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470716","url":null,"abstract":"Data integration provides a unified and abstract view over a set of existing data sources. The typical architecture of a data integration system comprises the global schema, which is the structure for the unified view, the source schema, and the mapping, which is a formal account of how data at the sources relate to the global view. Most of the research work on data integration in the last decades deals with the problem of processing a query expressed on the global schema by computing a suitable query over the sources, and then evaluating the latter in order to derive the answers to the original query. Here, we address a novel issue in data integration: starting from a query expressed over the sources, the goal is to find an abstraction of such query, i.e., a query over the global schema that captures the original query, modulo the mapping. The goal of the paper is to provide an overview of the notion of abstraction in data integration, by presenting a formal framework, illustrating the results that have appeared in the recent literature, and discussing interesting directions for future research.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132087885","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}
引用次数: 7
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes Lacon-和灌木-分解:有界展开类一阶转导的新表征
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-06-29 DOI: 10.1109/LICS52264.2021.9470680
Jannik Dreier
{"title":"Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes","authors":"Jannik Dreier","doi":"10.1109/LICS52264.2021.9470680","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470680","url":null,"abstract":"The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes. First-order interpretations and transductions of sparse graph classes lead to more general, dense graph classes that seem to inherit many of the nice algorithmic properties of their sparse counterparts.In this work we introduce lacon- and shrub-decompositions and use them to characterize transductions of bounded expansion graph classes and other graph classes. If one can efficiently compute sparse shrub- or lacon-decompositions of transductions of bounded expansion classes then one can solve every problem definable in first-order logic in linear time on these classes.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076701","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}
引用次数: 7
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation 定量模态逻辑的表达性:通过稠密和近似的范畴基础
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-21 DOI: 10.1109/LICS52264.2021.9470656
Yuichi Komorida, Shin-ya Katsumata, C. Kupke, J. Rot, I. Hasuo
{"title":"Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation","authors":"Yuichi Komorida, Shin-ya Katsumata, C. Kupke, J. Rot, I. Hasuo","doi":"10.1109/LICS52264.2021.9470656","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470656","url":null,"abstract":"A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to quantitative settings which resulted in a number of expressivity results for quantitative logics and behavioral metrics. Each of these quantitative expressivity results uses a tailor-made argument; distilling the essence of these arguments is non-trivial, yet important to support the design of expressive modal logics for new quantitative settings. In this paper, we present the first categorical framework for deriving quantitative expressivity results, based on the new notion of approximating family. A key ingredient is the codensity lifting—a uniform observation-centric construction of various bisimilarity-like notions such as bisimulation metrics. We show that several recent quantitative expressivity results (e.g. by König et al. and by Fijalkow et al.) are accommodated in our framework; a new expressivity result is derived, too, for what we call bisimulation uniformity.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859266","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}
引用次数: 11
On the logical structure of choice and bar induction principles 论选择的逻辑结构和条形归纳法原则
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-19 DOI: 10.1109/LICS52264.2021.9470523
N. Brede, Hugo Herbelin
{"title":"On the logical structure of choice and bar induction principles","authors":"N. Brede, Hugo Herbelin","doi":"10.1109/LICS52264.2021.9470523","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470523","url":null,"abstract":"We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an \"intensional\" or \"effective\" view of respectively ill- and well-foundedness properties to an \"extensional\" or \"ideal\" view of these properties. After classifying and analysing the relations between different intensional definitions of ill-foundedness and well-foundedness, we introduce, for a domain A, a codomain B and a \"filter\" T on finite approximations of functions from A to B, a generalised form GDCABT of the axiom of dependent choice and dually a generalised bar induction principle GBIABT such that:GDCABT intuitionistically captures the strength of•the general axiom of choice expressed as ∀a∃bR(a,b) ⇒ ∃α∀aR(a,α(a))) when T is a filter that derives point-wise from a relation R on A × B without introducing further constraints,•the Boolean Prime Filter Theorem / Ultrafilter Theorem if B is the two-element set $mathbb{B}$ (for a constructive definition of prime filter),•the axiom of dependent choice if $A = mathbb{N}$,•Weak Kőnig’s Lemma if $A = mathbb{N}$ and $B = mathbb{B}$ (up to weak classical reasoning).GBIABT intuitionistically captures the strength of•Gödel’s completeness theorem in the form validity implies provability for entailment relations if $B = mathbb{B}$ (for a constructive definition of validity),•bar induction if $A = mathbb{N}$,•the Weak Fan Theorem if $A = mathbb{N}$ and $B = mathbb{B}$.Contrastingly, even though GDCABT and GBIABT smoothly capture several variants of choice and bar induction, some instances are inconsistent, e.g. when A is ${mathbb{B}^{mathbb{N}}}$ and B is $mathbb{N}$.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418869","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}
引用次数: 2
An Algebraic Characterisation of First-Order Logic with Neighbour 具有邻域的一阶逻辑的代数表征
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-19 DOI: 10.1109/LICS52264.2021.9470660
Amaldev Manuel, Dhruv Nevatia
{"title":"An Algebraic Characterisation of First-Order Logic with Neighbour","authors":"Amaldev Manuel, Dhruv Nevatia","doi":"10.1109/LICS52264.2021.9470660","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470660","url":null,"abstract":"We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution semigroups. To characterise the logic, we define a special kind of semidirect product of involution semigroups, called the locally hermitian product. The characterisation theorem for FO with neighbour states that a language is definable in the logic if and only if it is recognised by a locally hermitian product of an aperiodic commutative involution semigroup, and a locally trivial involution semigroup. We then define the notion of involution varieties of languages, namely classes of languages closed under Boolean operations, quotients, involution, and inverse images of involutory morphisms. An Eilenberg-type correspondence is established between involution varieties of languages and pseudovarieties of involution semigroups.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452684","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}
引用次数: 0
Parametricity and Semi-Cubical Types 参数型和半立方型
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-18 DOI: 10.1109/LICS52264.2021.9470728
Hugo Moeneclaey
{"title":"Parametricity and Semi-Cubical Types","authors":"Hugo Moeneclaey","doi":"10.1109/LICS52264.2021.9470728","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470728","url":null,"abstract":"We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes.Our construction works not only for parametricity, but also for similar interpretations of type theory and in fact similar interpretations of any generalized algebraic theory. To be precise we consider a functor forgetting unary operations and equations defining them recursively in a generalized algebraic theory. We show that it has a right adjoint.We use techniques from locally presentable category theory, as well as from quotient inductive-inductive types.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484659","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}
引用次数: 2
Quantitative and Approximate Monitoring 定量和近似监测
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-18 DOI: 10.1109/LICS52264.2021.9470547
T. Henzinger, N. Saraç
{"title":"Quantitative and Approximate Monitoring","authors":"T. Henzinger, N. Saraç","doi":"10.1109/LICS52264.2021.9470547","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470547","url":null,"abstract":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace’s unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131065109","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
The Topological Mu-Calculus: completeness and decidability 拓扑mu微积分:完备性和可判定性
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-18 DOI: 10.1109/LICS52264.2021.9470560
A. Baltag, N. Bezhanishvili, David Fern'andez-Duque
{"title":"The Topological Mu-Calculus: completeness and decidability","authors":"A. Baltag, N. Bezhanishvili, David Fern'andez-Duque","doi":"10.1109/LICS52264.2021.9470560","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470560","url":null,"abstract":"We study the topological µ-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over T0 and TD spaces. We also investigate relational µ-calculus, providing general completeness results for all natural fragments of µ-calculus over many different classes of relational frames. Unlike most other such proofs for µ-calculus, ours is modeltheoretic, making an innovative use of a known Modal Logic method (–the ’final’ submodel of the canonical model), that has the twin advantages of great generality and essential simplicity.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":" 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133121664","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}
引用次数: 10
A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours 有限状态行为散度保持分支同余的完全公理化
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-17 DOI: 10.1109/LICS52264.2021.9470647
Xinxin Liu, Tingting Yu
{"title":"A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours","authors":"Xinxin Liu, Tingting Yu","doi":"10.1109/LICS52264.2021.9470647","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470647","url":null,"abstract":"We present an equational inference system for finite-state expressions, and prove that the system is sound and complete with respect to divergence preserving branching congruence, closing a problem that has been open since 1993. The inference system refines Rob van Glabbeek’s simple and elegant complete axiomatisation for branching bisimulation congruence of finite-state behaviours by joining four simple axioms after dropping one axiom which is unsound under the more refined divergence sensitive semantics.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129479514","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}
引用次数: 0
Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus 平方和和多项式微积分中的单项大小与位复杂度
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-05-16 DOI: 10.1109/LICS52264.2021.9470545
Tuomas Hakoniemi
{"title":"Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus","authors":"Tuomas Hakoniemi","doi":"10.1109/LICS52264.2021.9470545","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470545","url":null,"abstract":"In this paper we consider the relationship between monomial-size and bit-complexity in Sums-of-Squares (SOS) in Polynomial Calculus Resolution over rationals $({text{PCR}}/mathbb{Q})$. We show that there is a set of polynomial constraints Qn over Boolean variables that has both SOS and ${text{PCR}}/mathbb{Q}$ refutations of degree 2 and thus with only polynomially many monomials, but for which any SOS or ${text{PCR}}/mathbb{Q}$ refutation must have exponential bit-complexity, when the rational coefficients are represented with their reduced fractions written in binary.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572696","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信