Discrete Temporal Constraint Satisfaction Problems
暂无分享,去创建一个
[1] Michael Pinsker,et al. Schaefer's Theorem for Graphs , 2015, J. ACM.
[2] Manuel Bodirsky,et al. Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.
[3] Peter Jonsson,et al. Computational complexity of linear constraints over the integers , 2013, Artif. Intell..
[4] Enric Rodríguez-Carbonell,et al. The Max-Atom Problem and Its Relevance , 2008, LPAR.
[5] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[6] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[7] L. A. Kaluzhnin,et al. Galois theory for post algebras. I , 1969 .
[8] Barnaby Martin,et al. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[9] D. Geiger. CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .
[10] Jaroslav Nesetril,et al. Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..
[11] Rolf H. Möhring,et al. Scheduling with AND/OR Precedence Constraints , 2004, SIAM J. Comput..
[12] Dmitriy Zhuk,et al. A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[13] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .
[14] Tomás Feder,et al. Dichotomy for Digraph Homomorphism Problems , 2017, ArXiv.
[15] Manuel Bodirsky,et al. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[16] Manuel Bodirsky. Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..
[17] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .
[18] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[19] Dexter Kozen,et al. Results on the Propositional µ-Calculus , 1982, ICALP.
[20] George E. Collins,et al. Algorithms for the Solution of Systems of Linear Diophantine Equations , 1982, SIAM J. Comput..
[21] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.
[22] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Barnaby Martin,et al. Distance constraint satisfaction problems , 2016, Inf. Comput..
[24] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..