On the Complexity of Computing Minimal Unsatisfiable LTL formulas

François Hantry Lakhdar Saïs Mohand-Said Hacid

Published in: CoRR (2012)

Keyphrases

unsatisfiable cores
propositional formulas
tree decompositions
worst case
model checking
hidden structure
linear time temporal logic
cnf formula
temporal logic
max sat
data sets
neural network
knowledge base
decision problems
boolean formula
deterministic automata