Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory.
Domenico CantoneAndrea De DomenicoPietro MaugeriEugenio G. OmodeoPublished in: CILC (2019)
Keyphrases
- set theory
- first order logic
- boolean formula
- computational complexity
- davis putnam logemann loveland
- fuzzy set theory
- partial order
- rough sets
- propositional logic
- fuzzy sets
- conjunctive normal form
- mathematical morphology
- boolean functions
- satisfiability problem
- polynomial size
- real time
- rough set theory
- probability theory
- algebraic geometry
- decision making
- phase transition
- sat solvers
- inference rules
- binary images
- sat problem
- np complete
- multiscale
- neural network