Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Logical Methods in Computer Science e.V.
2017-10-01
|
| Edice: | Logical Methods in Computer Science |
| Témata: | |
| On-line přístup: | https://lmcs.episciences.org/2557/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|