Artificial Intelligence

The app is a complete free handbook of Artificial Intelligence with diagrams and graphs. It is part of Computer or software engineering education which brings important topics, notes, news & blog on the subject. The App serves as a quick reference guide on this engineering subject.
It covers more than 140 topics of Artificial Intelligence in detail. The topics are divided into 5 units.

Each topic is complete with diagrams, equations and other forms of graphical representations for better learning and quick understanding. The App will provide faster learning and quick revisions on the subject.

Some of the topics Covered in this application are:

1. Turing test2. Introduction to Artificial Intelligence3. History of AI4. The AI Cycle5. Knowledge Representation6. Typical AI problems7. Limits of AI8. Introduction to Agents9. Agent Performance10. Intelligent Agents11. Structure Of Intelligent Agents12. Types of agent program13. Goal based Agents14. Utility-based agents15. Agents and environments16. Agent architectures17. Search for Solutions18. State Spaces19. Graph Searching20. A Generic Searching Algorithm21. Uninformed Search Strategies22. Breadth-First Search23. Heuristic Search24. A∗ Search25. Search Tree26. Depth first Search27. Properties of Depth First Search28. Bi-directional search29. Search Graphs30. Informed Search Strategies31. Methods of Informed Search32. Greedy Search33. Proof of Admissibility of A*34. Properties of Heuristics35. Iterative-Deepening A*36. Other Memory limited heuristic search37. N-Queens eample38. Adversarial Search39. Genetic Algorithms40. Games41. Optimal decisions in Games42. minimax algorithm43. Alpha Beta Pruning44. Backtracking45. Consistency Driven Techniques46. Path Consistency (K-Consistency)47. Look Ahead48. Propositional Logic49. Syntax of Propositional Calculus50. Knowledge Representation and Reasoning51. Propositional Logic Inference52. Propositional Definite Clauses53. Knowledge-Level Debugging54. Rules of Inference55. Soundness and Completeness56. First Order Logic57. Unification 58. Semantics59. Herbrand Universe60. Soundness, Completeness, Consistency, Satisfiability61. Resolution62. Herbrand Revisited63. Proof as Search64. Some Proof Strategies65. Non-Monotonic Reasoning66. Truth Maintenance Systems67. Rule Based Systems68. Pure Prolog69. Forward chaining70. backward Chaining71. Choice between forward and backward chaining72. AND/OR Trees73. Hidden Markov Model74. Bayesian networks75. Learning Issues76. Supervised Learning77. Decision Trees78. Knowledge Representation Formalisms79. Semantic Networks80. Inference in a Semantic Net81. Extending Semantic Nets82. Frames83. Slots as Objects84. Interpreting frames85. Introduction to Planning86. Problem Solving vs. Planning87. Logic Based Planning88. Planning Systems89. Planning as Search90. Situation-Space Planning Algorithms91. Partial-Order Planning92. Plan-Space Planning Algorithms93. Interleaving vs. Non-Interleaving of Sub-Plan Steps94. Simple Sock/Shoe Example95. Probabilistic Reasoning96. Review of Probability Theory97. Semantics of Bayesian Networks98. Introduction to Learning99. Taxonomy of Learning Systems100. Mathematical formulation of the inductive learning problem101. Concept Learning102. Concept Learning as Search103. Algorithm to Find a Maximally-Specific Hypothesis104. Candidate Elimination Algorithm105. The Candidate-Elimination Algorithm106. Decision Tree Construction107. Splitting Functions108. Decision Tree Pruning109. Neural Networks110. Artificial Neural Networks111. Perceptron112. Perceptron Learning