{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T22:24:41Z","timestamp":1748298281930},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_34","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T07:21:30Z","timestamp":1378970490000},"page":"342-347","source":"Crossref","is-referenced-by-count":12,"title":["Matchmaking with Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Glase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orkunt","family":"Sabuncu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"34_CR2","unstructured":"Glase, T.: Timetabling with answer set programming. Diploma thesis, Institute for Informatics, University of Potsdam (2012)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-criteria optimization in answer set programming. In: ICLP 2011, pp. 1\u201310. Dagstuhl Publishing (2011)","DOI":"10.1007\/978-3-642-20895-9_7"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H. Cambazard","year":"2012","unstructured":"Cambazard, H., Hebrard, E., O\u2019Sullivan, B., Papadopoulos, A.: Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research\u00a0194(1), 111\u2013135 (2012)","journal-title":"Annals of Operations Research"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C., Nuijten, W.: Constraint-Based Scheduling. Springer (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"34_CR6","unstructured":"Ach\u00e1, R., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Annals of Operations Research (2012) (published online)"},{"key":"34_CR7","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Representing school timetabling in a disjunctive logic programming language. In: WLP 1998, pp. 43\u201352 (1998)"},{"key":"34_CR8","unstructured":"b2match, http:\/\/www.b2match.com\/info\/pages\/scheduling\/"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T21:59:55Z","timestamp":1646517595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}