Completeness issues in RUE-NRF deduction: The undecidability of viability (Q1311402): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paraconsistent logic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5679729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3490993 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992908 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complete logic programs with domain-closure axiom / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Experiments with semantic paramodulation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5624683 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883568 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:18, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completeness issues in RUE-NRF deduction: The undecidability of viability |
scientific article |
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