The Propagation Depth of Local Consistency-Reference-Cited by-同舟云学术

The Propagation Depth of Local Consistency

Published:2014 Issue: Volume: Page:158-173
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Berkholz Christoph

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-10428-7_14

Reference16 articles.

1. Lecture Notes in Computer Science;A. Atserias,2004

2. Berkholz, C.: The Propagation Depth of Local Consistency. ArXiv e-prints (2014), http://arxiv.org/abs/1406.4679

3. Berkholz, C.: Lower bounds for existential pebble games and k-consistency tests. Logical Methods in Computer Science 9(4) (2013), http://arxiv.org/abs/1205.0679

4. Lecture Notes in Computer Science;C. Berkholz,2013

5. Cooper, M.C.: An optimal k-consistency algorithm. Artificial Intelligence 41(1), 89–95 (1989)

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

1. From Quantifier Depth to Quantifier Number: Separating Structures with k Variables;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps;Journal of the ACM;2023-07-20

3. UPPER BOUNDS ON THE QUANTIFIER DEPTH FOR GRAPH DIFFERENTIATION IN FIRST-ORDER LOGIC;LOG METH COMPUT SCI;2019

4. On the speed of constraint propagation and the time complexity of arc consistency testing;Journal of Computer and System Sciences;2018-02

5. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05