Extending conceptual definitions with default knowledge

Computational Intelligence

Volumn 13, Issue 2, 1997, Pages 258-299

  Coupey, Pascal ^a   Fouqueré, Christophe ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

Default and exception management; Description logics; Kl one like languages; Subsumption; Terminological logics

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION;

DESCRIPTION LOGICS; TERMINOLOGICAL LOGICS;

FORMAL LOGIC;

EID: 0031141137     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00040     Document Type: Article

References (54)

1. ACZEL, P. 1988. Non-well-founded sets. No. 14 in Lecture Notes. CSLI.
2. BAADER, F., and B. HOLLUNDER. 1991. KRIS: Knowledge representation and inference system. SIGART Bulletin, 2(3):8-14.
3. BAADER, F., and B. HOLLUNDER. 1992. Embedding defaults into terminological knowledge representation formalisms. In Principles of Knowledge Representation and Reasoning: 3rd International Conference, Edited by B. Nebel, C. Rich, and W. Swartout. Cambridge, MA. Morgan Kaufmann, pp. 306-317.
4. BRACHMAN, R. 1978. A Structural Paradigm for Representing Knowledge. Tech. rep. 3605, BBN Report.
5. BRACHMAN, R. 1985. I lied about the trees. AI Mag., 6(3):80-93.
6. BRACHMAN, R. 1991. Interests and issues in description (terminological) logics. In International Workshop on Terminological Logics DFKI Document D-91-13.
7. BRACHMAN, R., V. GILBERT, and H. LEVESQUE. 1985. An essential hybrid reasoning system: Knowledge and symbol level accounts in krypton. In 9th International Joint Conference on Artificial Intelligence, Edited by A. Joshi. Los Angeles, CA. Morgan Kaufmann, pp. 532-539.
8. BRACHMAN, R., and H. LEVESQUE. 1984. The tractability of subsumption in frame-based description languages. In 4th National Conference of the American Association for Artificial Intelligence, Austin, TX, pp. 34-37
9. BRACHMAN, R., D. MCGUINESS, P. PATEL-SCHNEIDER, L. RESNICK, and A. BORGIDA. 1991. Living with CLASSIC: When and how to use a KL-ONE-like language. In Principles of Semantic Networks. Edited by J. Sowa. Morgan Kaufmann, San Mateo, CA, pp. 401-456.
10. BRACHMAN, R., and J. G. SCHMOLZE. 1985. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171-216.
11. CAULIER, P., and L. PERRON. 1995. La Supervision de Réseau de Télécommunications: Analyse de l'Activité Centrée sur la Réutilisation et la Catégorisation d'Incidents. Tech. rep., INRIA, Rocquencourt, France.
12. COUPEY, P., and C. FOUQUERÉ. 1995. Defaults in concept definitions: An application. In International KRUSE Symposium Knowledge Retrieval, Use, and Storage for Efficiency, Santa Cruz, CA, pp. 112-121.
13. COUPEY, P., and S. SALOTTI. 1996. Using a description logic with default and exception to formalize the retrieval process of CBR. In International IPMU'96, Granada, Spain, pp. 1253-1258.
14. DIONNE, R., E. MAYS, and F. OLES. 1993a. Concept algebras, objects, and K-REP. In 13th International Joint Conference on Artificial Intelligence, Workshop on Object-Based Representation Systems, Chambéry, France, pp. 61-66.
15. DIONNE, R., E. MAYS, and F. OLES. 1993b. The equivalence of model-theoretic and structural subsumption in description logics. In 13th International Joint Conference on Artificial Intelligence, Chambéry, France, pp. 710-716.
16. DONINI, F., M. LENZERINI, D. NARDI, and W. NUTT. 1991a. The complexity of concept languages. In Principles of Knowledge Representation and Reasoning: 2nd International Conference, Edited by J. A. R. Fikes and E. Sandewall. Cambridge, MA, pp. 151-162.
17. DONINI, F., M. LENZERINI, D. NARDI, and W. NUTT. 1991b. Tractable concept languages. In 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, pp. 458-463.
18. DOYLE, J., and R. PATIL. 1991. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence, 48(3):261-297.
19. DUCOURNEAU, R., and M. HABIB. 1987. On some algorithms for multiple inheritance in object oriented programming. In European Conference for Object Oriented Programming, pp. 243-252.
20. DUCOURNEAU, R., and M. HABIB. 1989. La multiplicité de l'héritage dans les langages à objets. Technique et Science Informatiques, 8(1):41-62.
21. ETHERINGTON, D. 1987. Formalizing nonmonotonic reasoning systems. Artificial Intelligence, 31(1):41-85.
22. FAHLMAN, S., D. TOURETZKY, and W. V. ROGGEN. 1981. Cancellation in a parallel semantic network. In 7th International Joint Conference on Artificial Intelligence, Vancouver, BC, Canada, pp. 257-263.
23. FIKES, R., and R. NADO. 1987. Semantically sound inheritance for a formally defined frame language with defaults. In 6th National Conference of the American Association for Artificial Intelligence, Seattle, WA, pp. 443-448.
24. FROIDEVAUX, C., and D. KAYSER. 1988. Inheritance in semantic networks and in default logic. In Non-standard Logic for Automated Reasoning. Edited by P. Smets A. Mamdani D. Dubois H. Prade, pp. 179-212.
25. GRATZER, G. 1968. Universal Algebra. Van Nostrand Company.
26. GRELET, H., A. MARCEROU, T. PASDELOUP, J. PÉRICHON, and C. RATEL. 1992. Traitement des Perturbations de Trafic en Ile de France. Tech. rep., France Telecom D.R.I.F./RESEAU.
27. HEINSOHN, J. 1991. A hybrid approach for modeling uncertainty in terminological logics. In Symbolic and Quantitative Approaches to Uncertainty, ECSQAU, Vol. 548 of Lecture Notes in Computer Science. Edited by R. Kruse and P. Siegel. Springer-Verlag, pp. 198-205.
28. JACOBSON, N. 1989. Basic Algebra II. W.H. Freeman and Company.
29. MACGREGOR, R. 1988. A deductive pattern matcher. In 7th National Conference of the American Association for Artificial Intelligence, Saint Paul, MN, pp. 403-408.
30. MACGREGOR, R. 1991. The evolving technology of classification-based knowledge representation systems. In Principles of Semantic Networks. Edited by J. Sowa. Morgan Kaufmann, San Mateo, CA, pp. 385-400.
31. MACGREGOR, R. and R. BATES. 1987. The LOOM Knowledge Representation Language. Tech. rep. RS-87-188, Information Science Institute, University of Southern California, Maria del Rey, CA.
32. MARCHÉ, C. 1994. Normalised rewriting and normalised completion. In Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, pp. 394-403.
33. MINSKY, M. 1975. A framework for representing knowledge. In The Psychology of Computer Vision, Edited by M.-H. B. Company. P.H. Winston, pp. 211-277.
34. NEBEL, B. 1988. Computational complexity of terminological reasoning in BACK. Artificial Intelligence, 34(3):371-383.
35. NEBEL, B. 1990. Reasoning and Revision in Hybrid Representation Systems, Vol. 422 of Lecture Notes in Computer Science. Springer-Verlag.
36. PADGHAM, L. 1989. Non-Monotonie Inheritance for an Object-Oriented Knowledge-Basis. Ph.D. thesis, Linköpings University, Sweden.
37. PADGHAM, L., and B. NEBEL. 1993. Combining classification and nonmonotonic inheritance reasoning: A first step. In 7th International Symposium on Methodologies for Intelligent Systems, Trondheim, Norway, pp. 15-18.
38. PADGHAM, L., and T. ZHANG. 1993. A terminological logic with defaults: A definition and an application. In 13th International Joint Conference on Artificial Intelligence, Chambery, France, pp. 663-668.
39. PATEL-SCHNEIDER, P. 1984. Small can be beautiful in knowledge representation. In IEEE Workshop on Principles of Knowledge-Based Systems, pp. 11-16.
40. PATEL-SCHNEIDER, P. 1989. A four-valued semantics for frame-based description languages. In 5th National Conference of the American Association for Artificial Intelligence, Menlo Park, CA, pp. 344-348.
41. QUANTZ, J., and C. KINDERMANN. 1990. Implementation of the BACK-System Version 4. Tech. rep. 78, KIT-Report, Technische Universität, Berlin, Germany.
42. QUANTZ, J., and V. ROYER. 1992. A preference semantics for defaults in terminological logics. In Principles of Knowledge Representation and Reasoning: 3rd International Conference, Cambridge, MA. Edited by B. Nebel, C. Rich, and W. Swartout. pp. 294-305.
43. SCHMIDT-SCHAUß, M. 1989. Subsumption in KL-ONE is undecidable. In Principles of Knowledge Representation and Reasoning: 1st International Conference, Toronto, Ontario. Edited by R. J. Brachman, H. J. Levesque, and R. Reiter. pp. 421-431.
44. SCHMIDT-SCHAUß, M., and G. SMOLKA. 1991. Attributive concept descriptions with complements. Artificial Intelligence, 48(1): 1-26.
45. SCHMOLZE, J., and T. LIPKIS. 1983. Classification in the KL-ONE knowledge representation system. In 8th International Joint Conference on Artificial Intelligence, Karlsruhe, Germany, pp. 330-332.
46. SCHMOLZE, J., and W. MARK. 1991. The NIKL experience. Computational Intelligence, 6:48-69.
47. SMOLKA, G. 1988. A Feature Logic with Subsorts. Tech. rep. 33, LILOG, IWBS, IBM Germany Scientific Center, Stuttgart, Germany.
48. STEIN, L. A. 1992. Resolving ambiguity in nonmonotonic inheritance hierarchies. Artificial Intelligence, 55(2-3):259-310.
49. TOURETZKY, D. 1986. The Mathematics of Inheritance Systems. Morgan Kaufmann, Los Altos, CA.
50. δ∈: Un langage PAC-learnable. In Journées Acquisition, Validation, Apprentissage, JAVA95, Grenoble, France, pp. 27-40.
51. VILAIN, M. 1985. The restricted language architecture of a hybrid representation system. In 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 547-551.
52. WOODS, W. 1975. What's in a link? Foundations for semantic networks. In Representation and Understanding: Studies in Cognitive Science. Edited by A. P. N. York. D. G. Bobrow and A. M. Collins, pp. 35-82.
53. WOODS, W. 1991. Understanding subsumption and taxonomy: A framework for progress. In Principles of Semantic Networks. Edited by J. Sowa. Morgan Kaufmann, pp. 45-94.
54. WOODS, W., and J. G. SCHMOLZE. 1992. The KL-ONE family. In Semantic Networks in Artificial Intelligence. F. W. Lehmann, pp. 133-178.