Unsolvable decision problems for PROLOG programs
- 1 January 1987
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The consistency of negation as failureThe Journal of Logic Programming, 1986
- Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitionsJournal of Automated Reasoning, 1986
- Completeness of the SLDNF-resolution for a class of logic programsPublished by Springer Nature ,1986
- Negation as failure. IIThe Journal of Logic Programming, 1985
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Negation as FailurePublished by Springer Nature ,1978
- Computability of Recursive FunctionsJournal of the ACM, 1963
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961