论文信息 - Analyzing Context-Free Grammars Using an Incremental SAT Solver

Analyzing Context-Free Grammars Using an Incremental SAT Solver

We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length: inclusion, intersection, universality, equivalence, and ambiguity. These are in (co)-NP and thus solvable by a reduction to the (un-)satisfiability problem for propositional logic. We present such encodings --- fully utilizing the power of incrementat SAT solvers --- prove correctness and validate this approach with benchmarks.

Martin Lange | Keijo Heljanko | Roland Axelsson

[1] Christian Bessière. Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

[2] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[3] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[5] Robert Giegerich,et al. Analyzing Ambiguity of Context-Free Grammars , 2007, CIAA.

[6] Toby Walsh,et al. Decomposing Global Grammar Constraints , 2007, CP.

[7] Karel Culik,et al. LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[8] Borivoj Melichar,et al. Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[9] H. Basten. The Usability of Ambiguity Detection Methods for Context-Free Grammars , 2009, LDTA.

[10] Sylvain Schmitz,et al. Conservative Ambiguity Detection in Context-Free Grammars , 2007, ICALP.

[11] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).