暂无分享,去创建一个
[1] P. Jeavons,et al. The complexity of constraint satisfaction : an algebraic approach. , 2005 .
[2] Ivo Düntsch,et al. Relation Algebras and their Application in Temporal and Spatial Reasoning , 2005, Artificial Intelligence Review.
[3] Peter Jonsson,et al. Twenty-One Large Tractable Subclasses of Allen's Algebra , 1997, Artif. Intell..
[4] Manuel Bodirsky,et al. Datalog and Constraint Satisfaction with Infinite Templates , 2006, STACS.
[5] Rolf H. Möhring,et al. Scheduling with AND/OR Precedence Constraints , 2004, SIAM J. Comput..
[6] Ágnes Szendrei,et al. Clones in universal algebra , 1986 .
[7] Phokion G. Kolaitis,et al. Conjunctive-query containment and constraint satisfaction , 1998, PODS.
[8] Peter B. Ladkin,et al. On binary constraint problems , 1994, JACM.
[9] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.
[10] 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..
[11] Manolis Koubarakis,et al. Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning , 2001, Theor. Comput. Sci..
[12] Peter Jeavons,et al. Building tractable disjunctive constraints , 2000, J. ACM.
[13] Peter van Beek,et al. Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..
[14] Gernot Salzer,et al. Complexity of Clausal Constraints Over Chains , 2008, Theory of Computing Systems.
[15] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.
[16] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .
[17] Roman Barták,et al. Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.
[18] Frank Harary,et al. Graph Theory , 2016 .
[19] Walter Guttmann,et al. Variations on an Ordering Theme with Constraints , 2006, IFIP TCS.
[20] Peter Jeavons,et al. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra , 2003, JACM.
[21] P. Jeavons. Structural Theory of Automata‚ Semigroups‚ and Universal Algebra , 2003 .
[22] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[23] Y. Gurevich. On Finite Model Theory , 1990 .
[24] Christer Bäckström,et al. A Unifying Approach to Temporal Constraint Reasoning , 1998, Artif. Intell..
[25] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[26] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[27] Henry Kautz,et al. Constraint propagation algorithms: A revised report , 1990 .
[28] Ron Shamir,et al. Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.
[29] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[30] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[31] Dov M. Gabbay,et al. Handbook of Temporal Reasoning in Artificial Intelligence , 2005, Handbook of Temporal Reasoning in Artificial Intelligence.
[32] D. Marker. Model theory : an introduction , 2002 .