About Some UP-Based Polynomial Fragments of SAT.
Mohammad Al-SaediÉric GrégoireBertrand MazureLakhdar SaïsPublished in: ISAIM (2014)
Keyphrases
- satisfiability problem
- sat solvers
- sat problem
- sat solving
- search algorithm
- low order
- sat instances
- propositional satisfiability
- neural network
- propositional logic
- boolean satisfiability
- stochastic local search algorithms
- horizontal fragmentation
- satisfiability testing
- pseudo boolean constraints
- randomized approximation