메뉴 건너뛰기




Volumn 9, Issue 3, 1999, Pages 267-293

Optimizing description logic subsumption

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; LINGUISTICS; OPTIMIZATION; PERSONAL COMPUTERS; SET THEORY;

EID: 0032592923     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.3.267     Document Type: Article
Times cited : (105)

References (48)
  • 1
    • 0008947231 scopus 로고    scopus 로고
    • Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles
    • F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proceedings of IJCAI-91 [40], pp. 446-451.
    • Proceedings of IJCAI-91 , vol.40 , pp. 446-451
    • Baader, F.1
  • 2
    • 0008953405 scopus 로고
    • An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on
    • B. Nebel, C. Rich and W. Swartout, eds. Morgan-Kaufmann, San Francisco, CA, Also available as DFKI RR-93-03
    • F. Baader, E. Franconi, B. Hollunder, B. Nebel and H.-J. Profitlich. An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. In Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), B. Nebel, C. Rich and W. Swartout, eds. pp. 270-281. Morgan-Kaufmann, San Francisco, CA, 1992. Also available as DFKI RR-93-03.
    • (1992) Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92) , pp. 270-281
    • Baader, F.1    Franconi, E.2    Hollunder, B.3    Nebel, B.4    Profitlich, H.-J.5
  • 4
    • 84873687728 scopus 로고
    • A terminological knowledge representation system with complete inference algorithms
    • Processing Declarative Knowledge: International Workshop PDK'91, Springer-Verlag, Berlin
    • F. Baader and B. Hollunder. A terminological knowledge representation system with complete inference algorithms. In Processing Declarative Knowledge: International Workshop PDK'91, number 567 in Lecture Notes in Artificial Intelligence, pp. 67-86, Springer-Verlag, Berlin, 1991.
    • (1991) Lecture Notes in Artificial Intelligence , vol.567 , pp. 67-86
    • Baader, F.1    Hollunder, B.2
  • 5
    • 0002442895 scopus 로고
    • KRIS: Knowledge representation and inference system
    • F. Baader and B. Hollunder. KRIS: Knowledge representation and inference system. SIGART Bulletin, 2, 8-14, 1991.
    • (1991) SIGART Bulletin , vol.2 , pp. 8-14
    • Baader, F.1    Hollunder, B.2
  • 7
    • 84886286667 scopus 로고    scopus 로고
    • Comparison of theorem provers for modal logics - Introduction and summary
    • Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux '98, H. de Swart, ed. Springer-Verlag
    • P. Balsiger and A. Heuerding. Comparison of theorem provers for modal logics - introduction and summary. In Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux '98, H. de Swart, ed. pp. 25-26. Number 1379 Lecture Notes in Artificial Intelligence, Springer-Verlag, 1998.
    • (1998) Lecture Notes in Artificial Intelligence , vol.1379 , pp. 25-26
    • Balsiger, P.1    Heuerding, A.2
  • 14
    • 0008953403 scopus 로고    scopus 로고
    • Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux'98
    • Springer-Verlag, May
    • H. de Swart, editor. Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux'98. Number 1397 in Lecture Notes in Artificial Intelligence. Springer-Verlag, May 1998.
    • (1998) Lecture Notes in Artificial Intelligence , vol.1397
    • De Swart, H.1
  • 17
    • 0019346375 scopus 로고
    • Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
    • J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5, 77-87, 1983.
    • (1983) Discrete Applied Mathematics , vol.5 , pp. 77-87
    • Franco, J.1    Paull, M.2
  • 20
    • 0003872611 scopus 로고
    • PhD thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA
    • J. W. Freeman. Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA, 1995.
    • (1995) Improvements to Propositional Satisfiability Search Algorithms
    • Freeman, J.W.1
  • 21
    • 0030107173 scopus 로고    scopus 로고
    • Hard random 3-SAT problems and the Davis-Putnam procedure
    • J. W. Freeman. Hard random 3-SAT problems and the Davis-Putnam procedure. Artificial Intelligence, 81, 183-198, 1996.
    • (1996) Artificial Intelligence , vol.81 , pp. 183-198
    • Freeman, J.W.1
  • 22
    • 84957645011 scopus 로고    scopus 로고
    • Building decision procedures for modal logics from propositional decision procedures - The case study of modal K
    • Proceedings of the Thirteenth International Conference on Automated Deduction (CADE-13), M. McRobbie and J. Slaney, eds. Springer
    • F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE-13), number 1104 in Lecture Notes in Artificial Intelligence, M. McRobbie and J. Slaney, eds. pp. 583-597. Springer, 1996.
    • (1996) Lecture Notes in Artificial Intelligence , vol.1104 , pp. 583-597
    • Giunchiglia, F.1    Sebastiani, R.2
  • 24
    • 0026853865 scopus 로고
    • A guide to completeness and complexity for model logics of knowledge and belief
    • J. Y. Halpern and Y. Moses. A guide to completeness and complexity for model logics of knowledge and belief. Artificial Intelligence, 54, 319-379, 1992.
    • (1992) Artificial Intelligence , vol.54 , pp. 319-379
    • Halpern, J.Y.1    Moses, Y.2
  • 32
    • 84886297719 scopus 로고    scopus 로고
    • FaCT and DLP
    • Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux '98, H. de Swart, ed. Springer-Verlag
    • I. Horrocks and P. F. Patel-Schneider. FaCT and DLP. In Automated Reasoning with Analytic Tableaux and Related Methods: International Conference Tableaux '98, H. de Swart, ed. pp. 27-30. Number 1379 Lecture Notes in Artificial Intelligence, Springer-Verlag, 1998.
    • (1998) Lecture Notes in Artificial Intelligence , vol.1379 , pp. 27-30
    • Horrocks, I.1    Patel-Schneider, P.F.2
  • 35
    • 0025434889 scopus 로고
    • Terminological reasoning is inherently intractable
    • B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43, 235-249, 1990.
    • (1990) Artificial Intelligence , vol.43 , pp. 235-249
    • Nebel, B.1
  • 37
    • 0001938503 scopus 로고    scopus 로고
    • DLP system description
    • E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, C. A. Welty, and F. Sebastiani, eds. CEUR, May
    • P. F. Patel-Schneider. DLP system description. In Collected Papers from the International Description Logics Workshop (DL'98). E. Franconi, G. De Giacomo, R. M. MacGregor, W. Nutt, C. A. Welty, and F. Sebastiani, eds. pp. 87-89. CEUR, May 1998.
    • (1998) Collected Papers from the International Description Logics Workshop (DL'98) , pp. 87-89
    • Patel-Schneider, P.F.1
  • 43
    • 84958525769 scopus 로고    scopus 로고
    • A concept language extended with different kinds of transitive roles
    • 20. Deutsche Jahrestagung für Künstliche Intelligenz, G. Görz and S. Hölldobler, eds. Springer Verlag
    • U. Sattler. A concept language extended with different kinds of transitive roles. In 20. Deutsche Jahrestagung für Künstliche Intelligenz, number 1137 in Lecture Notes in Artificial Intelligence, G. Görz and S. Hölldobler, eds. pp. 333-345. Springer Verlag, 1996.
    • (1996) Lecture Notes in Artificial Intelligence , vol.1137 , pp. 333-345
    • Sattler, U.1
  • 44
    • 0000597279 scopus 로고    scopus 로고
    • A correspondence theory for terminological logics: Preliminary report
    • K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proceedings of IJCAI-91 [40], pp. 466-471.
    • Proceedings of IJCAI-91 , vol.40 , pp. 466-471
    • Schild, K.1
  • 45
    • 0026107613 scopus 로고
    • Attributive concept descriptions with complements
    • M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48, 1-26, 1991.
    • (1991) Artificial Intelligence , vol.48 , pp. 1-26
    • Schmidt-Schauß, M.1    Smolka, G.2
  • 48
    • 0022704337 scopus 로고
    • Automata-theoretic techniques for modal logics of programs
    • M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32, 183-221, 1986.
    • (1986) Journal of Computer and System Sciences , vol.32 , pp. 183-221
    • Vardi, M.Y.1    Wolper, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.