Resolution for label-based formulas in hierarchical representation

Authors:
Ken Kaneiwa
Affiliations:
National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430 Japan
Venue:
New Generation Computing
Year:
2004

Citing 12
Cited 0

A mechanical solution of Schubert's steamroller by many-sorted resolution

Artificial Intelligence
Login: A logic programming language with built-in inheritance

Journal of Logic Programming
A more expressive formulation of many sorted logic

Journal of Automated Reasoning
Many-sorted unification

Journal of the ACM (JACM)
Attributive concept descriptions with complements

Artificial Intelligence
An order-sorted logic for knowledge representation systems

Artificial Intelligence
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
An order-sorted resolution in theory and practice

Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Event, property and hierarchy in order-sorted logic

Proceedings of the 1999 international conference on Logic programming
An Order-Sorted Resolution with Implicitly Negative Sorts

Proceedings of the 17th International Conference on Logic Programming
Ontology reasoning in the SHOQ(D) description logic

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Deduction Systems

Deduction Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Order-sorted logic iucludes many and partially ordered sorts as a sort-hierarchy. In the field of knowledge representation and reasoning, it is useful to develop reasoning systems fbr terminological knowledge, together with assertional knowledge. However, the expression of sort-hierarchies cannot sufficiently capture the lexical diversity of terminological knowledge. In addition to sorts, various kinds of symbols: constants, functions and predicates are semantically and hierarchically associated with each other. This is because natural language words identifying these symbols can be employed in the description of terminological knowledge. In this paper, we present a label-based language for consistently handling the variety of hierarchical relationships among symbol names. For this language we develop a sorted resolution system whose reasoning power is enhanced by adding hierarchical inference rules with labeled substitutions.