On the satisfiability problem for a 3-level quantified syllogistic
Domenico CantoneMarianna Nicolosi AsmundoPublished in: CoRR (2013)
Keyphrases
- satisfiability problem
- temporal logic
- search algorithm
- np complete
- phase transition
- sat problem
- stochastic local search
- mazurkiewicz traces
- solving hard
- pspace complete
- sat instances
- conjunctive normal form
- stochastic local search algorithms
- database systems
- computational complexity
- decision procedures
- orders of magnitude
- logic programs
- state space
- search space