{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:43:55Z","timestamp":1725522235530},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_70","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"749-753","source":"Crossref","is-referenced-by-count":3,"title":["Telecommunications Feature Subscription as a Partial Order Constraint Problem"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Vitaly","family":"Lagoon","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"70_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-85958-1_5","volume-title":"Principles and Practice of Constraint Programming","author":"D. Lesaint","year":"2008","unstructured":"Lesaint, D., Mehta, D., O\u2019Sullivan, B., Quesada, L.O., Wilson, N.: Solving a telecommunications feature subscription configuration problem. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 67\u201381. Springer, Heidelberg (2008)"},{"key":"70_CR2","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Solving partial order constraints for LPO termination. Journal on Satisfiability, Boolean Modeling and Computation 5, 193\u2013215 (2008), An earlier version appears in: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 4\u201318. Springer, Heidelberg (2006)"},{"key":"70_CR3","unstructured":"Wielemaker, J.: An overview of the SWI-Prolog programming environment. In: Mesnard, F., Serebenik, A. (eds.) Proceedings of the 13th International Workshop on Logic Programming Environments. CW 371, KU Leuven, December 2003, pp. 1\u201316 (2003)"},{"key":"70_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"1","key":"70_CR5","first-page":"121","volume":"8","author":"M. Codish","year":"2008","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. TPLP\u00a08(1), 121\u2013128 (2008)","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T12:25:15Z","timestamp":1551702315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}