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.
Na minha lista:
| Principais autores: | , |
|---|---|
| 格式: | Artigo |
| 语言: | Inglês |
| 出版: |
Logical Methods in Computer Science e.V.
2017-10-01
|
| 丛编: | Logical Methods in Computer Science |
| 主题: | |
| 在线阅读: | https://lmcs.episciences.org/2557/pdf |
| 标签: |
没有标签, 成为第一个标记此记录!
|