| P. H. Winston. Artificial Intelligence. Addison-Wesley, Reading, MA, 1992. |
....as well. 2. A Logic Architecture Based on Stacks of Goals (LASG) We will consider, in the following, the case of an agent which goal is to solve a given problem (to bring the problem from an initial to a final state) based on a set of operators (rules) that could be applied on a given moment [4]. In a LASG architecture, we will use the declarative representation of the knowledge. Let L be a set of sentences from the first order logic, and D = P(L) the set of L databases (the set of sets of L formulae) In the model that we propose, the internal state of the agent will be given by an ....
....state (Xf, Yf) the non deterministic predicate solution(Xi, Yi, L1, L, M, N) i, i, i, o, i) collects the elements of a solution in L (L1 is the former generated list) The goal has the form goal: path(4, 1, 1, 3, 4, 3, L) and the solutions are two: Figure 4. The Prolog program L= [4, 1], 3, 1] 2, 1] 2, 2] 1, 2] 1, 3] 6. Conclusions and further work In a logic based architecture, the intelligent behavior is generated by a symbolic representation of the environment and the agent s behavior, and by a symbolic manipulation of this representation. In the logic based ....
Winston, P., "Artificial Intelligence", Addison Wesley, Reading, MA, 1984, 2nd ed Babes-Bolyai University, Cluj-Napoca, Romania E-mail address: gabis@cs.ubbcluj.ro
....for a collection of entities all of which can be understood in terms of situated blocks (i.e. particular blocks at particular locations in a particular blocksworld) are shown in the figure below. These include representations for the level 1 entity arch and the level 2 entity arcade (cf. [5,6]) The function that produces properties of arches is 3 place since an arch is made up of a set of three blocks which are related together in a certain way. The root of the representation of arcade is a 7 place function, the assumption being that any arcade is made up of a collection of seven ....
Winston, P. (1984). Artificial Intelligence (2nd edn). Reading, Mass.: Addison-Wesley.
....form. A relationship is described as a set of conditions on the syllable containing the grapheme. In Figure 1, we show the relationship between the grapheme a and the IPA symbols [ei] ash] and [schwa] The LEP G learning algorithm is based on the Version Space algorithm (VSA) Mitchell, 1982, Winston, 1992] with our modifications. For each grapheme and its target IPA symbol, we input a set of positive and negative examples. LEP G chooses, from the version space, the single hypothesis that is consistent with these examples, and this hypothesis becomes one of the pronunciation rules. Before a rule is ....
....are made. We have to make sure that no new general hypothesis is a generalization of some other general hypothesis, no new general hypothesis is a generalization of the negative example N 1 , and no new general hypothesis has a field which is more specific than the current specific hypothesis [Winston, 1992]. Now, let CSH denote the current specific hypothesis, CGH denote the current general hypothesis, and F i denote each field in CSH, CGH, or N j (negative examples) where i is an index of fields and j is an index of the negative examples. There are three conditions under which no new hypothesis ....
[Article contains additional citation context not shown here]
Winston, P. (1992). Artificial Intelligence, Third Edition. Addison-Wesley, Reading, MA.
No context found.
P. H. Winston. Artificial Intelligence. Addison-Wesley, Reading, MA, 1992.
No context found.
P. H. Winston, Artificial Intelligence. Reading, MA: Addison-Wesley, 1984.
No context found.
P.H. Winston, Artificial Intelligence (3rd ed.), Addison Wesley (1992).
No context found.
P.H. Winston. 1984. Artificial Intelligence Addison-Wesley, Readig, MA.
No context found.
Winston, P. H., Artificial Intelligence, Reading, MA: Addison Wesley Publishing Co., 1992.
No context found.
Winston, P. H. 1984. Artificial Intelligence. Addison--Wesley.
No context found.
Winston, P.H.(1977).Artificial intelligence. Reading, MA: Addison-Wesley.
No context found.
Winston P.: Artificial Intelligence. 3rd ed, Addison Wesley (1992)
No context found.
H.W. Winston. Artificial Intelligence (2nd edn). Addison-Wesley, Reading, MA, 1984.
No context found.
P. H. Winston. Artificial Intelligence. Addison-Wesley, Reading, MA, 1992.
No context found.
P.H. Winston. Artificial Intelligence. Addison-Wesley, 1977. Referred to in page(s) 18, 23, 24, 25.
No context found.
P. H. Winston. Artificial Intelligence. Addison-Wesley, third edition, 1992.
No context found.
P.H. Winston, Artificial Intelligence, Third Edition Addison-Wesley, 1992.
No context found.
P.H. Winston, Artificial Intelligence, third ed. Addison Wesley, 1992.
No context found.
Winston, Patrick Henry, "Artificial Intelligence", Third
No context found.
Winston, P. (1984), Artificial Intelligence (2nd edition), Addison-Wesley.
No context found.
Winston, Patrick. Artificial Intelligence. 3rd ed. NewYork: AddisonWesley, 1993.
No context found.
P. H. Winston, Artificial Intelligence, Addison Wesley (1984).
No context found.
P. Winston, Artificial Intelligence, 3rd Edition (Reading, Ma: Addison-Wesley, 1992).
No context found.
P. H. Winston. Artificial Intelligence. Addison-Wesley, 1977.
No context found.
Winston, P. H. Artificial Intelligence. 3rd Edition. Addison-Wesley. 1992.
No context found.
Winston, P. H. (1992). Artificial Intelligence. Addison-Wesley Publishing, Reading, Massachusetts.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC