Abstract
Relative least general generalization proposed by Plotkin, is widely used for generalizing first-order clauses in Inductive Logic Programming, and this paper describes an extension of Plotkin’s work to allow various computation domains: Herbrand Universe, sets, numerical data, ect. The ϕ-subsumption in Plotkin’s framework is replaced by a more general constraint-based subsumption. Since this replacement is analogous to that of unification by constraint solving in Constraint Logic Programming, the resultant method can be viewed as a Constraint Logic Programming version of relative least general generalization. Constraint-based subsumption, however, leads to a search on an intractably large hypothesis space. We therefore providemeta-level constraints that are used as semantic bias on the hypothesis language. The constraintsfunctional dependency andmonotonicity are introduced by analyzing clausal relationships. Finally, the advantage of the proposed method is demonstrated through a simple layout problem, where geometric constraints used in space planning tasks are produced automatically.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dolsak, B. and Muggleton, S., “The Application of Inductive Logic Programming to Finite Element Mesh Design,” inInductive Logic Programming (S. Muggleton, ed.), Chapter 23, Academic Press, pp. 453–472, 1992.
Gabbrielli, M. and Levi, G., “Modeling Answer Constraints in Constraint Logic Programming,”Proc. of the Eighth International Conference on Logic Programming, pp. 238–252, 1991.
Jaffar, J. and Lassez, J. L., “Constraint Logic Programming,”Proc. of the 14th ACM Principles of Programming Languages Conference, pp. 111–119., 1987.
Jaffar, J. et al., “Projecting CLP(R) Constraints,”New Generation Computing, 11, 3 and4, pp. 449–469, 1993.
Kawamura, T. and Furukawa, K., “Towards Inductive Generalization in Constraint Logic Programs,”Technical Report, Faculty of Environmental Information, Keio University, 1993.
Languley, P., “Rediscovering Chemistry with the BACON System,” inMachine Learning (R. S. Michalski, J. G. Carbollel, and T. M. Mitchell, eds.), Morgan Kaufmann, pp. 307–330, 1983.
Mizoguchi, F. and Ohwada, H., “Constraint-Directed Generalization for Spatial Relations,”Proc. of the Second International Workshop on Inductive Logic Programming, ICOT TM-1182, pp. 142–159, 1992.
Mizoguchi, F., et al., “A Constraint Logic Programming Approach to Floor Planning,”Proc. of the Second International Conference on Prolog Applications, 1994.
Muggleton, S., “Inductive Logic Programming,”New Generation Computing, 8, pp. 295–318, 1991.
Muggleton, S. and Feng, C., “Efficient Induction of Logic Programs,”Proc. of the First Conference on Algorithmic Learning Theory, Ohmsha, pp. 1–14, 1990.
Muggleton, S., “Inductive Logic Programming: Derivations, Successes and Shortcomings,”SIGART Bulletin, 5, 1, pp. 5–11, 1994.
Page, C. D. Jr. and Frisch, A. M., “Generalizing Atoms in Constraint Logic,”Proc. of the Second International Conference on Principles of Knowledge Representation and Reasoning, pp. 429–440, 1991.
Pfefferkorn, C. E., “A Heuristic Problem Solving Design System for Equipment or Furniture Layouts,”Communications of the ACM, 18, 5, pp. 286–297, 1975.
Plotkin, G. D., “A Note on Inductive Generalization,”Machine Intelligence (B. Meltzer and D. Michie, eds.), Edinburgh University Press, pp. 153–163, 1970.
Quinlan, J. R., “Learning Logical Definitions from Relations,”Machine Learning, 5, pp. 239–266, 1990.
Quinlan, J. R., “Determinate Literals in Inductive Logic Programming,”Proc. of the Twelfth International Joint Conference on Artificial Intelligence, pp. 746–750, 1991.
Quinlan, J.R. and Rivest, R. L., “Inferring Decision Trees Using the Minimum Description Length Principle,”Information and Computation., 80 pp. 227–248, 1989.
Rouveirol, C., “Extensions of Inversion of Resolution Applied to Theory completion,” inInductive Logic Programming (S. Muggleton, ed.), Academic Press, pp. 63–92, 1992.
Rissanen, J., “Modeling by Shortest Data Description,”Automatica, 14, pp. 465–471, 1978.
Author information
Authors and Affiliations
Additional information
Fumio Mizoguchi: He is a Professor and Director of Intelligent System Laboratory, Science University of Tokyo. He received the B. S degree in 1966, the MS degree in 1968 in Industrial Chemistry from Science University of Tokyo and Ph. D in 1978 from U. C. The University of Tokyo. He has been working on Artificial Intelligence with various approaches. The most recent approaches are the use of constraint Logic Programming and Inductive Logic Programming for real world problems.
Hayato Ohwada, Ph.D.: He is an Assistant Professor of Industrial Administration, Science University of Tokyo. He received the B. S. degree in 1983, the M. S. degree in 1985 and the Dr. Eng. degree in 1988 from Science University of Tokyo. He has been working on inductive logic programming, constraint logic programming and intelligent decision support systems.
About this article
Cite this article
Mizoguchi, F., Ohwada, H. Constrained relative least general generalization for Inducing Constraint Logic Programs. NGCO 13, 335–368 (1995). https://doi.org/10.1007/BF03037230
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037230