{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:45Z","timestamp":1725489345296},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_2","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"2-18","source":"Crossref","is-referenced-by-count":10,"title":["Challenges in Satisfiability Modulo Theories"],"prefix":"10.1007","author":[{"given":"Robert","family":"Nieuwenhuis","sequence":"first","affiliation":[]},{"given":"Albert","family":"Oliveras","sequence":"additional","affiliation":[]},{"given":"Enric","family":"Rodr\u00edguez-Carbonell","sequence":"additional","affiliation":[]},{"given":"Albert","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/11532231_23","volume-title":"Proceedings of the 20th Conference on Automated Deduction","author":"M. Bozzano","year":"2005","unstructured":"Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., van Rossum, P., Schulz, S., Sebastiani, R.: System description: MathSAT 3. In: Nieuwenhuis, R. (ed.) Proceedings of the 20th Conference on Automated Deduction. LNCS (LNAI), vol.\u00a03632, pp. 315\u2013321. Springer, Heidelberg (2005)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-58179-0_44","volume-title":"Computer Aided Verification","author":"J.R. Burch","year":"1994","unstructured":"Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 68\u201380. Springer, Heidelberg (1994)"},{"key":"2_CR3","unstructured":"Barrett, C., Tinelli, C.: CVC3. In: Computer Aided Verification, 19th International Conference (CAV). Springer LNCS (to appear, 2007)"},{"key":"2_CR4","unstructured":"Dutertre, B., de Moura, L.: The YICES SMT Solver (2006), http:\/\/yices.csl.sri.com\/tool-paper.pdf"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B. Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"issue":"7","key":"2_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Comm. of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Comm. of the ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"de Moura, L., Bjorner, N.: Efficient E-matching for SMT Solvers. In: xx, (submitted 2007)","DOI":"10.1007\/978-3-540-73595-3_13"},{"key":"2_CR8","unstructured":"Detlefs, D.L., Nelson, G., Saxe, J.: Simplify: the ESC theorem prover. Technical report, Compaq (December 1996)"},{"key":"2_CR9","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":"4","key":"2_CR10","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpressions problem. J. of the Association for Computing Machinery\u00a027(4), 758\u2013771 (1980)","journal-title":"J. of the Association for Computing Machinery"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT) pp. 502\u2013518 (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"2_CR12","unstructured":"ILOG. ilog cplex, http:\/\/www.ilog.com\/products\/cplex"},{"key":"2_CR13","first-page":"351","volume-title":"17th International Joint Conference on Artificial Intelligence, IJCAI 2001","author":"H.A. Kautz","year":"2001","unstructured":"Kautz, H.A., Ruan, Y., Achlioptas, D., Gomes, C.P., Selman, B., Stickel, M.E.: Balance and Filtering in Structured Satisfiable Problems. In: Nebel, B. (ed.) 17th International Joint Conference on Artificial Intelligence, IJCAI 2001, pp. 351\u2013358. Morgan Kaufmann, San Francisco (2001)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. 38th Design Automation Conference (DAC 2001) (2001)","DOI":"10.1145\/378239.379017"},{"issue":"5","key":"2_CR15","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput.\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/11513988_33","volume-title":"Computer Aided Verification","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A.: DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-540-32033-3_33","volume-title":"Term Rewriting and Applications","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A.: Proof-Producing Congruence Closure. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 453\u2013468. Springer, Heidelberg (2005)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11814948_18","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A.: On sat modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 156\u2013169. Springer, Heidelberg (2006)"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ic.2006.08.009","volume":"205","author":"R. Nieuwenhuis","year":"2007","unstructured":"Nieuwenhuis, R., Oliveras, A.: Fast congruence closure and extensions. Information and Computation\u00a0205(4), 557\u2013580 (2007)","journal-title":"Information and Computation"},{"issue":"6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). Journal of the ACM\u00a053(6), 937\u2013977 (2006)","journal-title":"Journal of the ACM"},{"key":"2_CR21","unstructured":"R\u00e9gin, J-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of 12th National Conference on AI (AAAI 1994), vol.\u00a01, pp. 362\u2013367, Seattle, (July 31 - August 4, 1994)"},{"key":"2_CR22","unstructured":"Ranise, S., Tinelli, C.: The SMT-LIB Format: An Initial Proposal. In: Proceedings of the 1st Workshop on Pragmatics of Decision Procedures in Automated Reasoning, Miami (2003)"},{"key":"2_CR23","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point +Approach","author":"C. Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.P.: Theory and Algorithms for Linear Optimization: An Interior Point +Approach. Wiley, Chichester, UK (1997)"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2006.01.009","volume":"98","author":"A. Stump","year":"2006","unstructured":"Stump, A., L\u00f6chner, B.: Knuth-bendix completion of theories of commuting group endomorphisms. Inf. Process. Lett.\u00a098(5), 195\u2013198 (2006)","journal-title":"Inf. Process. Lett."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/978-3-540-32033-3_34","volume-title":"Term Rewriting and Applications","author":"A. Stump","year":"2005","unstructured":"Stump, A., Tan, L.-Y.: The algebra of equality proofs. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 469\u2013483. Springer, Heidelberg (2005)"},{"volume-title":"Interior Point Methods of Mathematical Programming, Applied Optimization","year":"1996","key":"2_CR26","unstructured":"Terlaky, T. (ed.): Interior Point Methods of Mathematical Programming, Applied Optimization, vol.\u00a05. Kluwer Academic Publishers, Dordrecht (1996)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:33Z","timestamp":1619518353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}