{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:31:53Z","timestamp":1743067913393,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_43","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"566-570","source":"Crossref","is-referenced-by-count":2,"title":["Test Strategy Generation Using Quantified CSPs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Sachenbacher","sequence":"first","affiliation":[]},{"given":"Paul","family":"Maier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: QCSP Made Practical by Virtue of Restricted Quantification. In: Proceedings IJCAI 2007 (2007)","key":"43_CR1"},{"key":"43_CR2","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a03632. Springer, Heidelberg (2005)"},{"unstructured":"Brand, S.: Sequential Automatic Test Pattern Generation by Constraint Programming. In: Proc. CP 2001 Workshop on Modelling and Problem Formulation (2001)","key":"43_CR3"},{"unstructured":"Cimatti, A., Pecheur, C., Cavada, R.: Formal Verification of Diagnosability via Symbolic Model Checking. In: Proceedings IJCAI 2005 (2003)","key":"43_CR4"},{"unstructured":"Esser, M., Struss, P.: Fault-Model-Based Test Generation for Embedded Software. In: Proceedings IJCAI 2007 (2007)","key":"43_CR5"},{"issue":"1","key":"43_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/43.108614","volume":"2","author":"T. Larrabee","year":"1992","unstructured":"Larrabee, T.: Test Pattern Generation Using Boolean Satisfiability. IEEE Transactions on Computer-Aided Design\u00a02(1), 4\u201315 (1992)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1-2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.artint.2004.01.005","volume":"162","author":"M. Sachenbacher","year":"2005","unstructured":"Sachenbacher, M., Struss, P.: Task-dependent Qualitative Domain Abstraction. Artificial Intelligence\u00a0162(1-2), 121\u2013143 (2005)","journal-title":"Artificial Intelligence"},{"unstructured":"Struss, P.: Testing Physical Systems. In: Proceedings AAAI 1994 (1994)","key":"43_CR8"},{"key":"43_CR9","volume-title":"Readings in Qualitative Reasoning About Physical Systems","author":"D. Weld","year":"1990","unstructured":"Weld, D., de Kleer, J.: Readings in Qualitative Reasoning About Physical Systems. Morgan Kaufmann Publishers, San Francisco (1990)"},{"issue":"1","key":"43_CR10","first-page":"212","volume":"91","author":"B.C. Williams","year":"2003","unstructured":"Williams, B.C., Ingham, M., Chung, S., Elliott, P.: Model-based Programming of Intelligent Embedded Systems and Robotic Space Explorers. Proceedings IEEE Special Issue on Modeling and Design of Embedded Software\u00a091(1), 212\u2013237 (2003)","journal-title":"Proceedings IEEE Special Issue on Modeling and Design of Embedded Software"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:07:18Z","timestamp":1715238438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}