{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:58:35Z","timestamp":1743015515961,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_9","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"94-108","source":"Crossref","is-referenced-by-count":4,"title":["Quantified Positive Temporal Constraints"],"prefix":"10.1007","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Wrona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of 25th ACM Symposium on the Theory of Computing (STOC), pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM\u00a044, 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, Canada, pp. 649\u2013658 (2002)","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"9_CR5","volume-title":"Handbook of Constraint Programming","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P.: The complexity of constraints languages. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"issue":"11","key":"9_CR6","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"key":"9_CR7","first-page":"83","volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001)","author":"A. Krokhin","year":"2001","unstructured":"Krokhin, A., Jeavons, P., Jonsson, P.: A complete classification of complexity in Allens algebra in the presence of a non-trivial basic relation. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 83\u201388. Morgan Kaufmann, San Francisco (2001)"},{"key":"9_CR8","unstructured":"Bodirsky, M.: Constraint Satisfaction Problems with Infinite Domains. PhD thesis, Humboldt-Universit\u00e4t zu Berlin (2004), http:\/\/www2.informatik.hu-berlin.de\/~bodirsky\/publications\/diss.html"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-540-45220-1_6","volume-title":"Computer Science Logic","author":"F. Boerner","year":"2003","unstructured":"Boerner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: Algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 58\u201370. Springer, Heidelberg (2003)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11753728_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of equality constraint languages. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 114\u2013126. Springer, Heidelberg (2006)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/LICS.2007.38","volume-title":"22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Proceedings","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Chen, H.: Quantified equality constraints. In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Proceedings, Wroclaw, Poland, July 10-12, pp. 203\u2013212. IEEE Computer Society, Los Alamitos (2007)"},{"key":"9_CR12","first-page":"29","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"M. Bodirsky","year":"2008","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. In: Ladner, R.E., Dwork, C. (eds.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, pp. 29\u201338. ACM, New York (2008)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Charatonik, W., Wrona, M.: Tractable positive quantified constraint satisfaction problems (submitted, 2008), http:\/\/www.ii.uni.wroc.pl\/~mwrona\/publications\/TQP.pdf","DOI":"10.1007\/978-3-540-89439-1_38"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-74915-8_17","volume-title":"Computer Science Logic","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Chen, H.: Qualitative temporal and spatial reasoning revisited. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 194\u2013207. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S009753970037727X","volume":"33","author":"R.H. M\u00f6hring","year":"2004","unstructured":"M\u00f6hring, R.H., Skutella, M., Stork, F.: Scheduling with and\/or precedence constraints. SIAM J. Comput.\u00a033(2), 393\u2013415 (2004)","journal-title":"SIAM J. Comput."},{"key":"9_CR16","volume-title":"A Shorter Model Theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:04:31Z","timestamp":1738350271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}