a. State the rules that govern the formulation of well formed formulae. (5 Marks) b. Explain the term “executing programs” as used in logic programming (1 Mark) c. State the components that identify a calculation in logic programming. (3 Marks) d. Construct a resolution tree to depict the implementation of Forward Resolution Algorithm for the following scenario. (6 Marks)
Basic Facts: B11(x) Database: {1, 2, 3, 4} B12(x) Database: {3, 4, 5, 6} B21(x) Database: {1, 2, 3, 4} B22(x) Database: {1, 2, 3, 5} Rules of Inference: P(x) :=P1(x) P2(x) P1(x) :=B11(x) & P12(x) P2(x) : =B21(x) & B22(x)
e. Compare and contrast the major programming paradigms by completing the following table. (8 Marks) Paradigm Key Concept Program Program Execution Result Imperative Functional Logic Object-Oriented
For a custom-written paper on the above topic, place your order now!
What We Offer
• On-time delivery guarantee
• PhD-level professionals
• Automatic plagiarism check
• 100% money-back guarantee
• 100% Privacy and Confidentiality
• High Quality custom-written papers
