Quantum Phase Logic in Boolean Formula Satisfiability Problems.
Oleksandr KorchenkoOleh ZaritskyiPublished in: IT&I Workshops (2023)
Keyphrases
- satisfiability problem
- conjunctive normal form
- sat instances
- sat problem
- boolean formula
- np complete
- davis putnam
- temporal logic
- phase transition
- modal logic
- max sat
- search algorithm
- cl pc
- coalition logic
- boolean satisfiability
- logic programming
- sat solvers
- computational properties
- stochastic local search
- binary decision diagrams
- propositional satisfiability
- randomly generated
- automated reasoning
- model checking
- np hard
- membership queries
- knowledge base
- expressive power
- dynamic programming
- special case
- objective function