Showing papers on "Semantic Web Rule Language published in 1983"

Type hierarchies and Semantic Data Models

Abstract: The basic abstraction mechanisms of Semantic Data Models - aggregation, classification and generalization - are considered the essential features to overcome the limitations of traditional data models in terms of semantic expressiveness. An important issue in database programming language design is which features should a programming language have to support the abstraction mechanisms of Semantic Data Models. This paper shows that when using a strongly typed programming language, that language should support the notion of type hierarchies to achieve a full integration of Semantic Data Models abstraction mechanisms within the language's type system. The solution is presented using the language Galileo, a strongly typed, interactive programming language specifically designed for database applications.

Inference-driven semantic analysis

Abstract: A primary problem in the area of natural language processing is the problem of semantic analysis. This involves both formalizing the general and domain-dependent semantic information relevant to the task involved, and developing a uniform method for access to that information. Natural language interfaces are generally also required to have access to the syntactic analysis of a sentence as well as knowledge of the prior discourse to produce a semantic representation adequate for the task. This paper briefly describes previous approaches to semantic analysis, specifically those approaches which can be described as using templates, and corresponding multiple levels of representation. It then presents an alternative to the template approach, inference-driven semantic anaylsis, which can perform the same tasks but without needing as many levels of representation.