Abstract
It is desirable to automatically learn the effects of actions in an unknown environment. Using situation calculus in a causal domain is a very natural way of recording the actions and their effects. These could later be used for Automatic Programming purposes. A brute force approach to representing the situations involves recording the value of all the available variables. This is a combinatorial problem, and becomes unmanageable when the number of variables, or their domains, gets too large. A solution is to represent the situations and the transitions among the situations using first order logic formulas, which allows for generalizations and removal of irrelevant variables. But this usually requires a domain expert to act as a programmer. In this paper we look at the problem of automatic learning of causal and association rules in a situation calculus domain from observations, with little help from a domain expert. We feed C4.5 with temporal data generated in an Artificial Life environment, where the results of taking an action are not known to the creatures living in it. We show that C4.5 can discover causal rules, and has a good ability to prune irrelevant variables. We have modified C4.5 to generate Prolog rules as output, and show how the automatically learned rules can be used to make plan generators. The presented approach succeeds in generating plans in deterministic environments and needs less domain dependent preprocessing than techniques like Reinforcement Learning or Genetic Programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karimi, K. and Hamilton, H. J. (2000). Finding Temporal Relations: Causal Bayesian Networks vs. C4.5. The 12th International Symposium on Methodologies for Intelligent Systems (ISMIS’2000), Charlotte, NC, USA.
Koza, J. R. and Rice, J. P. (1992). Automatic Programming of Robots using Genetic Programming. The Tenth National Conference on Artificial Intelligence, Menlo Park, CA, USA.
Levesque, H. J., Reiter, R., Lespérance, Y., Lin, éF. and Scherl. R. (1997). GOLOG: A Logic Programming Language for Dynamic Domains. Journal of Logic Programming, 31, pp. 59–84.
Levy, S. (1992). Artificial Life: A Quest for a New Creation. Pantheon Books.
Lin F. and Reiter, R. (1997). Rules as actions: A Situation Calculus Semantics for Logic Programs. Journal of Logic Programming Special Issue on Reasoning about Action and Change, 31 (1-3), pp.299–330.
McCarthy, J. and Hayes, P. C. (1969). Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence 4.
Moore, R. C. (1985). The Role of Logic in Knowledge Representation and Commonsense Reasoning. Readings in Knowledge Representation, Morgan Kaufmann, pp. 335–341.
Poole, D. (1998). Decision Theory, the Situation Calculus, and Conditional Plans. Linköping Electronic Articles in Computer and Information Science, Vol. 3 (1998): nr 3, http://www.ep.liu.se/ea/cis/1998/008.
Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann.
Van Le, T. (1993). Techniques of Prolog Programming. John Wiley & Sons.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this paper
Cite this paper
Karimi, K., Hamilton, H.J. (2001). Learning with C4.5 in a Situation Calculus Domain. In: Bramer, M., Preece, A., Coenen, F. (eds) Research and Development in Intelligent Systems XVII. Springer, London. https://doi.org/10.1007/978-1-4471-0269-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0269-4_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-403-1
Online ISBN: 978-1-4471-0269-4
eBook Packages: Springer Book Archive