Completeness issues in RUE-NRF deduction: The undecidability of viability

DOI10.1007/BF00881797zbMath0782.68103OpenAlexW1992485981MaRDI QIDQ1311402

James J. Lu, V. S. Subrahmanian

Publication date: 13 January 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881797

zbMATH Keywords

undecidabilitycovered pure logic programsground query processingRUE-resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

The rue theorem-proving system: The complete set of LIM+ challenge problems

Cites Work

• Paraconsistent logic programming
• Experiments with semantic paramodulation
• Complete logic programs with domain-closure axiom
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item