AILEPHANT

Category: Theory

  • 4. Search: Depth-First, Hill Climbing, Beam

    —

    by

    Florian Bansac
    in

    Search trees Search trees represent all the possibilities to search for the quickest path without coming back to previous paths. They are particularly used for quickest paths on maps with nodes (intersections), but not exclusively. They are primarily about choices, and finding the best sequence of choices. British Museum Algorithm = complete expansion of all paths Depth…

  • 3. Reasoning: Goal Trees and Rule-Based Expert Systems

    —

    by

    Florian Bansac
    in

    Reporting on a Goal Tree program A Goal Tree program can answer questions about its own behavior by reporting steps up (why questions) or down (how questions) in the actions it takes. Simon’s Ant The complexity of a program’s behavior is a consequence of the environment, not the complexity of the program. Complexity (behavior) =…

  • 2. Reasoning: Goal Trees and Problem Solving

    —

    by

    Florian Bansac
    in

    Problem reduction Take a complicate problem and transform it into a simpler problem. Start with safe transformations, the ones you are sure will work in any case. Then apply heuristic transformations, the ones that could work. The problem simplification schema, may create “and node“, where the problem forks in several sub problems and “or node”…

  • 1. Introduction and scope

    —

    by

    Florian Bansac
    in

    What is Artifical Intelligence? Algorithms, enabled by constraints, exposed by representations, that support the building of models targeted at thinking, perception and action, and the loops that tie them together. Artificial Intelligence is applied through problem solving procedures, methods, techniques and algorithms. How to approach a problem Generate solutions and test to obtain positive or…