Inference methods and semantics on or-type knowledge bases
Or-type knowledge is information which has some disjunctive conclusions, for example, (A∨B)←C. We often face with this type of knowledge in our everyday lives. There are several problems to deal with such type of knowledge in computer systems. In general, it is difficult to represent the or-type knowledge in Horn logic. In this paper, we extend first order formulas and define the interpretations for them in a three valued logic. According to the discussion, a Horn clause is also extended so as to deal with the or-type knowledge. We show a fixpoint theorem, the soundness and completeness of a resolution.
Unable to display preview. Download preview PDF.
- R. Reiter: On Closed World Databases, In Logic and Databases, H. Gallaire Eds., 1979.Google Scholar
- J.W. Lloyd: Foundation of Logic Programming, Springer-Verlag, 1984.Google Scholar
- Tanaka and Katsuno: Ko-sui-jun Database (unpublished manuscript in Japanese).Google Scholar
- D.W. Loveland: Near-Horn Prolog, Proc. 4th Int. Conf. on Logic Programming, 1987.Google Scholar
- J.W. Lloyd and R.W. Toper: Making Prolog More Expressive, Journal of the Logic Programming vol.3, 1984.Google Scholar
- E.F. Codd: Extending the Database Relational Model to Capture More Meaning, ACM Transaction on Database Systems, vol.4, no.4, 1979.Google Scholar
- W. Lipski: On Semantic Issues Connected with Incomplete Information Databases, ACM Transaction on Database Systems, vol.4, no.3, 1979.Google Scholar
- W. Lipski: On Databases with Incomplete Information, Journal of the ACM, vol.28, no.1, 1981.Google Scholar
- R.Turner: Logics for Artificial Intelligence, Ellis Horwood, 1984.Google Scholar