Satisfiability of Quantified Boolean Announcements.
Hans van DitmarschTim FrenchRustam GalimullinPublished in: CoRR (2022)
Keyphrases
- davis putnam logemann loveland
- conjunctive normal form
- boolean formula
- satisfiability problem
- boolean functions
- real valued
- sat problem
- stock market
- computational complexity
- phase transition
- quantified boolean formulas
- decision procedures
- terminological reasoning
- propositional logic
- satisfiability testing
- first order logic
- boolean queries
- np complete
- universally quantified
- np hard
- boolean logic
- computational properties
- reasoning problems
- symmetry breaking
- data sets
- decision trees