On the satisfiability problem for fragments of two-variable logic with one transitive relation.

Wieslaw Szwast Lidia Tendera

Published in: J. Log. Comput. (2019)

Keyphrases

satisfiability problem
guarded fragment
np complete
temporal logic
search algorithm
finite domain
phase transition
sat problem
stochastic local search algorithms
mazurkiewicz traces
pspace complete
stochastic local search
model checking
max sat
decision procedures
heuristic search
np hard
data model