{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:18:24Z","timestamp":1725520704702},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_36","type":"book-chapter","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T22:03:10Z","timestamp":1226700190000},"page":"512-527","source":"Crossref","is-referenced-by-count":12,"title":["Variable Dependencies of Quantified CSPs"],"prefix":"10.1007","author":[{"given":"Marko","family":"Samer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36126-X_12","volume-title":"Proc. 4th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2002)","author":"A. Ayari","year":"2002","unstructured":"Ayari, A., Basin, D.: Qubos: Deciding quantified Boolean logic using propositional satisfiability solvers. In: FMCAD 2002. LNCS, vol.\u00a02517, pp. 187\u2013201. Springer, Heidelberg (2002)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11499107_28","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Benedetti","year":"2005","unstructured":"Benedetti, M.: Quantifier trees for QBFS. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 378\u2013385. Springer, Heidelberg (2005)"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11532231_27","volume-title":"Automated Deduction \u2013 CADE-20","author":"M. Benedetti","year":"2005","unstructured":"Benedetti, M.: sKizzo: A suite to evaluate and certify QBFS. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 369\u2013376. Springer, Heidelberg (2005)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11527695_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Biere","year":"2005","unstructured":"Biere, A.: Resolve and expand. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"36_CR5","first-page":"360","volume-title":"Proc. 20th National Conference on Artificial Intelligence (AAAI 2005)","author":"L. Bordeaux","year":"2005","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: Proc. 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 360\u2013365. AAAI Press, Menlo Park (2005)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/1244002.1244078","volume-title":"Proc. 22nd ACM Symposium on Applied Computing (SAC 2007)","author":"L. Bordeaux","year":"2007","unstructured":"Bordeaux, L., Zhang, L.: A solver for quantified Boolean and linear constraints. In: SAC 2007, pp. 321\u2013325. ACM Press, New York (2007)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-45220-1_6","volume-title":"Computer Science Logic","author":"F. B\u00f6rner","year":"2003","unstructured":"B\u00f6rner, 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":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-72788-0_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"U. Bubeck","year":"2007","unstructured":"Bubeck, U., Kleine B\u00fcning, H.: Bounded universal expansion for preprocessing QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 244\u2013257. Springer, Heidelberg (2007)"},{"key":"36_CR9","first-page":"161","volume-title":"Proc. 16th European Conference on Artificial Intelligence (ECAI 2004)","author":"H. Chen","year":"2004","unstructured":"Chen, H.: Quantified constraint satisfaction and bounded treewidth. In: Proc. 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 161\u2013165. IOS Press, Amsterdam (2004)"},{"key":"36_CR10","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"36_CR11","unstructured":"Egly, U., Tompits, H., Woltran, S.: On quantifier shifting for quantified Boolean formulas. In: Proc. SAT 2002 Workshop on Theory and Applications of Quantified Boolean Formulas, Informal Proceedings, pp. 48\u201361 (2002)"},{"key":"36_CR12","unstructured":"Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A solver for quantified constraint satisfaction problems. In: Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 138\u2013143. Professional Book Center (2005)"},{"key":"36_CR13","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: The complexity of quantified constraint satisfaction problems under structural restrictions. In: Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 150\u2013155. Professional Book Center (2005)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-79719-7_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"F. Lonsing","year":"2008","unstructured":"Lonsing, F., Biere, A.: Nenofex: Expanding NNF for QBF solving. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 196\u2013210. Springer, Heidelberg (2008)"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-72788-0_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M. Samer","year":"2007","unstructured":"Samer, M., Szeider, S.: Backdoor sets of quantified boolean formulas. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 230\u2013243. Springer, Heidelberg (2007)"},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal of Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:04:46Z","timestamp":1548385486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}