On the satisfiability problem for fragments of the two-variable logic with one transitive relation.
Wieslaw SzwastLidia TenderaPublished in: CoRR (2018)
Keyphrases
- satisfiability problem
- guarded fragment
- np complete
- finite domain
- temporal logic
- phase transition
- search algorithm
- sat problem
- stochastic local search
- stochastic local search algorithms
- max sat
- sat instances
- pspace complete
- search space
- knowledge base
- decision procedures
- optimal solution
- conjunctive normal form
- objective function