{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:11:28Z","timestamp":1753888288541,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_10","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"137-151","source":"Crossref","is-referenced-by-count":23,"title":["SAT Modulo Graphs: Acyclicity"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jussi","family":"Rintanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45620-1_17","volume-title":"Automated Deduction - CADE-18","author":"G. Audemard","year":"2002","unstructured":"Audemard, G., Bertoli, P.G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: A SAT based approach for solving formulas over Boolean and linear mathematical propositions. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 195\u2013210. Springer, Heidelberg (2002)"},{"key":"10_CR2","unstructured":"Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K. (eds.) Advances in Neural Information Processing Systems 26, pp. 1349\u20131357 (2014)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S. Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 170\u2013183. Springer, Heidelberg (2006)"},{"key":"10_CR4","unstructured":"Cussens, J.: Bayesian network learning by compiling to weighted MAX-SAT. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 105\u2013112. AUAI Press (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Denecker, M., Ternovska, E.: A logic of nonmonotone inductive definitions. ACM Transactions on Computational Logic 9(2), 14:1\u201314:52 (2008)","DOI":"10.1145\/1342991.1342998"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.E.: Cp(graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11889205_13","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"G. Dooms","year":"2006","unstructured":"Dooms, G., Katriel, I.: The minimum spanning tree constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 152\u2013166. Springer, Heidelberg (2006)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Proceedings of the 21st European Conference on Artificial Intelligence, ECAI 2014. IOS Press (2014)","DOI":"10.1007\/978-3-319-11558-0_10"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.jcss.2011.05.004","volume":"78","author":"K. Heljanko","year":"2012","unstructured":"Heljanko, K., Kein\u00e4nen, M., Lange, M., Niemel\u00e4, I.: Solving parity games by a reduction to SAT. Journal for Computer and System Sciences\u00a078(2), 430\u2013440 (2012)","journal-title":"Journal for Computer and System Sciences"},{"key":"10_CR10","unstructured":"Hoffmann, H.F., van Beek, P.: A global acyclicity constraint for Bayesian network structure learning (September 2013) (unpublished manuscript in the Doctoral Program of the International Conference on Principles and Practice of Constraint Programming)"},{"issue":"1-2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0004-3702(02)00385-5","volume":"144","author":"T. Janhunen","year":"2003","unstructured":"Janhunen, T.: Evaluating the effect of semi-normality on the expressiveness of defaults. Artificial Intelligence\u00a0144(1-2), 233\u2013250 (2003)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics\u00a016(1-2), 35\u201386 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"10_CR13","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pp. 1194\u20131201. AAAI Press (1996)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence Journal\u00a0157(1), 115\u2013137 (2004)","journal-title":"Artificial Intelligence Journal"},{"key":"10_CR15","unstructured":"Mahfoudh, M., Niebert, P., Asarin, E., Maler, O.: A satisfiability checker for difference logic. In: Proceedings of SAT 2002 \u2013 Theory and Applications of Satisfiability Testing, vol.\u00a02, pp. 222\u2013230 (2002)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A new search algorithm for satisfiability. In: 1996 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 1996. Digest of Technical Papers, pp. 220\u2013227 (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"10_CR17","first-page":"112","volume":"85","author":"D.G. Mitchell","year":"2005","unstructured":"Mitchell, D.G.: A SAT solver primer. EATCS Bulletin\u00a085, 112\u2013133 (2005)","journal-title":"EATCS Bulletin"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th ACM\/IEEE Design Automation Conference (DAC 2001), pp. 530\u2013535. ACM Press (2001)","DOI":"10.1145\/378239.379017"},{"issue":"1-4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9118-9","volume":"53","author":"I. Niemel\u00e4","year":"2008","unstructured":"Niemel\u00e4, I.: Stable models and difference logic. Annals of Mathematics and Artificial Intelligence\u00a053(1-4), 313\u2013329 (2008)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11513988_33","volume-title":"Computer Aided Verification","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"key":"10_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-30227-8_27","volume-title":"Logics in Artificial Intelligence","author":"J. Rintanen","year":"2004","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Parallel encodings of classical planning as satisfiability. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 307\u2013319. Springer, Heidelberg (2004)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11527695_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Subbarayan","year":"2005","unstructured":"Subbarayan, S., Pradhan, D.K.: NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 276\u2013291. Springer, Heidelberg (2005)"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N. Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints\u00a014(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR25","unstructured":"Wolfman, S.A., Weld, D.S.: The LPSAT engine & its application to resource planning. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 310\u2013315. Morgan Kaufmann Publishers (1999)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:54:57Z","timestamp":1746377697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}