by Alex Borgida
Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92
ftp://athos.rutgers.edu/pub/borgida/clasp-reconstructed-KR92.ps.gz
Add To MetaCart
Abstract:
It is argued that considerable benefits can be obtained by making KR&R systems easily extendable, so that new language constructs can be added on a per-application basis. In order to achieve this extensibility we need techniques for formally specifying the extensions, and for modularly and locally modifying the implementations. We present two such techniques applicable to the family of reasoners based on Description/Terminological Logics, namely natural semantics rules of inference, and the protodl customizable KBMS architecture. The bulk of the paper aims to demonstrate the efficacy of these techniques, together with some heuristics for their use, by showing how we could reconstruct a previously proposed description logic: Devanbu and Litman's extension to classic, called clasp, designed to reason about actions and plans. In the process, we uncover a few deficiencies in the original proposal, and provide for the first time a formal semantics for clasp.
Citations
|
334
|
Building Large Knowledge-Based Systems
– Lenat, Guha
- 1990
|
|
299
|
CLASSIC: A structural data model for objects
– Borgida, Brachman, et al.
- 1989
|
|
161
|
The Evolving Technology of Classification-Based Knowledge Representation Systems
– MacGregor
- 1991
|
|
152
|
LaSSIE: a Knowledge-based Software Information System
– Devanbu, Brachman, et al.
- 1990
|
|
149
|
The KL-ONE family
– Woods, Schmolze
|
|
125
|
Object Oriented Software Construction
– Meyer
- 1997
|
|
110
|
Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and The Utility of Representation Services
– Doyle, Patil
- 1991
|
|
63
|
Tractable Concept Languages
– Donini, Nutt, et al.
- 1991
|
|
61
|
Computing least common subsumers in description logics
– Cohen, Borgida, et al.
- 1992
|
|
58
|
Terminological reasoning with constraint networks and an application to plan recognition
– WEIDA, LITMAN
- 1992
|
|
41
|
Jewels of Formal Language Theory
– Salomaa
- 1981
|
|
39
|
From Type Systems to Knowledge Representation: Natural Semantics Specifications for Description Logics
– Borgida
- 1992
|
|
35
|
An Overview of Meta-Level Architecture
– Genesereth
- 1983
|
|
33
|
Plan-Based Terminological Reasoning
– Devanbu, Litman
- 1991
|
|
24
|
Empirical investigations of knowledge representation servers: Design issues and applications experience with KRS
– Gaines
- 1991
|
|
22
|
Executable specification of static semantics
– Despeyroux
- 1984
|
|
19
|
RAT: representation of actions using terminological logics
– Heinsohn, Kudenko, et al.
- 1992
|
|
17
|
RLL: A representation language language
– Greiner, Lenat
- 1980
|
|
13
|
Consistent and complementary formal theories of the semantics of programming languages
– Hoare, Lauer
- 1974
|
|
11
|
Joshua: Uniform Access to Heterogeneous Knowledge Structures
– Rowley, Shrobe, et al.
- 1987
|
|
5
|
ProtoDL : a customizable knowledge base management system
– Borgida, Brachman
- 1992
|
|
2
|
Natural Semantics", Rapport de Recherche No
– Kahn
|
|
1
|
Terminologic Frames as Types: Inference rules and prospective applications
– Borgida
- 1991
|
|
1
|
A new look at Description Logics and their Utility in Information Management ( or Description Logics are not just for the Flightless-Birds
– Borgida
- 1992
|
|
1
|
A Temporal Terminologic Reasoner
– Schmiedel
- 1990
|
