暂无分享,去创建一个
[1] Francesca Rossi,et al. Fundamental properties of networks of constraints: A new formulation , 1988 .
[2] Samson Abramsky,et al. Relational Hidden Variables and Non-Locality , 2010, Studia Logica.
[3] Eugene C. Freuder,et al. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..
[4] B. Tech,et al. ALGORITHMIC COMPLEXITY OF SOME CONSTRAINT SATISFACTION PROBLEMS , 1995 .
[5] Christian Bessiere,et al. Constraint Propagation , 2006, Handbook of Constraint Programming.
[6] Martin Gebser,et al. Solution Enumeration for Projected Boolean Search Problems , 2009, CPAIOR.
[7] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[8] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[9] Rina Dechter,et al. From Local to Global Consistency , 1990, Artif. Intell..
[10] Christophe Lecoutre,et al. Constraint Networks: Techniques and Algorithms , 2009 .
[11] Artificial Intelligence and Symbolic Mathematical Computation , 1996, Lecture Notes in Computer Science.
[12] Knut Åkesson,et al. Enumeration of Valid Partial Configurations , 2011, Configuration Workshop.
[13] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..
[14] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[15] Rina Dechter,et al. Structure Identification in Relational Data , 1992, Artif. Intell..
[16] David Maier,et al. The Theory of Relational Databases , 1983 .
[17] Jakub Závodný,et al. Factorised Representations of Query Results , 2011, ArXiv.
[18] Martin Gebser,et al. Conflict-Driven Answer Set Enumeration , 2007, LPNMR.
[19] Mihalis Yannakakis,et al. On the Complexity of Testing Implications of Functional and Join Dependencies , 1981, JACM.
[20] Robert Rodosek,et al. A New Approach on Solving 3-Satisfiability , 1996, AISMC.
[21] Mihalis Yannakakis,et al. Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..
[22] Georg Gottlob,et al. Hypertree Decompositions: A Survey , 2001, MFCS.
[23] Bart Selman,et al. A General Framework for Knowledge Compilation , 1991, PDK.
[24] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[25] Markus Stumptner,et al. Configuring Large Systems Using Generative Constraint Satisfaction , 1998, IEEE Intell. Syst..
[26] Marco Cadoli,et al. A Survey on Knowledge Compilation , 1997, AI Commun..
[27] David A. Cohen,et al. Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems , 2005, CP.
[28] Christoph Koch,et al. World-set decompositions: Expressiveness and efficient algorithms , 2007, Theor. Comput. Sci..
[29] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[30] Georg Gottlob,et al. Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..
[31] Tiziano Villa,et al. Complexity of two-level logic minimization , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.