Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
sav08:classical_decision_problem [2008/04/02 23:58]
vkuncak
sav08:classical_decision_problem [2008/04/03 13:34] (current)
vkuncak
Line 7: Line 7:
 Classify formulas according to Classify formulas according to
   * regular expression describing the sequence of quantifiers (e.g. $\exists^* \forall^*$ means formulas $\exists x_1. \ldots. \exists x_n. \forall y_1.\ldots \forall y_m. F$ where $F$ is quantifier-free)   * regular expression describing the sequence of quantifiers (e.g. $\exists^* \forall^*$ means formulas $\exists x_1. \ldots. \exists x_n. \forall y_1.\ldots \forall y_m. F$ where $F$ is quantifier-free)
-  * number and arity of relation symbols +  * sequence of numbers ​of relation symbols ​for each arity 
-  * number and arity of function symbols+  * sequence of numbers ​of function symbols ​for each arity
   * presence or absence of equality in formulas   * presence or absence of equality in formulas
  
 
sav08/classical_decision_problem.txt · Last modified: 2008/04/03 13:34 by vkuncak
 
© EPFL 2018 - Legal notice