Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:deciding_a_language_of_sets_and_relations [2008/04/03 13:49] vkuncak |
sav08:deciding_a_language_of_sets_and_relations [2009/05/14 12:05] vkuncak |
||
|---|---|---|---|
| Line 12: | Line 12: | ||
| \] | \] | ||
| - | We show that this language is decidable. | + | We show that this language is decidable by reduction to universal class. |
| - | ===== References ===== | + | While BAPA is more expressive with respect to cardinalities, the advantage of the present method is that it allows the use of certain relations. |
| * [[http://lara.epfl.ch/~kuncak/papers/KuncakRinard05DecisionProceduresSetValuedFields.html|Decision Procedures for Set-Valued Fields]] | * [[http://lara.epfl.ch/~kuncak/papers/KuncakRinard05DecisionProceduresSetValuedFields.html|Decision Procedures for Set-Valued Fields]] | ||
| + | |||
| + | However, see [[http://lara.epfl.ch/~kuncak/papers/WiesETAL09CombiningTheorieswithSharedSetOperations.html|On Combining Theories with Shared Set Operations]] for a way to combine BAPA with logics that support relations. | ||