71 citations found. Retrieving documents...
R. J. Brachman, R. E. Fikes, and H. J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(10): 67--73, 1983.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Action representation for NL instructions - Di Eugenio (1991)   (1 citation)  (Correct)

....not recipes to achieve a certain goal [2] such as how to assemble a piece of fur niture. The distinction between terminological and nonterminological knowledge was put forward in the past as the basis of hybrid KR system, such as those that stemmed from the KL ONE formalism, for example KRYPTON [3], KL TWO [13] and more recently CLASSIC [4] Such systems provide an assertional part, or A Box, used to assert facts or beliefs, and a terminological part, or T Box, that accounts for the meaning of the complex terms used in these asser tions. In the past however, it has been the case that ....

R. Brachman, R. Fikes, and H. Levesque. KRYP- TON: A Functional Approach to Knowledge Representation. Technical Report FLAIR 16, Fairchild Laboratories for Artificial Intelligence, Palo Alto, California, 1983.


Understanding - Natural Language Instructions   (Correct)

....described in the previous section. Before doing that, I will make some remarks on the action representation I adopt and on the sUucture of the intentions the plan graph that my algorithm contributes to building. Action representation. To represent action types, I use an hybrid system (Brachman et al. 1983), whose primifives are taken from JackendoWs Conceptual Suuctures (1990) relations between action types are represented in another module of the system, the action library. I d like to spend a few words justifying the choice of an hybrid system: this choice is neither casual, nor determined by ....

R. Brachman, R.Fikes, and H. Levesque. KRYPTON: A Functional Approach to Knowledge Representation. Technical Report FLAIR 16, Fairchild Laboratories for Artificial Intelligence, Palo Alto, California, 1983.


A Terminological Simplification Transformation for Natural.. - David Stallard Bbn (1986)   (5 citations)  (Correct)

....Both concepts and roles may associated with names. In logical terms, a concept may be identified as the oneplace predicate with its name, and a role as the twoplace predicates with its name. I will now give the meaning postulates for a termforming algebra, similar to the one described in [2] in which one can write down the sort of NIKL expressions I will need. Expressions in this language are combEnable to yield a complex concept or role as their value. CONJ C1 CN) lambda (X) and (C1 X) Cn X) VALUERESTRICT R C) 5 (lambda (X) forall Y ( R X Y) c Y) ....

Brachman, R.J., Fikes, R.E., and Lovesqua, H.J. Krypton: A Functional Approach to Knowledge Representation. IEEE Computer, Specicl Issue on Knowledge Representation , October, 1983.


Conceptual Representation For Knowledge Bases - And Intelligent Information   (Correct)

....coercing the pilot at gunpoint ; a beagle is a sort of hound a hound is a dog of any of various hunting breeds all dogs are animals . Semantic memory corresponds to dictionary definitions, and episodic memory to history and biographical data (in the broadest acceptance of the terms) see [BRAC85c] about the reason to distinguish carefully between these two components of the KRL. Their representation inside the knowledge bases requires the use of tools which are, at least partially, different ; I will, therefore, separate their treatment. 553 3.1 Episodlc memory Brachmann and his ....

....two components of the KRL. Their representation inside the knowledge bases requires the use of tools which are, at least partially, different ; I will, therefore, separate their treatment. 553 3. 1 Episodlc memory Brachmann and his coilagues propose, for the assortiona[ component of KRYPTON [BRAC85c : 421 422] a solution in the form of a language structured cornl3sitionally like a first order predicate calculus language, where lhe sentence forming operators are the usual ones : Not, Or, ThereExists, and so on. We think that the generictry of this approach may lead Io the use of very heavy ....

BRACHMAN, R.J., FIKES, R.E., and LFVESQUE, H.J. (1985) "KRYPTON : A Functional Approach to Knowledge Representation", in Readings in Knowledge Representation, Brachman, R.J., and Lavesqua, H.J., eds. Los Altos: Morgan Kaufmann.


Taxonomic Syntax for First Order Inference - McAllester, Givan (1989)   (19 citations)  (Correct)

....IRI 8819624 and in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014 86 K 0180. 1989 Massachusetts Institute of Technology. I Introduction relationships between classes [Bobrow and Winograd, 1977] Fahlman, 1979] [Brachman, 1983], Brachman et al. 1983] Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Designers of knowledge representation lan guages have argued that there are computational advantages to representing facts as ....

....and in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014 86 K 0180. 1989 Massachusetts Institute of Technology. I Introduction relationships between classes [Bobrow and Winograd, 1977] Fahlman, 1979] Brachman, 1983] [Brachman et al. 1983]. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Designers of knowledge representation lan guages have argued that there are computational advantages to representing facts as taxonomic relationships ....

R. Brachman, R. Fikes, and H. Levesque. Kryp- ton: A functional approach to knowledge representation. IEEE Computer, 16:63-73, 1983.


Unknown -   (Correct)

....and inference scheme are: Expressivity What facts are expressible in the scheme The more the better, subject to a trade off. What desirable facts are inexpressible Disjunctive facts often are prohibited in part because of tractability, as in the terminological component of Krypton [3]. Does the scheme cluster closely related objects Deductive Power What new facts are deducible from the given facts What type of inconsistency is discovered For example, a directed graph of arithmetic constraints is inconsistent whenever the sum of weights along the edges of a loop ....

R.J. Brachman, R.E. Fikes, and H.J. Levesque. "Krypton: A Functional Approach to Knowledge Representation". IEEE Computer 16, 10 (Oct 1983), 67-73.


Unknown -   (Correct)

....and inference scheme are: Expressivity What facts are expressible in the scheme The more the better, subject to a trade off. What desirable facts are inexpressible Disjunctive facts often are prohibited in part because of tractability, as in the terminological component of Krypton [3]. Does the scheme cluster closely related objects Deductive Power What new facts are deducible from the given facts What type of inconsistency is discovered For example, a directed graph of arithmetic constraints is inconsistent whenever the sum of weights along the edges of a loop ....

RJ. Brachman, R.E. Fikes, and H.J. Levesque. "Krypton: A Functional Approach to Knowledge Representation". IEEE Computer 16, 10 (Oct 1983), 67-73.


Change Management of Shared and Local Health-Care Terminologies - Oliver, Shahar   (Correct)

....[16] Numerous other researchers followed his work by designing variants of KL ONE in the 1980s. Each offered a slightly different approach, emphasizing one aspect or another, and a significant body of research has accumulated. Examples of knowledgerepresentation languages are Krypton [17], BACK [18] CLASSIC [19] Loom [20] and K Rep [21, 22] Cimino, in 1994 [6] argued for following a knowledge based approach to managing medical terminology, Rector and colleagues populated an implementation of the description logic GRAIL with medical terms [23] and Campbell and colleagues ....

Brachman RJ, Fikes R and Levesque H. Krypton: A functional approach to knowledge representation. Computer 1983; 16(10): 67-73.


Tractable Reasoning In Knowledge Representation Systems - Dalal (1995)   (2 citations)  (Correct)

....relation in some formal logic. Thus, Tell and Ask operations implement some form of deductive rea soning. The logics most commonly used are first order logic and propositional logic [Men64, Yas94] since Tel and Ask are usually subsets of their underlying languages. It has been cogently argued [BFL83] that for the computational services of a KR system to be dependable, their worst case time requirements should be small enough to allow adequate response in all critical situations. In other words, Tell and Ask operations should be tractable, which is usually taken to mean that they be in PTIME ....

R.J. Brachman, R.E. Fikes, and H.J. Levesque. Krypton: A functional approach to knowledge representation. IEEE Computer, 16(10):67-73, 1983.


Object-Oriented Reasoning about Action and Change - Gustafsson   (Correct)

....We only have to override the methods that we want to change, leaving the entire original scenario description unchanged. 5 Related work Much work has been done in combining object oriented ideas with the area of knowledge representation. One such area is description logics (see for example [6, 5]) Description logics are languages tailored for expressing knowledge about concepts (similar to classes) and concept hierarchies. They are usually given a Tarski style declarative semantics, which allows them to be seen as sublanguages of predicate logic. One starts with primitive concepts and ....

R. Brachman, R. Fikes, and H. Levesque. KRYPTON: A functional approach to knowledge representation. Computer, 1983.


Elaboration Tolerance through Object-Orientation - Gustafsson, Kvarnström   (Correct)

....TAL controller class that drives a car. A complete TAL action scenario will soon be available at the VITAL web page [14] 7 Related Work Much work has been done in combining ideas found in object oriented languages with the area of knowledge representation. One such area is description logics [5, 6], languages tailored for expressing knowledge about concepts (similar to classes) and concept hierarchies. They are usually given a Tarski style declarative semantics, which allows them to be seen as sub languages of predicate logic. Starting with primitive concepts and roles, one can use the ....

R. Brachman, R. Fikes, and H. Levesque. KRYPTON: A functional approach to knowledge representation. Computer, 16:67--73, 1983.


Benefits of an OODB Representation for Controlled.. - Gu, Halper, Geller, Perl (1999)   (Correct)

....of Quillian s original semantic network [42] Quite a number of KL ONE descendants exist, which makes this probably the largest and most successful family of implemented knowledge representation systems. Two excellent overviews are [43, 44] while some of the family members are described in [45, 40, 46, 47, 48] [49, 50] 51, 52, 53, 54] 55] Several other semantic networks that do not belong to the family of Description Logics exist, such as those described in [56, 57] Our own choice of using Object Oriented Databases instead of Description Logics is based on two kinds of reasons, which may be ....

Brachman RJ, Fikes RE, Levesque HJ. KRYPTON: A functional approach to knowledge representation. IEEE Computer 1983;16(10):67--73, 1983.


Automated Deduction by Theory Resolution - Stickel (1985)   (101 citations)  (Correct)

....need to perform taxonomic reasoning and because it extends the power of the knowledge representation system towards greater logical completeness. Other researchers have also cited the advantages of integrating knowledge representation systems with more general deduction systems [7, 26] Krypton [6, 24] represents an approach to constructing a knowledge representation system composed of two parts: a terminological component (the TBox) and an assertional component (the ABox) For such systems, theory resolution indicates in general how information can be provided to the ABox by the TBox and how ....

....For reasoning in his modal logic of belief, Konolige envisages using a system organized on principles similar to metatheory resolution. We have already suggested the importance of theory resolution for taxonomic reasoning. This is being explored in the Krypton knowledge representation system [6, 24]. Figures 1 and 2 contain proofs with and without Krypton terminological reasoning. 4 The problem is to prove that, if Chris has no sons and no daughters, then Chris has no children. The terminological information used in this problem through theory resolution includes the statements that boys ....

[Article contains additional citation context not shown here]

Brachman, R.J., R.E. Fikes, and H.J. Levesque. Krypton: a functional approach to knowledge representation. IEEE Computer 16, 10 (October 1983), 67--73.


A Semantics and Complete Algorithm for Subsumption in.. - Borgida, Patel-Schneider (1994)   (99 citations)  (Correct)

....the reasoning problem is undecidable. ffl Carefully devise a language of limited expressive power for which reasoning is tractable, and then provide a complete implementation for it. This was the approach chosen by the designers of such languages as kandor (Patel Schneider, 1984) and krypton (Brachman et al. 1983), and is close to the approach in classic (Borgida et al. 1989) A hidden difficulty in the second and third approach is to produce an implementation that is correct ( complete ) with respect to the semantics. This difficulty is illustrated by the discovery, several years later, that the ....

Brachman, R. J., Fikes, R. E., & Levesque, H. J. (1983). KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16 (10), 67--73.


Term Subsumption with Type Constructors - Piza, Schewe, Schmidt (1992)   (5 citations)  (Correct)

.... modelling, subsumption, type constructor, restructuring 1 Introduction The notion of term subsumption languages (TSLs) was introduced by Peter Patel Schneider in 1989 to refer to all kinds of knowledge representation systems based on Brachman s original idea of KL ONE [5] Systems such as KRYPTON [6], BACK [8] and CLASSIC [4] have emerged from this idea. These systems generalize both semantic networks and frames. Moreover, they embody a formal term description language together with a model theoretic semantics. In general TSLs distinguish between a terminological layer consisting of a ....

R. Brachman, R. Fikes, and H. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(11), 1983. 11


The Algebraic Structure of Attributed Type Signatures - Penn (2000)   (4 citations)  (Correct)

No context found.

R. J. Brachman, R. E. Fikes, and H. J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(10): 67--73, 1983.


Semantic Knowledge Partitioning (Extended Abstract) - Wernhard   (Correct)

No context found.

R. J. Brachman, R. E. Fikes, and H. J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE COMPUTER, 16(10):67--73, Oct. 1983.


Representation of Mathematical Knowledge - Calmet And Tjandra (1991)   (Correct)

No context found.

Brachman R.J., Fikes R.E., Levesque H.J.: KRYPTON: A Functional Approach to Knowledge Representation; IEEE Computer, 16 (10), pp. 67 - 73, 1983.


A Hybrid Reasoning System for Terminologies and Clause Sets - Ken Kaneiwa National   (Correct)

No context found.

R. J. Brachman, R. E. Fikes, and H. J. Levesque. KRYPTON: A functional approach to knowledge representation. Computer, 16(10):67--73.


An Artificial Intelligence Environment for Computer Algebra - Calmet, Tjandra (1982)   (1 citation)  (Correct)

No context found.

Brachman R.J., Fikes R.E., Levesque H.J.: KRYPTON: A Functional Approach to Knowledge Representation; IEEE Computer, 16 (10), pp. 67 { 73, 1983.


Knowledge Base Integration: What can we Learn from Database.. - Unknown (1988)   (Correct)

No context found.

Brachman, R., Fikes. R.E, & Levesque, H.J. "KRYPTON: A Functional Approach to Knowledge Representation." [EEE Computer, 16(10). Oct 1983, pp.67-73.


Representation of Change in Controlled Medical.. - Oliver, Shahar.. (1999)   (10 citations)  (Correct)

No context found.

R.J. Brachman, R.E. Fikes and H.J. Levesque, KRYPTON: A functional approach to knowledge representation. IEEE Computer (October, 1983) 67--73.


Change Management and Synchronization of Local and Shared.. - Oliver (2000)   (2 citations)  (Correct)

No context found.

Brachman RJ, Fikes R, Levesque H. Krypton: A functional approach to knowledge representation. Computer 1983;16(10):67--73.


The SHOCKER System: A Sequence of Self-Guided Tutorials - Allen, Miller (1993)   (Correct)

No context found.

R. Brachman, R. Fikes, and H. Levesque, "KRYPTON: A functional approach to knowledge representation," IEEE Computer, 16(10), 1983.


The SHOCKER System: A Sequence of Self-Guided Tutorials - Allen, Miller (1993)   (Correct)

No context found.

R. Brachman, R. Fikes, and H. Levesque, "KRYPTON: A functional approach to knowledge representation," IEEE Computer, 16(10), 1983.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC