{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:19:18Z","timestamp":1768907958829,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678663","type":"print"},{"value":"9783540446576","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720246_8","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T11:15:39Z","timestamp":1167390939000},"page":"97-108","source":"Crossref","is-referenced-by-count":37,"title":["SAT-Based Procedures for Temporal Reasoning"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Armando","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Castellini","sequence":"additional","affiliation":[]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Reasoning about Plans","year":"1991","unstructured":"Allen, J., Kautz, H., Pelavin, R. (eds.): Reasoning about Plans. Morgan Kaufmann, San Francisco (1991)"},{"key":"8_CR2","unstructured":"Brusoni, V., Console, L., Pernici, B., Terenziani, P.: LaTeR: An Efficient, General Purpose Manager of Temporal Information. IEEE Software (1996)"},{"key":"8_CR3","unstructured":"Buro, M., Buning, H.: Report on a SAT competition. Technical Report 110, University of Paderborn, Germany (November 1992)"},{"key":"8_CR4","unstructured":"Cheng, C.-C., Smith, S.F.: Generating feasible schedules under complex metric constraints. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), Seattle, Washington, USA, vol.\u00a02, pp. 1086\u20131091. AAAI Press\/MIT Press (1994)"},{"key":"8_CR5","unstructured":"Chleq, N.: Efficient algorithms for networks of quantitative temporal constraints. In: Proceedings of CONSTRAINTS 1995, April 1995, pp. 40\u201345 (1995)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF00156916","volume":"1","author":"M. D\u2019Agostino","year":"1992","unstructured":"D\u2019Agostino, M.: Are Tableaux an Improvement on Truth-Tables? Journal of Logic, Language and Information\u00a01, 235\u2013252 (1992)","journal-title":"Journal of Logic, Language and Information"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"issue":"1-3","key":"8_CR8","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.: Temporal constraint networks. Artificial Intelligence\u00a049(1-3), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"key":"8_CR9","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Deduction - Cade-13","author":"F. Giunchiglia","year":"1996","unstructured":"Giunchiglia, F., Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104. Springer, Heidelberg (1996)"},{"key":"8_CR11","unstructured":"Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT- Based Decision Procedures for Classical Modal Logics. Accepted for publication in Journal of Automated Reasoning (2000), Available at \n                  \n                    http:\/\/www.mrg.dist.unige.it\/~enrico"},{"key":"8_CR12","first-page":"263","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Acta Informatica\u00a014, 263\u2013313 (1980)","journal-title":"Acta Informatica"},{"key":"8_CR13","unstructured":"Jonsson, P., B\u00e4ckstr\u00f6m, C.: A linear- programming approach to temporal reasoning. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Menlo Park, August 4-8, pp. 1235\u20131241. AAAI Press \/ MIT Press (1996)"},{"issue":"1-2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(96)00124-7","volume":"171","author":"M. Koubarakis","year":"1997","unstructured":"Koubarakis, M.: The complexity of query evaluation in indefinite temporal constraint databases. Theoretical Computer Science\u00a0171(1-2), 25\u201360 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence\u00a09(3), 268\u2013299 (1993)","journal-title":"Computational Intelligence"},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R.M. Smullyan","year":"1968","unstructured":"Smullyan, R.M.: First-Order Logic. Springer, NY (1968)"},{"key":"8_CR17","unstructured":"Stergiou, K., Koubarakis, M.: Back tracking algorithms for disjunctions of temporal constraints. In: Proc. AAAI (1998)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in AI Planning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720246_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T23:38:02Z","timestamp":1552865882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720246_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678663","9783540446576"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10720246_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}