{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:40Z","timestamp":1725896920949},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_7","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T20:56:20Z","timestamp":1342817780000},"page":"33-38","source":"Crossref","is-referenced-by-count":0,"title":["k-Optimal: A Novel Approximate Inference Algorithm for ProbLog"],"prefix":"10.1007","author":[{"given":"Joris","family":"Renkens","sequence":"first","affiliation":[]},{"given":"Guy","family":"Van den Broeck","sequence":"additional","affiliation":[]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Van den Broeck, G., Thon, I., van Otterlo, M., De Raedt, L.: DTProbLog: A Decision-Theoretic Probabilistic Prolog. AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7755"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science (1977)","DOI":"10.1287\/mnsc.23.8.789"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015, 20\u201339 (2006)","journal-title":"Computational Complexity"},{"issue":"13","key":"7_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/bioinformatics\/btm170","volume":"23","author":"O. Ourfali","year":"2007","unstructured":"Ourfali, O., Shlomi, T., Ideker, T., Ruppin, E., Sharan, R.: Spine: a framework for signaling-regulatory pathway inference from cause-effect experiments. Bioinformatics\u00a023(13), 359\u2013366 (2007)","journal-title":"Bioinformatics"},{"key":"7_CR6","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI, pp. 2462\u20132467 (2007)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Kimmig, A., Gutmann, B., Kersting, K., Santos Costa, V., Toivonen, H.: Probabilistic inductive querying using ProbLog. In: Inductive Databases and Constraint-Based Data Mining, pp. 229\u2013262 (2010)","DOI":"10.1007\/978-1-4419-7738-0_10"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:19:00Z","timestamp":1687605540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}