Abstract
Knowledge acquisition is a difficult, error-prone, and time-consuming task. The task of automatically improving an existing knowledge base using learning methods is addressed by the class of systems performingtheory refinement. This paper presents a system,Forte (First-Order Revision of Theories from Examples), which refines first-order Horn-clause theories by integrating a variety of different revision techniques into a coherent whole.Forte uses these techniques within a hill-climbing framework, guided by a global heuristic. It identifies possible errors in the theory and calls on a library of operators to develop possible revisions. The best revision is implemented, and the process repeats until no further revisions are possible. Operators are drawn from a variety of sources, including propositional theory refinement, first-order induction, and inverse resolution.Forte is demonstrated in several domains, including logic programming and qualitative modelling.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Aben, M., & van Someren, M. (1990). Heuristic Refinement of Logic Programs.Proceedings of the Ninth European Conference on Artificial Intelligence (pp. 7–12). London: Pitman.
Bain, M., & Muggleton, S. (1992a). Non-monotonic learning. In S. Muggleton (Ed.),Inductive Logic Programming. New York, NY: Academic Press.
Bain, M., & Muggleton, S. (1992b). Experiments in Non-monotonic First-Order Induction. In S. Muggleton (Ed.),Inductive Logic Programming. New York, NY: Academic Press.
Bergadano, F., & Giordana, A. (1988). A knowledge intensive approach to concept induction.Proceedings of the Fifth International Workshop on Machine Learning (pp. 305–317). San Mateo, CA: Morgan Kaufman.
Bratko, I. (1991).Prolog programming for artificial intelligence. Reading: MA, Addison Wesley.
Bratko, I., Mozetic, I., & Lavrac, N. (1989)KARDIO: A study in deep and qualitative knowledge for expert systems. Cambridge, MA: MIT Press.
Bratko, I., Muggleton, S., & Varsek, A. (1991). Learning qualitative models of dynamic systems.Proceedings of the Eighth International Workshop on Machine Learning (pp. 385–388). San Mateo, CA: Morgan Kaufman.
Cain, T. (1991). The DUCTOR: A theory revision system for propositional domains.Proceedings of the Eighth International Workshop on Machine Learning (pp. 485–489). San Mateo: CA: Morgan Kaufman.
Cohen, W. (1992). Compiling prior knowledge into an explicit bias.Proceedings of the Ninth International Conference on Machine Learning (pp. 102–110). San Mateo, CA: Morgan Kaufman.
Cohen, W. (1993). Pac-learning a restricted class of recursive logic programs.Proceedings of the Eleventh National Conference on Artificial Intelligence (pp. 86–92). San Mateo, CA: Morgan Kaufman.
Coiera, E. (1989). Generating qualitative models from example behaviors. Technical Report DCS 8901, Department of Computer Science, University of New South Wales.
Craw, S., & Sleeman, D. (1991). The flexibility of speculative refinement.Proceedings of the Eighth International Workshop on Machine Learning (pp. 28–32). San Mateo, CA: Morgan Kaufman.
DeRaedt, L., & Bruynooghe, M. (1992). Interactive concept learning and constructive induction by analogy.Machine Learning, 8, 107–150.
Falkenhainer, B. (1990). A unified approach to explanation and theory formation. In J. Shrager and P. Langley (Eds.),Computational Models of Scientific Discovery and Theory Formation. San Mateo, CA: Morgan Kaufman.
Falkenhainer, B., & Forbus, K. (1991). Compositional modelling: Finding the right model for the job.Artificial Intelligence, 51, 95–144.
Falkenhainer, B., & Rajamoney, S. (1988). The interdependencies of theory formation, revision, and experimentation.Proceedings of the Fifth International Conference on Machine Learning (pp. 353–366). San Mateo, CA: Morgan Kaufman.
Gärdenfors, P. (1992) (Ed.).Belief Revision. Cambridge, England: Cambridge University Press.
Ginsberg, A. (1990). Theory reduction, theory revision and retranslation.Proceedings of the Eighth National Conference on Artificial Intelligence (pp. 777–782). Cambridge, MA: MIT Press.
Ginsberg, A., & Weiss, S. and Politakis, P. (1988). Automatic knowledge-base refinement for classification systems.Artificial Intelligence, 35, 197–226.
Hinton, G.E. (1986). Learning distributed representations of concepts.Proceedings of the Eighth Annual Conference of the Cognitive Science Society (pp. 1–12). Hillsdale, NJ: Erlbaum.
Kay, H. (1992). A qualitative model of the space shuttle reaction control system. Technical Report AI92-188, Artificial Intelligence Laboratory, University of Texas at Austin.
Kijsirikul, B., Numao, M., & Shimura, M. (1992). Discrimination-based constructive induction of logic programs.Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 44–49). Cambridge, MA: MIT Press.
Kuipers, B. (1986). Qualitative simulation.Artificial Intelligence, 29, 289–338.
Kuipers, B. (1989). Qualitative reasoning: Modelling and simulation with incomplete knowledgeAutomatica, 25, 571–585.
Langley, P. (1980). Finding common paths as a learning mechanism. CIP Working Paper 419, Carnegie-Mellon University.
Lapointe, S., & Matwin, S. (1992). Sub-unification: A tool for efficient induction of recursive programs.Proceedings of the Ninth International Conference on Machine Learning (pp. 273–281). San Mateo, CA: Morgan Kaufman.
Lloyd, J.W. (1987).Foundations of logic programming, second, extended edition. Berlin: Springer-Verlag.
Mahoney, J., & Mooney, R. (1993). Combining connectionist and symbolic learning to refine certainty-factor rule bases.Connection Science, 5, 339–364.
Mooney, R.J. (in press). A preliminary PAC analysis of theory revision. In T. Petsche, S. Judd, and S. Hanson (Eds.)Computational Learning Theory and Natural Learning Systems, Vol. 3. Cambridge, MA: MIT Press.
Muggleton, S. (1992a). Inductive logic programming. In S. Muggleton (Ed.),Inductive Logic Programming (pp. 3–27). New York, NY: Academic Press.
Muggleton, S. (1992b). Inverting implication.Proceedings of the Second International Workshop on Inductive Logic Programming. Tokyo.
Muggleton, S., & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution.Proceedings of the Fifth International Conference on Machine Learning (pp. 339–352). San Mateo, CA: Morgan Kaufman.
Muggleton, S & Feng, C. (1992). Efficient induction of logic programs. In S. Muggleton (Ed.)Inductive Logic Programming (pp. 281–298). New York, NY: Academic Press.
Ourston, D., & Mooney, R. (1990). Changing the rules: A comprehensive approach to theory refinement.Proceedings of the Eighth National Conference on Artificial Intelligence (pp. 815–820). Cambridge, MA: MIT press.
Ourston, D., & Mooney, R. (1991). Improving shared rules in multiple category domain theories.Proceedings of the Eighth International Workshop on Machine Learning (pp. 534–538). San Mateo, CA: Morgan Kaufman.
Ourston, D., & Mooney, R. (1994). Theory refinement combining analytical and empirical methods.Artificial Intelligence, 66, 311–344.
Pazzani, M., & Brunk, C. (1990). Detecting and correcting errors in rule-based expert systems: An integration of empirical and explanation-based learning.Proceedings of the 5th Knowledge Acquisition for Knowledge-Based Systems Workshop.
Pazzani, M., & Kibler, D. (1992). The utility of prior knowledge in inductive learning.Machine Learning, 9, 57–94.
Plotkin, G. D. (1971). Automatic Methods of Inductive Inference. Ph.D. Thesis. Edinburgh University, Edinburgh, Scotland.
Quillian, M.R. (1968). Semantic memory. In M. Minsky (Ed.)Semantic Information Processing. Cambridge, MA: MIT Press.
Quinlan, J.R. (1990). Learning logical definitions from relations.Machine Learning, 5, 239–266.
Quinlan, J.R. (1991). Determinate literals in inductive logic programming.Proceedings of the Eighth International Workshop on Machine Learning (pp. 442–446). San Mateo, CA: Morgan Kaufman.
Rajamoney, S. (1990). A computational approach to theory revision. In J. Shrager and P. Langley (Eds.),Computational Models of Scientific Discovery and Theory Formation. San Mateo, CA: Morgan Kaufman.
Richards, B. (1992). An operator-based approach to first-order theory revision. Ph.D. Thesis. Department of Computer Sciences, University of Texas, Austin, TX. Also appears as Technical Report AI 92-181, Artificial Intelligence Laboratory.
Richards, B., Kraan, I., & Kuipers, B. (1992). Automatic abduction of qualitative models.Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 723–728). Cambridge, MA: MIT Press.
Richards, B., & Mooney, R. (1992). Learning relations by pathfinding.Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 50–55). Cambridge, MA: MIT Press.
Sammut, C., & Banerji, R.B. (1986). Learning concepts by asking questions. In R.S. Michalski, J.G. Carbonell, and T.M. Mitchell (Eds.)Machine Learning: An Artificial Intelligence Approach, Volume II. San Mateo, CA: Morgan Kaufman.
Shapiro, E. (1983).Algorithmic program debugging. Cambridge, MA: MIT Press.
Shortliffe, E.H., & Buchanan, B.G. (1975). A model of inexact reasoning in medicine.Mathematical Biosciences, 23, 351–379.
Tangkitvanich, S., & Shimura, M. (1992). Refining a relational theory with multiple faults in the concept and subconcepts.Proceeding of the Ninth International Conference on Machine Learning (pp. 436–444). San Mateo, CA: Morgan Kaufman.
Towell, G., & Shavlik, J. (1993). Extracting refined rules from knowledge-based neural networks.Machine Learning, 13, 71–101.
Wilkins, D. (1988). Knowledge base refinement using apprenticeship learning techniques.Proceedings of the Seventh National Conference on Artificial Intelligence (pp. 646–651). San Mateo, CA: Morgan Kaufman.
Wirth, R., & O'Rorke, P. (1991). Constraints on predicate invention.Proceedings of the Eighth International Workshop on Machine Learning (pp. 457–461). San Mateo, CA: Morgan Kaufman.
Wrobel, S. (1993). On the proper definition of minimality in specialization and theory revision. In Brazdil (Ed.)Machine Learning — ECML-93 (pp. 65–81). Springer Lecture Notes on Artificial Intelligence Vol. 667.
Wogulis, J. (1991). Revising relational domain theories.Proceedings of the Eighth International Workshop on Machine Learning (pp. 462–466). San Mateo, CA: Morgan Kaufman.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Richards, B.L., Mooney, R.J. Automated refinement of first-order horn-clause domain theories. Mach Learn 19, 95–131 (1995). https://doi.org/10.1007/BF01007461
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01007461