{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:05:38Z","timestamp":1783397138403,"version":"3.54.6"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10601-023-09342-7","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T14:46:02Z","timestamp":1675262762000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An interdisciplinary experimental evaluation on the disjunctive temporal problem"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6696-2972","authenticated-orcid":false,"given":"Matteo","family":"Zavatteri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alice","family":"Raffaele","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Ostuni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,1]]},"reference":[{"issue":"1","key":"9342_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1), 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"9342_CR2","unstructured":"Oddi, A., & Cesta, A. (2000). Incremental forward checking for the disjunctive temporal problem. In ECAI 2000. IOS Press, pp. 108\u2013112."},{"key":"9342_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0004-3702(00)00019-9","volume":"120","author":"K Stergiou","year":"2000","unstructured":"Stergiou, K., & Koubarakis, M. (2000). Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence, 120, 81\u2013117.","journal-title":"Artificial Intelligence"},{"key":"9342_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","volume":"151","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., & Pollack, M. (2003). Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 151, 43\u201389.","journal-title":"Artificial Intelligence"},{"key":"9342_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.artint.2012.10.001","volume":"195","author":"P Jonsson","year":"2013","unstructured":"Jonsson, P., & L\u00f6\u00f6w, T. (2013). Computational complexity of linear constraints over the integers. Artificial Intelligence, 195, 44\u201362.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9342_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154832","volume":"65","author":"M Bodirsky","year":"2018","unstructured":"Bodirsky, M., Martin, B., & Mottet, A. (2018). Discrete temporal constraint satisfaction problems. Journal of the ACM (JACM), 65(2), 1\u201341.","journal-title":"Journal of the ACM (JACM)"},{"key":"9342_CR7","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., & Tinelli, C. (2009). Satisfiability modulo theories. In Handbook of satisfiability, vol. 185 of frontiers in artificial intelligence and applications. IOS Press, pp. 825\u2013885."},{"key":"9342_CR8","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Micheli, A., & Roveri, M. (2012). Solving temporal problems using SMT: strong controllability. In CP 2012. Springer, pp. 248\u2013264.","DOI":"10.1007\/978-3-642-33558-7_20"},{"key":"9342_CR9","unstructured":"Katz, R.H., & Borriello, G. (2005). Contemporary logic design (2. ed.). Pearson education."},{"key":"9342_CR10","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S. (1983). On the complexity of derivation in propositional calculus. In Automation of reasoning. Springer, pp. 466\u2013483.","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"9342_CR11","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., & Tack, G. (2007). MiniZinc: towards a standard CP modelling language. In CP 2007, vol. 4741 of LNCS. Springer, pp. 529\u2013543.","DOI":"10.1007\/978-3-540-74970-7_38"},{"issue":"2","key":"9342_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1609\/aimag.v35i2.2539","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., & Fischer, J. (2014). The minizinc challenge, pp. 2008\u20132013. AI Magazine, 35(2), 55\u201360.","journal-title":"AI Magazine"},{"key":"9342_CR13","unstructured":"(2020). Stanford University and University of Iowa.: CVC4. Available from: https:\/\/cvc4.github.io."},{"key":"9342_CR14","unstructured":"(2013). FBK and DISI-University of Trento.: MathSAT. Available from: https:\/\/mathsat.fbk.eu."},{"key":"9342_CR15","unstructured":"D\u00e9harbe, D., Fontaine, P., & Barbosa, H. (2011). The veriT solver. Available from: https:\/\/verit.loria.fr."},{"key":"9342_CR16","unstructured":"(2015). SRI International\u2019s computer science laboratory.: the Yices SMT solver. Available from: https:\/\/yices.csl.sri.com."},{"key":"9342_CR17","unstructured":"(2018). Microsoft research.: z3 theorem prover. Available from: https:\/\/github.com\/Z3Prover."},{"key":"9342_CR18","doi-asserted-by":"crossref","unstructured":"Hyv\u00e4rinen, A.E.J., Marescotti, M., Alt, L., & Sharygina, N. (2016). OpenSMT2: an SMT solver for multi-core and cloud computing. In SAT 2016, vol. 9710 of LNCS. Springer, pp. 547\u2013553.","DOI":"10.1007\/978-3-319-40970-2_35"},{"key":"9342_CR19","unstructured":"(2022). IBM.: ILOG CPLEX optimization studio. Available from: https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio."},{"key":"9342_CR20","unstructured":"(2021). Gurobi optimization, LLC.: gurobi optimizer reference manual. Available from: http:\/\/www.gurobi.com."},{"key":"9342_CR21","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.K., Eifler, L., Gasse, M., & et al. (2020). The SCIP optimization suite 7.0. Optimization online. Available from: http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html."},{"key":"9342_CR22","unstructured":"Forrest, J., Ralphs, T., Vigerske, S., LouHafer, Kristjansson, B., Jpfasano, & et al. (2021). Coin-or\/Cbc: version 2.9.9. Zenodo."},{"key":"9342_CR23","unstructured":"Biere, A., Fazekas, K., Fleury, M., & Heisinger, M. (2020). SAT competition."},{"key":"9342_CR24","doi-asserted-by":"crossref","unstructured":"Soos, M., Nohl, K., & Castelluccia, C. (2009). Extending SAT solvers to cryptographic problems. In SAT 2009, vol. 5584 of LNCS. Springer, pp. 244\u2013257.","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"9342_CR25","unstructured":"Biere, A. (2020). Kissat. Available from: http:\/\/fmv.jku.at\/kissat\/."},{"key":"9342_CR26","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., & Francis, K. (2022). Chuffed, a lazy clause generation solver. Available from: https:\/\/github.com\/chuffed\/chuffed."},{"key":"9342_CR27","unstructured":"Schulte, C. (2022). Gecode. Available from: https:\/\/www.gecode.org."},{"key":"9342_CR28","unstructured":"Perron, L., & Furnon, V. (2022). OR-tools. Available from: https:\/\/developers.google.com\/optimization\/."},{"key":"9342_CR29","doi-asserted-by":"crossref","unstructured":"Ohrimenko, O., Stuckey, P.J., & Codish, M. (2007). Propagation = lazy clause generation. In CP 2007. Springer, pp. 544\u2013558.","DOI":"10.1007\/978-3-540-74970-7_39"},{"key":"9342_CR30","unstructured":"Biere, A., Heule, M., van Maaren, H., & Walsh, T. (2009). Conflict-driven clause learning sat solvers. Handbook of satisfiability. Frontiers in Artificial Intelligence and Applications, pp. 131\u2013153."},{"key":"9342_CR31","unstructured":"(2022). Department of computer science \u2013 University of Verona.: centro piattaforme tecnologiche. Available from: https:\/\/cpt.univr.it\/en\/."},{"key":"9342_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-014-9167-5","volume":"20","author":"A Cimatti","year":"2014","unstructured":"Cimatti, A., Micheli, A., & Roveri, M. (2014). Solving strong controllability of temporal problems with uncertainty using SMT. Constraints, 20, 1\u201329.","journal-title":"Constraints"},{"key":"9342_CR33","doi-asserted-by":"crossref","unstructured":"Armando, A., Castellini, C., & Giunchiglia, E. (2000). SAT-based procedures for temporal reasoning. In Recent advances in AI planning. Springer, pp. 97\u2013108.","DOI":"10.1007\/10720246_8"},{"key":"9342_CR34","unstructured":"Posenato, R. (2022). CSTN(U) benchmarks. Available from: http:\/\/profs.scienze.univr.it\/posenato\/software\/cstnu\/benchmarkWrapper.html."},{"key":"9342_CR35","unstructured":"Zavatteri, M. (2017). Conditional simple temporal networks with uncertainty and decisions. In TIME 2017, vol. 90. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 23:1\u201323:17."},{"key":"9342_CR36","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2018.09.023","volume":"797","author":"M Zavatteri","year":"2019","unstructured":"Zavatteri, M., & Vigan\u00f2, L. (2019). Conditional simple temporal networks with uncertainty and decisions. Theoretical Computer Science, 797, 77\u2013101.","journal-title":"Theoretical Computer Science"},{"key":"9342_CR37","unstructured":"Zavatteri, M., Rizzi, R., & Villa, T. (2019). Strong controllability of temporal networks with decisions. In OVERLAY 2019, vol. 2509. CEUR-WS.org, pp. 77\u201382."},{"key":"9342_CR38","unstructured":"Zavatteri, M., Combi, C., Rizzi, R., & Vigan\u00f2, L. (2019). Hybrid SAT-based consistency checking algorithms for simple temporal networks with decisions. In TIME 2019, vol. 147. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 2:1\u20132:17."},{"key":"9342_CR39","doi-asserted-by":"crossref","unstructured":"Zavatteri, M., Combi, C., Rizzi, R., & Vigan\u00f2, L. (2021). Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way. Information and Computation, vol. 280.","DOI":"10.1016\/j.ic.2020.104637"},{"key":"9342_CR40","unstructured":"Spence, I. (2017). Balanced random SAT Benchmarks SAT COMPETITION 2017, p. 53."},{"key":"9342_CR41","unstructured":"Escamocher, G., O\u2019Sullivan, B., & Prestwich, S.D. (2019). Generating difficult sat instances by preventing triangles. arXiv:190303592."},{"key":"9342_CR42","doi-asserted-by":"crossref","unstructured":"Johnson, D.J., & Trick, M.A. (1996). Cliques, coloring, and satisfiability: second DIMACS implementation challenge. AMS.","DOI":"10.1090\/dimacs\/026"},{"key":"9342_CR43","unstructured":"Van Hoeve, W.J. (2001). The alldifferent constraint: a survey. arXiv:0105015."},{"key":"9342_CR44","first-page":"98","volume":"83","author":"M Haythorpe","year":"2018","unstructured":"Haythorpe, M. (2018). FHCP challenge set: the first set of structurally difficult instances of the hamiltonian cycle problem. Bull ICA, 83, 98\u2013107.","journal-title":"Bull ICA"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-023-09342-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-023-09342-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-023-09342-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T09:14:26Z","timestamp":1676538866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-023-09342-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,1]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["9342"],"URL":"https:\/\/doi.org\/10.1007\/s10601-023-09342-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,1]]},"assertion":[{"value":"9 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"none.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests and funding"}}]}}