Generalization with taxonomic information

Authors:
Alan M. Frisch;C. David Page, Jr.
Affiliations:
Dept. of Computer Science and Beckman Institute, University of Illinois, Urbana, IL;Dept. of Computer Science and Beckman Institute, University of Illinois, Urbana, IL
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Year:
1990

Citing 6
Cited 0

Explicit representation of terms defined by counter examples

Journal of Automated Reasoning
Generalized subsumption and its applications to induction and redundancy

Artificial Intelligence
Unification revisited

Foundations of deductive databases and logic programming
Hierarchical knowledge bases and efficient disjunctive reasoning

Proceedings of the first international conference on Principles of knowledge representation and reasoning
A general framework for sorted deduction: fundamental results on hybrid reasoning

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Analogy as a constrained partial correspondence over conceptual graphs

Proceedings of the first international conference on Principles of knowledge representation and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies sorted generalization--the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorithm for the task, discusses the algorithm and task complexity, and presents semantic properties of sorted generalization. Based on its semantic properties, we show how sorted generalization is applicable to such problems as abduction, induction, knowledge base vivification, and analogical reasoning. Significant distinctions between this work and related work with taxonomic information arise from the generality of the taxonomic theories we allow, which may be any first-order taxonomic theories, and the semantic completeness properties of sorted generalization.