Franz Baader
Skip Abstract Section
Abstract
The knowledge representation system KL-ONE first appeared in 1977. Subsequently many systems based on the idea of KL-ONE have been built. The formal model-theoretic semantics which has been introduced for KL-ONE languages [9] provides means for investigating soundness and completeness of inference algorithms. It turned out that almost all implemented KL-ONE systems such as BACK, KL-TWO, LOOM, NIKL, SB-ONE use sound but incomplete algorithms.
- F. Baader. "Terminological Cycles in KL-ONE-based Knowledge Representation Languages." In Proceedings of the 8th National Conference of the AAAI, pp. 621--626, Boston, Mas., 1990.Google Scholar
- F. Baader. "A Formal Definition for the Expressive Power of Knowledge Representation Languages." In Proceedings of the 9th European Conference on Artificial Intelligence, pp. 53--58, Stockholm, Sweden, 1990.Google Scholar
- F. Baader. Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles. DFKI Research Report RR-90--13, DFKI, Postfach 2080, D-6750 Kaiserslautern, West Germany.Google Scholar
- F. Baader, H.-J. Bürckert, J. Heinsohn, B. Hollunder, J. Müller, B. Nebel, W. Nutt, H.-J. Profitlich. Terminological Knowledge Representation: A Proposal for a Terminological Logic. DFKI Technical Memo TM-90--04, DFKI, Postfach 2080, D-6750 Kaiserslautern, West Germany.Google Scholar
- F. Baader, H.-J. Bürckert, B. Hollunder, W. Nutt, J. H. Siekmann. "Concept Logics" Logics" In Proceedings of the Symposium on Computational Logics, Brüssel, November 1990.Google Scholar
- F. Baader, P. Hanschke. A Schema for Integrating Concrete Domains into Concept Languages. DFKI Research Report, DFKI, Postfach 2080, D-6750 Kaiserslautern, West Germany. Forthcoming.Google Scholar
- A. Borgida, R. J. Brachman, D. L. McGuinness, L. A. Resnick. "CLASSIC: A Structural Data Model for Objects." In Proceedings of the International Conference on Management of Data, Portland, Oregon, 1989. Google ScholarDigital Library
- R. J. Brachman, V. Pigman Gilbert, H. J. Levesque. "An essential hybrid reasoning system: knowledge and symbol level accounts in KRYPTON." In Proceedings of the 9th IJCAI, pp. 532--539, Los Angeles, Cal., 1985.Google Scholar
- R. J. Brachmann, H. J. Levesque. "The tractability of subsumption in frame based description languages." In Proceedings of the 4th National Conference of the AAAI, pp. 34--37, Austin, Tex., 1984.Google Scholar
- R. J. Brachman, J. G. Schmolze. "An Overview of the KL-ONE knowledge representation system." Cognitive Science, 9(2):171--216, April 1985.Google ScholarCross Ref
- H.-J. Bürckert. "A Resolution Principle for Clauses with Constraints" In Proceedings of the 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, LNAI 449, Springer Verlag, pp. 178--192, 1990. Google ScholarDigital Library
- H.-J. Bürckert, J. Müller. "RATMAN: A Rational Agent Testbed for Multi Agent Networks", To appear in Proceedings of Modeling Autonomous Agents in Multi-Agent Worlds, Elsevier Publishers, 1991.Google Scholar
- F. Donini, M. Lenzerini, Daniele Nardi, W. Nutt. "The Complexity of Concept Languages." In J. A. Allan, R. Fikes, E. Sandewall (editors), Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Mas., 1991.Google Scholar
- B. Hollunder. "Hybrid Inferences in KL-ONE-based Knowledge Representation Systems." In Proceedings of the 14th German Workshop on Artificial Intelligence, pp. 38--47, Eringerfeld, Germany, 1990. Google ScholarDigital Library
- B. Hollunder, F. Baader. "Qualifying Number Restrictions in Concept Languages." In J. A. Allan, R. Fikes, E. Sandewall (editors), Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Mas., 1991.Google Scholar
- B. Hollunder, W. Nutt. Subsumption Algorithms for Concept Languages. DFKI Research Report RR-90--04, DFKI, Postfach 2080, D-6750 Kaiserslautern, West Germany.Google Scholar
- B. Hollunder, W. Nutt, M. Schmidt-Schauß. "Subsumption Algorithms for Concept Description Languages." In Proceedings of the 9th European Conference on Artificial Intelligence, pp. 348--353, Stockholm, Sweden, 1990.Google Scholar
- T. S. Kaczmarek, R. Bates, G. Robins. "Recent developments in NIKL." In Proceedings of the 5th National Conference of the AAAI, pp. 578--587, Philadelphia, Pa., 1986.Google Scholar
- A. Kobsa. "The SB-ONE knowledge representation work-banch". In Preprints of the Workshop on Formal Aspects of Semantic Networks, Two Harbors, Cal., February 1989.Google Scholar
- H. J. Levesque, R. J. Brachman. "Expressiveness and tractability in knowledge representation and reasoning." Computational Intelligence, 3:78--93, 1987.Google ScholarCross Ref
- R. MacGregor, R. Bates. The Loom Knowledge Representation Language. Technical Report ISI/RS-87--188, University of Southern California, Information Science Institute, Marina del Rey, Cal., 1987.Google Scholar
- B. Nebel. Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Artificial Intelligence, LNAI 422, Springer Verlag, 1990. Google ScholarDigital Library
- B. Nebel. "Terminological Cycles: Semantics and Computational Properties." In Proceedings of the Workshop on Formal Aspects of Semantic Networks, Two Harbors, Cal., February 1989.Google Scholar
- B. Nebel. "Computational complexity of terminological reasoning in BACK." Artificial Intelligence, 34(3):371--383, 1988. Google ScholarDigital Library
- B. Nebel, K. von Luck. "Hybrid Reasoning in BACK." In Z. W. Ras, L. Saitta (editors), Methodologies for Intelligent Systems, pp. 260--269, North Holland, Amsterdam, Netherlands, 1988.Google Scholar
- P. Patel-Schneider. "Small can be beautiful in knowledge representation." In Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems, pp. 11--16, Denver, Colo., 1984.Google Scholar
- P. Patel-Schneider. "A four-valued Semantics for Terminological Logics." Artificial Intelligence, 39(2):263--272, 1989. Google ScholarDigital Library
- P. Patel-Schneider, B. Owsnicki-Klewe, A. Kobsa, N. Guarino, R. MacGregor, W. S. Mark, D. L. McGuinness, B. Nebel, A. Schmiedel, J. Yen. "Term Subsumption in Knowledge Representation." In AI Magazine, 11(2):16--23, 1990. pp. 11--16, Denver, Colo., 1984.Google Scholar
- M. Schmidt-Schauß. "Subsumption in KL-ONE is undecidable." In R. J. Brachmann, H. J. Levesque, R. Reiter (editors), Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pp. 421--431, Toronto, Ont., 1989. Google ScholarDigital Library
- M. Schmidt-Schauß, G. Smolka. Attributive Concept Descriptions with Complements. SEKI Report SR-88--21, FB Informatik, Universität Kaiserslautern, D-6750, Kaiserslautern, West Germany, 1988. To appear in Artificial Intelligence, 47, 1991.Google Scholar
- M. B. Vilain. "The restricted language architecture of a hybrid representation system." In R. J. Bachmann, H. J. Levesque, R. Reiter (editors), Proceedings of the 9th IJCAI, pp. 547--551, Los Angeles, Cal., 1985.Google Scholar
Index Terms
- KRIS: Knowledge Representation and Inference System
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsThe completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
Comments