Registro:

Referencias:

• Aloul, F., Lynce, I., Prestwich, S., Symmetry breaking in local search for unsatisfiability (2007) 7th International Workshop on Symmetry and Constraint Satisfaction Problems, , Providence, RI
• 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
• Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A., Solving difficult SAT instances in the presence of symmetry (2002) Proceedings - Design Automation Conference, pp. 731-736
• Audemard, G., Katsirelos, G., Simon, L., A restriction of extended resolution for clause learning sat solvers (2010) 24nd Conference on Artificial Intelligence, AAAI'10, July
• 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
• Bonfante, G., Le Roux, J., Intersection optimization is NP-complete (2007) Sixth International Workshop on Finite-State Methods and Natural Language Processing, FSMNLP 2007, , Postdam Germany
• 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
• Castaño José, M., Castaño, R., Variable and clause ordering in an fsa approach to propositional satisfiability (2011) CIAA, 6807, pp. 76-87. , Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel, Lecture Notes in Computer Science Springer
• Darwiche, A., New advances in compiling CNF into decomposable negation normal form (2004) ECAI, pp. 328-332
• Dassow, J., Paun, G., Salomaa, A., Grammars with controlled derivations (1997) Handbook of Formal Languages, Vol. 2, , G. Rozenberg, A. Salomaa, Springer Berlin
• Denzumi, S., Yoshinaka, R., Arimura, H., Ichi Minato, S., Notes on sequence binary decision diagrams: Relationship to acyclic automata and complexities of binary set operations (2011) Proceedings of the Prague Stringology Conference 2011, pp. 147-161. , Jan Holub, Jan Žárek (Eds) Czech Technical University in Prague, Czech Republic
• Elgot, C.C., Decision problems of automata design and related arithmetics (1961) Trans. Amer. Math. Soc.
• Franco, J.V., Kouril, M., Schlipf, J.S., Ward, J., Weaver, S., Dransfield, M., Vanfleet, W.M., SBSAT: A state-based, BDD-based satisfiability solver (2003) SAT, 2919, pp. 398-410. , E. Giunchiglia, A. Tacchella, Lecture Notes in Computer Science Springer
• Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , W. H. Freeman & Co. New York, NY, USA
• Gomes, C.P., Sabharwal, A., Selman, B., Model Counting (2009) Handbook of Satisfiability, 185, pp. 633-654. , Frontiers in Artificial Intelligence and Applications IOS Press
• Grune, D., Jacobs Ceriel, J.H., (2010) Parsing Techniques - A Practical Guide, , Springer
• Hadzic, T., Hansen, E.R., O'Sullivan, B., (2008) On Automata, MDDs and BDDs in Constraint Satisfaction
• Hansen Pierre, Jaumard Brigitte, Algorithms for the maximum satisfiability problem (1990) Computing (Vienna/New York), 44 (4), pp. 279-303
• Hopcroft John, E., Ullman Jeffrey, D., (1979) Introduction to Automata Theory, Languages, and Computation, , Adison-Wesley Publishing Company Reading, Massachusetts, USA
• Karakostas, G., Lipton Richard, J., Viglas, A., On the complexity of intersecting finite state automata and NL versus NP (2003) Theoret. Comput. Sci., 302 (13), pp. 257-274
• Koskenniemi, K., Finite-state parsing and disambiguation (1990) Coling, pp. 229-232
• Lang, B., Recognition can be harder than parsing (1992) Comput. Intell., 10, pp. 486-494
• Lange, K., Rossmanith, P., The emptiness problem for intersections of regular languages (1992) Mathematical Foundations of Computer Science 1992, 629, pp. 346-354. , I. Havel, V. Koubek, Lecture Notes in Computer Science Springer Berlin, Heidelberg
• Lange, K.-J., Reinhardt, K., Set automata (1996) Combinatorics, Complexity and Logic; Proceedings of the DMTCS'96, pp. 321-329. , Springer
• Lewis, H.R., Papadimitriou, C.H., (1997) Elements of the Theory of Computation, , 2nd ed. Prentice Hall PTR Upper Saddle River, NJ, USA
• 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
• Satta, G., Recognition of linear context-free rewriting systems (1992) ACL, pp. 89-95
• Schiering, I., Thomas, W., Counter-free automata, first-order logic and star-free expressions (1995) Developments in Language Theory II, Magdeburg, Germany, pp. 166-175
• Marques Silva, J.P., Sakallah, K.A., Grasp - A new search algorithm for satisfiability (1996) Proceedings of the International Conference on Computer-Aided Design, pp. 220-227
• Sinz, C., Biere, A., Extended resolution proofs for conjoining BDDs (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3967, pp. 600-611. , DOI 10.1007/11753728-60, Computer Science - Theory and Applications - First International Computer Science Symposium in Russia, CSR 2006, Proceedings LNCS
• Tapanainen, P., Applying a Finite-State Intersection Grammar (1997) Finite-State Language Processing, pp. 311-327. , E. Roche, Y. Schabes, MIT Press Cambridge
• Thurley, M., SharpSAT - Counting models with advanced component caching and implicit BCP (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4121, pp. 424-429. , Theory and Applications of Satisfiability Testing, SAT 2006 - 9th International Conference, Proceedings LNCS
• 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) Automata, Languages and Programming, 2719, pp. 64-65. , J. Baeten, J. Lenstra, J. Parrow, G. Woeginger, LNCS Springer
• Vardi Moshe, Y., Wolper Pierre, Automata-Theoretic techniques for modal logics of programs (1986) Journal of Computer and System Sciences, 32 (2), pp. 183-221. , DOI 10.1016/0022-0000(86)90026-7
• Vempaty, N.R., Solving constraint satisfaction problems using finite state automata (1992) AAAI, pp. 453-458
• Weir, D., A geometric hierarchy beyond context-free languages (1992) Theoret. Comput. Sci., 104 (2), pp. 235-261
• Yli-Jyrä, A., (2005) Contributions to the Theory of Finite-state Based Linguistic Grammars, , Ph.D. Thesis, Electronic Publications at the University of Helsinki
• Yli-Jyr, A., Schematic finite-state intersection parsing (1995) Short Papers Presented at the 10th Nordic Conference of Computational Linguistics, NODALIDA-95
• Yu, S., Zhuang, Q., Salomaa, K., The state complexities of some basic operations on regular languages (1994) Theoret. Comput. Sci., 125 (2), pp. 315-328

Citas:

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

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

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

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