Completeness issues in RUE-NRF deduction: The undecidability of viability (Q1311402)
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: Completeness issues in RUE-NRF deduction: The undecidability of viability |
scientific article; zbMATH DE number 484770
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness issues in RUE-NRF deduction: The undecidability of viability |
scientific article; zbMATH DE number 484770 |
Statements
Completeness issues in RUE-NRF deduction: The undecidability of viability (English)
0 references
13 January 1994
0 references
undecidability
0 references
RUE-resolution
0 references
covered pure logic programs
0 references
ground query processing
0 references
0.8436451
0 references
0.8424309
0 references
0.8388445
0 references
0.8356855
0 references
0.8352763
0 references
0.8337792
0 references
