Scribd
Upload
159 views

Mrs. G. Jayanthi, B.E (CSE) .,M. Tech (Remote Sensing) .,AP, MSAJCE

The document outlines the topics to be covered in the theoretical foundations of computer science unit including propositional logic, predicate logic, logic programming, and Prolog. It lists key concepts like syntax, interpretations, models, deduction theorems, normal forms, inference rules, and SAT solvers that will be covered for propositional and predicate logic. For logic programming, it mentions definite programs, SLD resolution, normal programs, and SLDNF resolution. It concludes by introducing Prolog. The document also provides 10 recommended textbooks and references for the course content.

Uploaded by

nivi_09
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
159 views

Mrs. G. Jayanthi, B.E (CSE) .,M. Tech (Remote Sensing) .,AP, MSAJCE

The document outlines the topics to be covered in the theoretical foundations of computer science unit including propositional logic, predicate logic, logic programming, and Prolog. It lists key concepts like syntax, interpretations, models, deduction theorems, normal forms, inference rules, and SAT solvers that will be covered for propositional and predicate logic. For logic programming, it mentions definite programs, SLD resolution, normal programs, and SLDNF resolution. It concludes by introducing Prolog. The document also provides 10 recommended textbooks and references for the course content.

Uploaded by

nivi_09
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

CP7201 THEORITICAL FOUNDATIONS OF COMPUTER SCIENCE UNIT II LOGIC AND LOGIC PROGRAMMING SL. NO 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13.

. 14. 15. 16. 17. TOPIC PROPOSOTIONAL LOGIC - SYNTAX INTERPRETATIONS AND MODELS DEDUCTION THEOREMS NORMAL FORMS INFERENCE RULES SAT SOLVERS PREDICATE LOGIC SYNTAX PROOF THEORY SEMANTICS OF PREDICTAE LOGIC UNDECIDABILITY OF PREDICATE LOGIC INFERENCES IN FIRST ORDER LOGIC LOGIC PROGRAMMING DEFINITE PROGRAMS SLD RESOLUTION NORMAL PROGRAMS SLDNF RESOLUTION INTRODUCTION TO PROLOG TEXTBOOK FOR REFERENCES: 1. Uwe Schoning, Logic for Computer Scientists, Birkhauser, 2008. 2. M. Ben-Ari, Mathematical logic for computer science, Second Edition, Springer, 2003. 3. John Harrison, Handbook of Practical Logic and Automated Reasoning, Cambridge University Press, 2009. 4. Greg Michaelson, An introduction to functional programming through lambda calculus, Dover Publications, 2011. 5. Kenneth Slonneger and Barry Kurtz, Formal syntax and semantics of programming languages, Addison Wesley, 1995. 6. Kenneth H. Rosen, Discrete Mathematics and its applications, Seventh Edition, Tata McGraw Hill, 2011. 7. Sriram Pemmaraju and Steven Skiena, Computational Discrete Mathematics, Cambridge University Press, 2003. 8. M. Huth and M. Ryan, Logic in Computer Science Modeling and Reasoning about systems, Second Edition, Cambridge University Press, 2004. 9. Norman L. Biggs, Discrete Mathematics, Second Edition, Oxford University Press, 2002. 10. Juraj Hromkovic, Theoretical Computer Science, Springer, 1998. 11. J. E. Hopcroft, Rajeev Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Third Edition, Pearson, CONTENT FORMULAE AND PROBLEM THEORY THEOREMS PROBLEMS FORMULAE, RULES & THEOREMS THEORY THEORY THEOREMS THEORY THEORY, THEOREMS THEOREMS, PROBLEMS SYNTAX THEORY THEORY, THEOREMS - PROOFS THEORY THEORY, THEOREMS PROGRAM SYNTAX, LOGIC, PROGRAMMING EXAMPLES REF8 REF8 REF8 REF8 REF8 REF8 REF8 TEXT BOOK/WEBSITE REF 6,8

REF 6,8

Mrs. G. Jayanthi, B.E(CSE).,M. Tech(Remote Sensing).,AP, MSAJCE

You might also like