Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

a) Boy(X) ∧ ¬ L ¬ Likes (X, chocolates) →Likes (X, chocolates)
b) Boy (ram)
c) Boy (john)
[Hints: Get 4 formulas: Boy (ram), Boy (john) and the ground instances of
(a) with X = ram and X= john. Since these are closed first order formula,
these must be auto-epistemic formula. Then the collection of these formula
is the auto-epistemic theory (see text for the definition).]
9. Add the following fact and knowledge with Mita’s marketing visit problem
and show with the dependence graph: how the TMS works.
Fact: Carries-Influenza (mita, next-Monday-evening).
Knowledge: Carries-Influenza (X, Day) → ¬ Visits (X, market, Day).
References
[1] Alferes, J. J. and Pereira, L. M., Reasoning with Logic Programming,
Springer-Verlag, Berlin, pp.1-35, 1996.
[2] Antoniou, G., Nonmonotonic Reasoning, The MIT Press, Cambridge,
MA, pp. 21-160, 1997.
[3] Bender, E. A., Mathematical Methods in Artificial Intelligence, IEEE
Computer Society Press, Los Alamitos, pp. 199-254, 1996.
[4] Besnard, P., An Introduction to Default Logic, Springer-Verlag,
Berlin, pp. 27-35, pp.163-177, 1989.
[5] Doyle, J., A Truth Maintenance System, Artificial Intelligence, vol.
12, pp. 231-272, 1979.
[6] Marek, V. W., Nerode, A. and Truszczynski, M., Logic Programming
and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence
series, Springer-Verlag, Berlin, pp. 388-415, 1995.
[7] McCarthy, J., "Circumscription- a form of non-monotonic reasoning,"
Artificial Intelligence, vol. 13, pp. 27-39, 1980.
[8] McDermott, D. and Doyle J., "Nonmonotonic Logic I," Artificial
Intelligence, vol. 13 (1-2), 1980.