MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the \exists ^*\forall ^* ∃ ∗ ∀ ∗ Fragment.
Bernd FinkbeinerChristopher HahnTobias HansPublished in: ATVA (2018)
Keyphrases
- cnf formula
- satisfiability problem
- propositional formulas
- automata theoretic
- conjunctive normal form
- boolean formula
- propositional logic
- np complete
- guarded fragment
- real numbers
- temporal logic
- normal form
- computational complexity
- boolean functions
- database
- consistency checking
- symmetry breaking
- query language
- relational databases
- maximal tractable
- random sat
- satisfiability testing
- neural network