A calculus for logical clustering
A formal calculus, LC, for logical clustering is proposed in this paper. In addition to conventional first-order logic, a nonmonotonic inference rule for logical clustering is introduced, such that typical forms of induction and analogy are uniformly treated in our theory. Our result shows that the nature of induction and analogy are both “information compression”, that is, the merging of indistinguishable logical symbols. Argumentation games for the implementation of LC are also discussed in this paper.
Key wordsNonmomnotonic reasoning logical clustering argumentation games
Unable to display preview. Download preview PDF.
- S. Bai, Reasoning by Argueing: A Game Theoretic Approach, in Automated Reasoning, IFIP Transactions A-19 (Z. Shi Ed.), Elsevier Science Publishers B. V. (NOrth-Holland) 1992, 75–82.Google Scholar
- B. Li, Analogical Reasoning: Theory and Implementation. Ph. D. Theses, Beijing Astro, and Aeron. University. 1993.Google Scholar
- R. Michalski and R. Stepp, Learning from Observation: Conceptual Clustering, in Machine Learning, Vol. 1, Springer Verlag, 1984.Google Scholar
- R. Reiter, A Logic for Default Reasoning. Artificial Intelligence, 13 (1980) 81–132.Google Scholar