Login / Signup
About some UP-based polynomial fragments of SAT.
Balasim Al-Saedi
Olivier Fourdrinoy
Éric Grégoire
Bertrand Mazure
Lakhdar Saïs
Published in:
Ann. Math. Artif. Intell. (2017)
Keyphrases
</>
satisfiability problem
sat solvers
search algorithm
boolean satisfiability
neural network
search strategies
phase transition
sat problem
sat instances
propositional satisfiability
relational databases
upper bound
propositional logic
low order
backtracking search