Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
sav08:evaluating_formulas_in_finite_structures [2008/03/19 00:45] vkuncak |
sav08:evaluating_formulas_in_finite_structures [2008/03/19 10:41] vkuncak |
||
|---|---|---|---|
| Line 29: | Line 29: | ||
| Given a language ${\cal L}$, formula a formula $F$ in ${\cal L}$ and an interpretation $I=(D,\alpha)$, determine $e_F(F)(I)$. | Given a language ${\cal L}$, formula a formula $F$ in ${\cal L}$ and an interpretation $I=(D,\alpha)$, determine $e_F(F)(I)$. | ||
| - | * fix formula: LOGSPACE (iterate over elements) | + | |
| - | * fix language with symbols of bounded arity: PSPACE (reduce to [[QBF and Quantifier Elimination|QBF]]) | + | Basic idea: iterate over all domain elements for quantifiers. |
| + | |||
| + | * fix formula: LOGSPACE (number of vars fixed, number of their bits changes) | ||
| + | * fix language with symbols of bounded arity: PSPACE (number of variables increases with formula size, see also [[QBF and Quantifier Elimination|QBF]]) | ||
| ===== References ===== | ===== References ===== | ||
| - | * [[http://citeseer.ist.psu.edu/burch90symbolic.html|Symbolic Model Checking: 10 20 States and Beyond]] | + | * [[http://citeseer.ist.psu.edu/burch90symbolic.html|Symbolic Model Checking: 10^20 States and Beyond]] |
| * Neil Immerman: Descriptive Complexity, Springer | * Neil Immerman: Descriptive Complexity, Springer | ||
| | | ||