The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence.
Domenico CantoneAlfio GiarlottaPietro MaugeriStephen WatsonPublished in: ICTCS (2023)
Keyphrases
- satisfiability problem
- set theory
- temporal logic
- conjunctive normal form
- np complete
- partial order
- davis putnam logemann loveland
- first order logic
- fuzzy set theory
- search algorithm
- phase transition
- rough sets
- mathematical morphology
- sat problem
- rough set theory
- stochastic local search
- stochastic local search algorithms
- sat instances
- probability theory
- boolean functions
- max sat
- model checking
- modal logic
- decision making
- knowledge discovery
- bayesian networks
- graphical models
- morphological operations
- randomly generated
- propositional logic
- fuzzy sets
- decision rules