Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator.
Domenico CantonePietro UrsinoPublished in: ACM Trans. Comput. Log. (2024)
Keyphrases
- satisfiability problem
- set theory
- cartesian product
- decision procedures
- conjunctive normal form
- temporal logic
- np complete
- partial order
- search algorithm
- description logics
- davis putnam logemann loveland
- sat problem
- first order logic
- fuzzy set theory
- phase transition
- rough sets
- mathematical morphology
- rough set theory
- sat instances
- stochastic local search algorithms
- query answering
- modal logic
- fuzzy sets
- model checking
- probability theory
- max sat
- neural network
- decision rules
- knowledge representation
- machine learning
- orders of magnitude
- fuzzy logic
- image processing
- genetic algorithm