Clustering phase of a general constraint satisfaction problem model d-k-CSP

2020 ◽  
Vol 537 ◽  
pp. 122708
Author(s):  
Wei Xu ◽  
Fuzhou Gong ◽  
Guangyan Zhou
2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Manuel Bodirsky ◽  
Bertalan Bodor

Abstract Let K exp + \mathcal{K}_{{\operatorname{exp}}{+}} be the class of all structures 𝔄 such that the automorphism group of 𝔄 has at most c ⁢ n d ⁢ n cn^{dn} orbits in its componentwise action on the set of 𝑛-tuples with pairwise distinct entries, for some constants c , d c,d with d < 1 d<1 . We show that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of finite covers of first-order reducts of unary structures, and also that K exp + \mathcal{K}_{{\operatorname{exp}}{+}} is precisely the class of first-order reducts of finite covers of unary structures. It follows that the class of first-order reducts of finite covers of unary structures is closed under taking model companions and model-complete cores, which is an important property when studying the constraint satisfaction problem for structures from K exp + \mathcal{K}_{{\operatorname{exp}}{+}} . We also show that Thomas’ conjecture holds for K exp + \mathcal{K}_{{\operatorname{exp}}{+}} : all structures in K exp + \mathcal{K}_{{\operatorname{exp}}{+}} have finitely many first-order reducts up to first-order interdefinability.


2018 ◽  
Vol 179 ◽  
pp. 03024 ◽  
Author(s):  
Yao Pan ◽  
Zhong Ming Chi ◽  
Qi Long Rao ◽  
Kai Peng Sun ◽  
Yi Nan Liu

Mission planning problem for remote sensing satellite imaging is studied. Firstly, the time constraint satisfaction problem model is presented after analyzing the characteristic of time constraint. Then, An optimal path searching algorithm based on the discrete time window is proposed according to the non-uniqueness for satellite to mission in the visible time window. Simulation results verify the efficiency of the model and algorithm.


Sign in / Sign up

Export Citation Format

Share Document