2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第5页

From positive and intuitionistic bounded arithmetic to monotone proof complexity 从正直觉有界算法到单调证明复杂性

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934570

Anupam Das

引用次数: 1

The Complexity of Coverability in ν-Petri Nets ν-Petri网可覆盖性的复杂性

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933593

R. Lazic, S. Schmitz

引用次数: 14

Factor Varieties and Symbolic Computation 因子变异与符号计算

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933600

A. Salibra, Giulio Manzonetto, G. Favro

引用次数: 3

Two-variable Logic with a Between Relation 具有间关系的两变量逻辑

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2935308

Andreas Krebs, Kamal Lodaya, P. Pandya, Howard Straubing

引用次数: 11

Infinitary Lambda Calculi from a Linear Perspective 线性视角下的无穷λ演算

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934505

Ugo Dal Lago

引用次数: 3

Gödel’s functional interpretation and the concept of learning Gödel的功能解释和学习的概念

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933605

Thomas Powell

引用次数: 9

Complexity Theory of (Functions on) Compact Metric Spaces 紧度量空间上函数的复杂性理论

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2935311

A. Kawamura, Florian Steinberg, M. Ziegler

{"title":"Complexity Theory of (Functions on) Compact Metric Spaces","authors":"A. Kawamura, Florian Steinberg, M. Ziegler","doi":"10.1145/2933575.2935311","DOIUrl":"https://doi.org/10.1145/2933575.2935311","url":null,"abstract":"We promote the theory of computational complexity on metric spaces: as natural common generalization of (i) the classical discrete setting of integers, binary strings, graphs etc. as well as of (ii) the bit-complexity theory on real numbers and functions according to Friedman, Ko (1982ff), Cook, Braverman et al.; as (iii) resource-bounded refinement of the theories of computability on, and representations of, continuous universes by Pour-El& Richards (1989) and Weihrauch (1993ff); and as (iv) computational perspective on quantitative concepts from classical Analysis: Our main results relate (i.e. upper and lower bound) Kolmogorov’s entropy of a compact metric space X polynomially to the uniform relativized complexity of approximating various families of continuous functions on X. The upper bounds are attained by carefully crafted oracles and bit-cost analyses of algorithms perusing them. They all employ the same representation (i.e. encoding, as infinite binary sequences, of the elements) of such spaces, which thus may be of own interest. The lower bounds adapt adversary arguments from unit-cost Information-Based Complexity to the bit model. They extend to, and indicate perhaps surprising limitations even of, encodings via binary string functions (rather than sequences) as introduced by Kawamura&Cook (SToC’2010, §3.4). These insights offer some guidance towards suitable notions of complexity for higher types.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131036350","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}

引用次数: 14

Constructions with Non-Recursive Higher Inductive Types 非递归高归纳类型的构造

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933586

Nicolai Kraus

{"title":"Constructions with Non-Recursive Higher Inductive Types","authors":"Nicolai Kraus","doi":"10.1145/2933575.2933586","DOIUrl":"https://doi.org/10.1145/2933575.2933586","url":null,"abstract":"Higher inductive types (HITs) in homotopy type theory are a powerful generalization of inductive types. Not only can they have ordinary constructors to define elements, but also higher constructors to define equalities (paths). We say that a HIT H is non-recursive if its constructors do not quantify over elements or paths in H. The advantage of non-recursive HITs is that their elimination principles are easier to apply than those of general HITs.It is an open question which classes of HITs can be encoded as non-recursive HITs. One result of this paper is the construction of the propositional truncation via a sequence of approximations, yielding a representation as a non-recursive HIT. Compared to a related construction by van Doorn, ours has the advantage that the connectedness level increases in each step, yielding simplified elimination principles into n-types. As the elimination principle of our sequence has strictly lower requirements, we can then prove a similar result for van Doorn’s construction. We further derive general elimination principles of higher truncations (say, k-truncations) into n-types, generalizing a previous result by Capriotti et al. which considered the case n ≡ k + 1.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126355743","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}

引用次数: 23

Order Invariance on Decomposable Structures 可分解结构的阶不变性

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-06-21 DOI: 10.1145/2933575.2934517

Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe

{"title":"Order Invariance on Decomposable Structures","authors":"Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe","doi":"10.1145/2933575.2934517","DOIUrl":"https://doi.org/10.1145/2933575.2934517","url":null,"abstract":"Order-invariant formulas access an ordering on a structure’s universe, but the model relation is independent of the used ordering. They are frequently used for logic-based approaches in computer science. Order-invariant formulas capture unordered problems of complexity classes and they model the independence of the answer to a database query from low-level aspects of databases. we study the expressive power of order-invariant monadic second-order (MSO) and first-order (FO) logic on restricted classes of structures that admit certain forms of tree decompositions (not necessarily of bounded width).While order-invariant MSO is more expressive than MSO and, even, CMSO (MSO with modulo-counting predicates) in general, we show that order-invariant MSO and CMSO are equally expressive on graphs of bounded tree width and on planar graphs. This extends an earlier result for trees due to Courcelle. Moreover, we show that all properties definable in order-invariant FO are also definable in MSO on these classes. These results are applications of a theorem that shows how to lift up definability results for order-invariant logics from the bags of a graph’s tree decomposition to the graph itself.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"2015 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132792764","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

Two-Way Visibly Pushdown Automata and Transducers* 双向可见下压自动机和传感器*

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-06-01 DOI: 10.1145/2933575.2935315

L. Dartois, E. Filiot, P. Reynier, J. Talbot

{"title":"Two-Way Visibly Pushdown Automata and Transducers*","authors":"L. Dartois, E. Filiot, P. Reynier, J. Talbot","doi":"10.1145/2933575.2935315","DOIUrl":"https://doi.org/10.1145/2933575.2935315","url":null,"abstract":"Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three following models are equivalent: deterministic two-way transducers, monadic second-order (MSO) transducers, and deterministic one-way automata equipped with a finite number of registers. Nested words are words with a nesting structure, allowing to model unranked trees as their depth-first-search linearisations. In this paper, we consider transformations from nested words to words, allowing in particular to produce unranked trees if output words have a nesting structure. The model of visibly pushdown transducers allows to describe such transformations, and we propose a simple deterministic extension of this model with two-way moves that has the following properties: i) it is a simple computational model, that naturally has a good evaluation complexity; ii) it is expressive: it subsumes nested word-to-word MSO transducers, and the exact expressiveness of MSO transducers is recovered using a simple syntactic restriction; iii) it has good algorithmic/closure properties: the model is closed under composition with a unambiguous one-way letter-to-letter transducer which gives closure under regular look-around, and has a decidable equivalence problem.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116687118","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