Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates-Reference-Cited by-同舟云学术

Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates

Published:2011 Issue: Volume: Page:368-379
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Anderson Matthew,van Melkebeek Dieter,Schweikardt Nicole,Segoufin Luc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22012-8_29

Reference17 articles.

1. Ajtai, M.: Σ1 1-formulae on finite structures. APAL 24(1), 1–48 (1983)

2. Benedikt, M., Segoufin, L.: Towards a characterization of order-invariant queries over tame structures. JSL 74(1), 168–186 (2009)

3. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Proc. of LICS (2007)

4. Durand, A., Lautemann, C., More, M.: Counting results in weak formalisms. In: Circuits, Logic, and Games. No. 06451 in Dagstuhl Seminar Proc. (2007)

5. Dvorak, Z., Král, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: Proc. of FOCS (2010)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ORDER-INVARIANT TYPES AND THEIR APPLICATIONS;LOG METH COMPUT SCI;2016

2. Pattern logics and auxiliary relations;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

3. Locality from Circuit Lower Bounds;SIAM Journal on Computing;2012-01

4. On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates;Logic, Language, Information and Computation;2012

5. A Toolkit for Proving Limitations of the Expressive Power of Logics;Mathematical Foundations of Computer Science 2012;2012