- 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)
- On probabilistic inference by weighted model counting
2007/11/14 by Mark Chavira, Adnan Darwiche · 66 citations
Computer Science · Decision Sciences · Mathematics · #Algorithm #Artificial intelligence #Base (topology) #Bayesian Modeling and Causal Inference #Bayesian inference #Bayesian network #Bayesian probability #Computer science #Data Management and Algorithms #Data Quality and Management #Dimension (graph theory) #Inference #Knowledge base #Mathematics #Probabilistic logic #Propositional formula #Propositional variable #Statistical model #Theoretical computer science
- A Threshold for Unsatisfiability
1996/12/01 by Andreas Goerdt · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Graph Theory Research #Boolean satisfiability problem #Combinatorics #Computer science #Conjunctive normal form #Constraint Satisfaction and Optimization #Discrete mathematics #Graph #Mathematics #Probabilistic logic #Propositional calculus #Propositional formula #Propositional variable #Satisfiability #Statistics #Theoretical computer science