{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:18:06Z","timestamp":1725596286763},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_8","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"76-87","source":"Crossref","is-referenced-by-count":0,"title":["Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 M.","family":"Casta\u00f1o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Casta\u00f1o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Aloul, F., Lynce, I., Prestwich, S.: Symmetry Breaking in Local Search for Unsatisfiability. In: 7th International Workshop on Symmetry and Constraint Satisfaction Problems, Providence, RI (2007)"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/764808.764839","volume-title":"ACM Great Lakes Symposium on VLSI","author":"F.A. Aloul","year":"2003","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: FORCE: a fast and easy-to-implement variable-ordering heuristic. In: ACM Great Lakes Symposium on VLSI, pp. 116\u2013119. ACM Press, New York (2003)"},{"key":"8_CR3","first-page":"731","volume-title":"DAC","author":"F.A. Aloul","year":"2002","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: DAC, pp. 731\u2013736. ACM Press, New York (2002)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Barton, G.E.: Computational complexity in two-level morphology. In: Proc. of the 24th ACL, New York, pp. 53\u201359 (1986)","DOI":"10.3115\/981131.981140"},{"key":"8_CR5","unstructured":"Beesley, K., Karttunen, L.: Finite State Morphology. CSLI Publications (2003)"},{"volume-title":"Handbook of Satisfiability","year":"2009","key":"8_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik. Grund. Math. 66\u201392 (1960)","DOI":"10.1002\/malq.19600060105"},{"key":"8_CR8","volume-title":"1st International Work-Conference on Linguistics, Biology and Computer Science: Interplays","author":"J. Casta\u00f1o","year":"2011","unstructured":"Casta\u00f1o, J.: Two views on crossing dependencies, language, biology and satisfiability. In: 1st International Work-Conference on Linguistics, Biology and Computer Science: Interplays. IOS Press, Amsterdam (2011)"},{"key":"8_CR9","unstructured":"Darwiche, A.: New Advances in Compiling CNF into Decomposable Negation Normal Form. In: ECAI, pp. 328\u2013332 (2004)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Decision problems of automata design and related arithmetics. Transactions of the American Mathematical Society (1961)","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-24605-3_30","volume-title":"Theory and Applications of Satisfiability Testing","author":"J. Franco","year":"2004","unstructured":"Franco, J., Kouril, M., Schlipf, J., Ward, J., Weaver, S., Dransfield, M.R., Vanfleet, W.M.: SBSAT: a state-based, BDD-based satisfiability solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 398\u2013410. Springer, Heidelberg (2004)"},{"key":"8_CR12","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"633","volume-title":"Handbook of Satisfiability","author":"C.P. Gomes","year":"2009","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model Counting. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 633\u2013654. IOS Press, Amsterdam (2009)"},{"key":"8_CR13","unstructured":"Hadzic, T., Hansen, E.R., O\u2019Sullivan, B.: On Automata. In: MDDs and BDDs in Constraint Satisfaction (2008)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing\u00a044, 279\u2013303 (1990)","journal-title":"Computing"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-55808-X_33","volume-title":"Mathematical Foundations of Computer Science 1992","author":"K. Lange","year":"1992","unstructured":"Lange, K., Rossmanith, P.: The emptiness problem for intersections of regular languages. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 346\u2013354. Springer, Heidelberg (1992)"},{"key":"8_CR16","volume-title":"Elements of the Theory of Computation","author":"H.R. Lewis","year":"1997","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall, Upper Saddle River (1997)","edition":"2"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Marek, V.W.: Introduction to Mathematics of Satisfiability. Chapman and Hall\/CRC (2010)","DOI":"10.1201\/9781439801741"},{"key":"8_CR18","unstructured":"Muise, C., Beck, J.C., McIlraith, S.: Fast d-DNNF Compilation with sharpSAT (2010)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/11753728_60","volume-title":"Computer Science \u2013 Theory and Applications","author":"C. Sinz","year":"2006","unstructured":"Sinz, C., Biere, A.: Extended resolution proofs for conjoining bDDs. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 600\u2013611. Springer, Heidelberg (2006)"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.7551\/mitpress\/3007.003.0012","volume-title":"Finite-State Language Processing","author":"P. Tapanainen","year":"1997","unstructured":"Tapanainen, P.: Applying a Finite-State Intersection Grammar. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 311\u2013327. MIT Press, Cambridge (1997)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M. Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 424\u2013429. Springer, Heidelberg (2006)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A. Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. J. ACM\u00a034(1), 209\u2013219 (1987)","journal-title":"J. ACM"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/b13986","volume-title":"Automata, Languages and Programming","author":"M. Vardi","year":"2003","unstructured":"Vardi, M.: Logic and Automata: A Match Made in Heaven. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 193\u2013193. Springer, Heidelberg (2003)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-Theoretic techniques for modal logics of programs. J. Comput. Syst. Sci.\u00a032, 183\u2013221 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR25","unstructured":"Vempaty, N.R.: Solving Constraint Satisfaction Problems Using Finite State Automata. In: AAAI, pp. 453\u2013458 (1992)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T20:37:14Z","timestamp":1712608634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}