vix.ing · top · new · best · stats · spec

Analyzing Context-Free Grammars Using an Incremental SAT Solver

2008/08/12 by Roland Axelsson, Keijo Heljanko, Martin Lange · 1 citation
Computer Science · Mathematics · #Algorithm #Ambiguity #Artificial intelligence #Boolean satisfiability problem #Bounded function #Computer science #Constraint Satisfaction and Optimization #Correctness #Decidability #Description logic #Discrete mathematics #Equivalence (formal languages) #Formal Methods in Verification #Intermediate logic #Logic, Reasoning, and Knowledge #Mathematics #Programming language #Propositional calculus #Propositional formula #Propositional variable #Rule-based machine translation #Satisfiability #Theoretical computer science #Undecidable problem #Universality (dynamical systems)

paper · doi:10.1007/978-3-540-70583-3_34

openalex publication_date 2008/08/12 · crossref created 2008/08/12 · crossref deposited 2021/05/03 · crossref indexed 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

Cited by