The satisfiability problem for Boolean set theory with a choice correspondence (Extended version).
Domenico CantoneAlfio GiarlottaStephen WatsonPublished in: CoRR (2017)
Keyphrases
- satisfiability problem
- set theory
- temporal logic
- conjunctive normal form
- np complete
- first order logic
- search algorithm
- partial order
- phase transition
- davis putnam logemann loveland
- stochastic local search algorithms
- fuzzy set theory
- mathematical morphology
- sat problem
- stochastic local search
- rough set theory
- rough sets
- fuzzy sets
- model checking
- sat instances
- mazurkiewicz traces
- control system
- morphological operations
- max sat
- decision trees
- gray scale
- genetic algorithm
- neural network