Deciding First-Order Satisfiability when Universal and Existential Variables are Separated.
Thomas SturmMarco VoigtChristoph WeidenbachPublished in: CoRR (2015)
Keyphrases
- universally quantified
- existentially quantified
- quantified boolean formulas
- higher order
- query answering
- satisfiability problem
- decision procedures
- propositional logic
- reasoning tasks
- np complete
- first order logic
- situation calculus
- boolean formula
- random variables
- computational complexity
- constraint satisfaction
- real numbers
- stochastic local search