Universally quantified queries in languages with order-sorted logics
In many applications of Knowledge-Based Systems or deductive databases the user wants to be able to check whether a certain property P(x) holds globally, i.e. whether it can be derived for all the individuals in the data base. Normally knowledge representation systems or logic programming systems cannot answer such requests. In this paper we show that the taxonomy of classes available in standard knowledge representation languages allows to solve this kind of query by dividing the proof into several cases according to the subsort structure present in the knowledge base.
Unable to display preview. Download preview PDF.
- J. H. Gallier. Logic for Computer Science — Foundations of Automatic Theorem Proving. Harper & Row, New York, 1986.Google Scholar
- O. Herzog and C.-R. Rollinger, editors. Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, volume 546 of Lecture Notes in Artifical Intelligence. Springer Verlag, Berlin, Heidelberg, 1991.Google Scholar
- J-L. Lassez, M.J. Maher, and K. Marriott. Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann Publishers, Los Altos, 1987.Google Scholar
- D. W. Loveland. Automated Theorem Proving: A Logical Basis North Holland, 1978.Google Scholar
- D. Miller. Lexical scoping as universal quantification. In Proc. of the 6th ICLP, 1989.Google Scholar
- N. J. Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.Google Scholar
- M. Schmidt-Schauß. Computational Aspects of an Order-Sorted Logic with Term Declarations. Lecture Notes in Artificial Intelligence. Springer-Verlag, 1989.Google Scholar