Asking queries about frames (workshop)
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|asking queries about frames (workshop) }}
- [[]]
bibtex
{{#vardefine:pagename|Asking queries about frames (workshop) }}{{#vardefine:key| }}
abstract: Frame-based knowledge representation and reasoning systems typically provide procedural interfaces for asking about properties of individuals and concepts. We propose an alternative declarative approach that extends standard interface functionality by supporting selective viewing of components of complex objects. Instead of just returning sets of individuals, our queries match concepts and filtered fragments of descriptions. The query language is an extended form of the language used to describe the knowledge-base contents, thus facilitating user training.
In this paper, we describe a variety of possible semantics for answering queries in description logics. We investigate the algorithms required when answers are deduced by matching queries against a "structural normal form" of descriptions. As part of our approach, we introduce a useful refinement of the notion of structural subsumption.
download:
- paper: (http://dl.kr.org/dl96/dl96.tar.gz)
- slides:
| Abstract | Frame-based knowledge representation and r … Frame-based knowledge representation and reasoning systems typically provide procedural interfaces for asking about properties of individuals and concepts. We propose an alternative declarative approach that extends standard interface functionality by supporting selective viewing of components of complex objects. Instead of just returning sets of individuals, our queries match concepts and filtered fragments of descriptions. The query language is an extended form of the language used to describe the knowledge-base contents, thus facilitating user training. In this paper, we describe a variety of possible semantics for answering queries in description logics. We investigate the algorithms required when answers are deduced by matching queries against a "structural normal form" of descriptions. As part of our approach, we introduce a useful refinement of the notion of structural subsumption. t of the notion of structural subsumption. |
| Address | Cambridge, MA + |
| Author | Alex Borgida +, and Deborah L. McGuinness + |
| Bibtype | inproceedings + |
| Booktitle | Proceedings of the 1996 International Workshop on Description Logics + |
| Key | 1996asking + |
| Month | November + |
| Note | Also appear in Proceedings of Fifth International Conference on the Principles of Knowledge Representation and Reasoning Cambridge, Massachusetts, November, 1996. + |
| Paper url | http://dl.kr.org/dl96/dl96.tar.gz + |
| Tag | Computer science + |
| Title | Asking Queries about Frames + |
| Year | 1996 + |
