Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounded treewidth as a key to tractability of knowledge representation and reasoning |
scientific article; zbMATH DE number 5681776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded treewidth as a key to tractability of knowledge representation and reasoning |
scientific article; zbMATH DE number 5681776 |
Statements
Bounded treewidth as a key to tractability of knowledge representation and reasoning (English)
0 references
16 March 2010
0 references
fixed-parameter tractability
0 references
treewidth
0 references
monadic Datalog
0 references
abduction
0 references
closed world reasoning
0 references
disjunctive logic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8085403442382812
0 references
0.7854009866714478
0 references
0.7743205428123474
0 references
0.7741857171058655
0 references
0.7652269601821899
0 references
