Registro:

Referencias:

• Aloul, F., Lynce, I., Prestwich, S., Symmetry Breaking in Local Search for Unsatisfiability 7th International Workshop on Symmetry and Constraint Satisfaction Problems, Providence, RI (2007)
• Aloul, F.A., Markov, I.L., Sakallah, K.A., FORCE: A fast and easy-to-implement variable-ordering heuristic (2003) ACM Great Lakes Symposium on VLSI, pp. 116-119. , ACM Press, New York
• Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A., Solving difficult SAT instances in the presence of symmetry (2002) DAC, pp. 731-736. , ACM Press, New York
• Barton, G.E., Computational complexity in two-level morphology (1986) Proc. of the 24th ACL, New York, pp. 53-59
• Beesley, K., Karttunen, L., (2003) Finite State Morphology, , CSLI Publications
• Biere, A., Heule, M., Van Maaren, H., Walsh, T., (2009) Handbook of Satisfiability, , IOS Press, Amsterdam
• Büchi, J.R., Weak second-order arithmetic and finite automata (1960) Zeit. Math. Logik. Grund. Math., pp. 66-92
• Castaño, J., Two views on crossing dependencies, language, biology and satisfiability (2011) 1st International Work-Conference on Linguistics, Biology and Computer Science: Interplays, , IOS Press, Amsterdam
• Darwiche, A., New Advances in Compiling CNF into Decomposable Negation Normal Form (2004) ECAI, pp. 328-332
• Elgot, C.C., Decision problems of automata design and related arithmetics (1961) Transactions of the American Mathematical Society
• Franco, J., Kouril, M., Schlipf, J., Ward, J., Weaver, S., Dransfield, M.R., Vanfleet, W.M., SBSAT: A state-based, BDD-based satisfiability solver (2004) LNCS, 2919, pp. 398-410. , Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. Springer, Heidelberg
• Gomes, C.P., Sabharwal, A., Selman, B., Model Counting (2009) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, 185, pp. 633-654. , IOS Press, Amsterdam
• Hadzic, T., Hansen, E.R., O'Sullivan, B., On Automata (2008) MDDs and BDDs in Constraint Satisfaction
• Hansen, P., Jaumard, B., Algorithms for the maximum satisfiability problem (1990) Computing, 44, pp. 279-303
• Lange, K., Rossmanith, P., The emptiness problem for intersections of regular languages (1992) LNCS, 629, pp. 346-354. , Havel, I.M., Koubek, V. (eds.) MFCS 1992. Springer, Heidelberg
• Lewis, H.R., Papadimitriou, C.H., (1997) Elements of the Theory of Computation, , 2nd edn. Prentice-Hall, Upper Saddle River
• Marek, V.W., (2010) Introduction to Mathematics of Satisfiability, , Chapman and Hall/CRC
• Muise, C., Beck, J.C., McIlraith, S., (2010) Fast D-DNNF Compilation with SharpSAT
• Sinz, C., Biere, A., Extended resolution proofs for conjoining BDDs (2006) LNCS, 3967, pp. 600-611. , Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. Springer, Heidelberg
• Tapanainen, P., Applying a Finite-State Intersection Grammar (1997) Finite-State Language Processing, pp. 311-327. , Roche, E., Schabes, Y. (eds.) MIT Press, Cambridge
• Thurley, M., SharpSAT - Counting models with advanced component caching and implicit BCP (2006) LNCS, 4121, pp. 424-429. , Biere, A., Gomes, C.P. (eds.) SAT 2006. Springer, Heidelberg
• Urquhart, A., Hard examples for resolution (1987) J. ACM, 34 (1), pp. 209-219
• Vardi, M., Logic and Automata: A Match Made in Heaven (2003) LNCS, 2719, pp. 193-193. , Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. Springer, Heidelberg
• Vardi, M.Y., Wolper, P., Automata-Theoretic techniques for modal logics of programs (1986) J. Comput. Syst. Sci., 32, pp. 183-221
• Vempaty, N.R., Solving Constraint Satisfaction Problems Using Finite State Automata (1992) AAAI, pp. 453-458A4 - Universite Francois Rabelais Tours; CNRS; Region Centre; Ville de Blois; Universite de Rouen

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------