Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 216–226 (1978)
2. Bodirsky, M., Kára, J.: The complexity of temporal constraint satisfaction problems. Journal of the ACM 57(2), 1–41 (2009); An extended abstract appeared in the Proceedings of the Symposium on Theory of Computing (STOC 2008)
3. Garey, M., Johnson, D.: A guide to NP-completeness. CSLI Press, Stanford (1978)
4. Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: A revised report. Reading in Qualitative Reasoning about Physical Systems, 373–381 (1989)
5. Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM 42(1), 43–66 (1995)