How hard is completeness reasoning for conjunctive queries? (Q2019449)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7336101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How hard is completeness reasoning for conjunctive queries? |
scientific article; zbMATH DE number 7336101 |
Statements
How hard is completeness reasoning for conjunctive queries? (English)
0 references
21 April 2021
0 references
0.8521748
0 references
0.8520532
0 references
0.83787125
0 references
0.7998128
0 references
0.7991675
0 references
0.7977714
0 references
0 references
0.79606867
0 references
0.7959127
0 references
