The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence.
Domenico CantoneAlfio GiarlottaStephen WatsonPublished in: GandALF (2017)
Keyphrases
- satisfiability problem
- set theory
- temporal logic
- conjunctive normal form
- np complete
- davis putnam logemann loveland
- search algorithm
- first order logic
- fuzzy set theory
- partial order
- phase transition
- stochastic local search algorithms
- sat problem
- mathematical morphology
- stochastic local search
- fuzzy sets
- rough sets
- rough set theory
- max sat
- model checking
- boolean functions
- neural network
- image enhancement
- probability theory
- decision trees
- knowledge base
- constraint satisfaction
- expressive power
- decision rules
- fuzzy logic
- knowledge representation
- color images
- sat instances
- image processing
- computer vision
- mazurkiewicz traces
- databases