{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:23:52Z","timestamp":1725470632465},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540397281"},{"type":"electronic","value":"9783540397304"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11856290_20","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T07:36:09Z","timestamp":1158651369000},"page":"226-240","source":"Crossref","is-referenced-by-count":4,"title":["Finding Relations Among Linear Constraints"],"prefix":"10.1007","author":[{"given":"Jun","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongxing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-61551-2_68","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"B.M.W. Cheng","year":"1996","unstructured":"Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up constraint propagation by redundant modeling. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 91\u2013103. Springer, Heidelberg (1996)"},{"key":"20_CR2","unstructured":"Getoor, L., Ottosson, G., Fromherz, M., Carlson, B.: Effective redundant constraints for online scheduling. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI 1997), pp. 302\u2013307 (1997)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218194001000487","volume":"11","author":"J. Zhang","year":"2001","unstructured":"Zhang, J., Wang, X.: A constraint solver and its application to path feasibility analysis. International Journal of Software Engineering & Knowledge Engineering\u00a011, 139\u2013156 (2001)","journal-title":"International Journal of Software Engineering & Knowledge Engineering"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, J.: A path-based approach to the detection of infinite looping. In: Second Asia-Pacific Conference on Quality Software (APAQS 2001), pp. 88\u201394 (2001)","DOI":"10.1109\/APAQS.2001.990006"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Specification analysis and test data generation by solving Boolean combinations of numeric constraints. In: Proceedings of the First Asia-Pacific Conference on Quality Software, Hong Kong, pp. 267\u2013274 (2000)","DOI":"10.1109\/APAQ.2000.883800"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"SPIN Model Checking and Software Verification","author":"T. Ball","year":"2000","unstructured":"Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for Boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 113\u2013130. Springer, Heidelberg (2000)"},{"key":"20_CR8","unstructured":"Berkelaar, M.: LP_solve. A public domain Mixed Integer Linear Program solver (May 2003), Available at: \n                      \n                        http:\/\/groups.yahoo.com\/group\/lp_solve\/"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica\u00a04, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C.H. Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. Journal of Computer and System Sciences\u00a037(1), 2\u201313 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). In: Proceedings of the fourteenth annual ACM symposium on Theory of computing (STOC 1982), pp. 255\u2013260 (1982)","DOI":"10.1145\/800070.802199"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(\n                      \n                        \n                      \n                      $\\mathcal{R}$\n                    ) language and system. ACM Transactions on Programming Languages and Systems, 339\u2013395 (July 1992)","DOI":"10.1145\/129393.129398"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 25\u201341. Springer, Heidelberg (2005)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming\u00a019\/20, 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"20_CR15","unstructured":"Silva, J., Sakallah, K.: Conflict analysis in search algorithms for propositional satisfiability. In: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (ICTAI 1996), p. 467 (1996)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Bruni, R., Sassano, A.: Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae. In: Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (2001)","DOI":"10.1016\/S1571-0653(04)00320-8"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11856290_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:20:02Z","timestamp":1619508002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11856290_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540397281","9783540397304"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11856290_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}