Satisfiability Problem in Composition-Nominative Logics of Quantifier-Equational Level.
Mykola S. NikitchenkoValentyn G. TymofieievPublished in: ICTERI (2012)
Keyphrases
- satisfiability problem
- np complete
- presburger arithmetic
- quantifier elimination
- decision procedures
- temporal logic
- search algorithm
- phase transition
- theorem proving
- sat problem
- stochastic local search algorithms
- stochastic local search
- expressive power
- max sat
- sat instances
- modal logic
- pspace complete
- mazurkiewicz traces
- randomly generated
- reinforcement learning
- inference rules
- data model