The operators or rules are written according to the following grammar: . :: : [. () |. .
A Framework for an Intelligent Problem Solver Magdy Aboul-Ela Computer & Information Systems Department Sadat Academy for Management Sciences P.O. Box 2222, Kournich-ElNile, El-Maadi, Cairo, Egypt
ABSTRACT: - This paper presents a proposed Framework for an Intelligent Problem Solver (IPS). This framework is based on representing the problem state using a proposed representation, with a representation language to represent the operators or rules that can be used to move from one state to another until reaching the goal state. The system can solve the problem dynamically, by constructing a plan for solution. IPS can be integrated with a complete intelligent environment for prediction, diagnosis, or Intelligent Tutoring System (ITS). Some Examples of different Applications show how this framework is applied.
KEYWORDS: - Artificial Intelligence, Intelligent Tutoring Systems, Expert Systems, Problem Solver.
1. Introduction The process of problem solving is described as a search through a state space in which each point corresponded to a situation that might arise. The search started with an initial situation and performed a sequence of allowable operations until a situation corresponding to a goal was reached. However, for more complicated problem domains, it becomes important to be able to work on small pieces of a problem separately and then to combine the partial solutions at the end into a complete problem solution. The use of methods that focuses on ways of decomposing the original problem into appropriate subparts and on ways of recording and handling interactions among the subparts as they are detected during the problemsolving process is called planning. The word planning refers to the process of computing several steps of a problem-solving procedure before executing any of them. The search strategy that would make it possible to solve the major parts of a problem first, then go back, and solve the small problems that arises in gluing the big pieces together, is known as means-ends analysis. The means-ends analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. However, perhaps that operator cannot be applied to the current state. So a set up of a sub-problem of getting to a state in
which it can be applied, is required. The word "operator" refers to some representation of an action. An operator usually includes information about what must be true in the world before the action can take place, and how the world is changed by the action. The operator, which is an action representation is represented as a procedure or function or production rules, and used as tools or constructors of a system. This paper presents a framework for problem solver [9].
2. Problem State and Operators Representation The following grammar is designed for a language to represent different aspects of problem states. The grammar of this language is based on the concepts of object oriented. Each statement, or sentence, of this language according to the grammar is a description of problem state. :: . < Object > :: [:] [()] []. :: < Object > [& ] . :: isa | has. ::
1
() | [; ] . :: { [] [ , ] } | { }|. :: over | below | next-to | behind | front | include | greater | smaller | in | Like | same-as :: Except | Not . :: String of Characters
