메뉴 건너뛰기




Volumn 8, Issue 4, 2010, Pages 334-355

Algebraic tableau reasoning for the description logic SHOQ

Author keywords

Algebraic reasoning; Description logics; Tableau reasoning

Indexed keywords

ALGEBRAIC METHOD; ALGEBRAIC REASONING; CARDINALITIES; DESCRIPTION LOGIC; LINEAR INTEGER PROGRAMMING; MULTI-MODAL LOGIC; NON-DETERMINISM; REASONING PROCEDURES; ROLE HIERARCHY; SEMANTIC WEB APPLICATIONS; TABLEAU REASONING; WEB ONTOLOGY LANGUAGE; WORST CASE;

EID: 78049360340     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2010.08.009     Document Type: Article
Times cited : (14)

References (28)
  • 1
  • 4
    • 0027652458 scopus 로고
    • A semantics and complete algorithm for subsumption in the CLASSIC description logic
    • A. Borgida, and P.F. Patel-Schneider A semantics and complete algorithm for subsumption in the CLASSIC description logic J. Artificial Intelligence Res. 1 1994 277 308
    • (1994) J. Artificial Intelligence Res. , vol.1 , pp. 277-308
    • Borgida, A.1    Patel-Schneider, P.F.2
  • 8
    • 80051673887 scopus 로고    scopus 로고
    • Optimizing algebraic tableau reasoning for SHOQ: First experimental results
    • Waterloo, Canada, May 4-7
    • J. Faddoul, V. Haarslev, Optimizing algebraic tableau reasoning for SHOQ: First experimental results, in: Proc. of the 2010 Int. Workshop on Description Logics, Waterloo, Canada, May 4-7, 2010.
    • (2010) Proc. of the 2010 Int. Workshop on Description Logics
    • Faddoul, J.1    Haarslev, V.2
  • 9
    • 85052005093 scopus 로고    scopus 로고
    • A hybrid tableau algorithm for ALCQ, in: Proc. of the 2008 Int. Workshop on Description Logics
    • J. Faddoul, N. Farsinia, V. Haarslev, R. Möller, A hybrid tableau algorithm for ALCQ, in: Proc. of the 2008 Int. Workshop on Description Logics, also in: 18th European Conference on Artificial Intelligence (ECAI 2008), 2008, pp. 725-726.
    • (2008) 18th European Conference on Artificial Intelligence (ECAI 2008) , pp. 725-726
    • J. Faddoul1
  • 10
    • 77950207840 scopus 로고    scopus 로고
    • Hybrid reasoning for description logics with nominals and qualified number restrictions
    • Hamburg University of Technology
    • J. Faddoul, V. Haarslev, R. Möller, Hybrid reasoning for description logics with nominals and qualified number restrictions, Technical report, Institute for Software Systems (STS), Hamburg University of Technology, 2008, http://www.sts.tu-harburg.de/tech-reports/papers.html.
    • (2008) Technical Report, Institute for Software Systems (STS)
    • J. Faddoul1
  • 12
    • 77950241683 scopus 로고    scopus 로고
    • Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic SHQ
    • N. Farsiniamarj, and V. Haarslev Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic SHQ AI Communications 23 2-3 2010 205 240 (Special Issue on Practical Aspects of Automated Reasoning)
    • (2010) AI Communications , vol.23 , Issue.23 , pp. 205-240
    • Farsiniamarj, N.1    Haarslev, V.2
  • 13
    • 15744372215 scopus 로고    scopus 로고
    • Optimizing reasoning in description logics with qualified number restrictions
    • V. Haarslev, R. Möller, Optimizing reasoning in description logics with qualified number restrictions, in: Description Logics, 2001, pp. 142-151.
    • (2001) Description Logics , pp. 142-151
    • V. Haarslev1
  • 14
    • 34548330901 scopus 로고    scopus 로고
    • Combining tableaux and algebraic methods for reasoning with qualified number restrictions
    • V. Haarslev, M. Timmann, R. Möller, Combining tableaux and algebraic methods for reasoning with qualified number restrictions, in: Description Logics, 2001, pp. 152-161.
    • (2001) Description Logics , pp. 152-161
    • V. Haarslev1
  • 15
    • 0343979741 scopus 로고
    • Polynomial time algorithms for finding integer relations among real numbers
    • Springer Berlin/Heidelberg
    • J. Hastad, J. Lagarias, B. Helfrich, and C.P. Schnorr Polynomial time algorithms for finding integer relations among real numbers Lecture Notes in Comput. Sci. vol. 210 1986 Springer Berlin/Heidelberg 105 118
    • (1986) Lecture Notes in Comput. Sci. , vol.210 , pp. 105-118
    • Hastad, J.1    Lagarias, J.2    Helfrich, B.3    Schnorr, C.P.4
  • 19
    • 34548324668 scopus 로고    scopus 로고
    • A tableaux decision procedure for SHOIQ
    • I. Horrocks, and U. Sattler A tableaux decision procedure for SHOIQ J. Automat. Reason. 2007 249 276
    • (2007) J. Automat. Reason. , pp. 249-276
    • Horrocks, I.1    Sattler, U.2
  • 20
    • 40849118430 scopus 로고    scopus 로고
    • A resolution-based decision procedure for SHOIQ
    • Y. Kazakov, and B. Motik A resolution-based decision procedure for SHOIQ J. Automat. Reason. 40 2008 89 116
    • (2008) J. Automat. Reason. , vol.40 , pp. 89-116
    • Kazakov, Y.1    Motik, B.2
  • 21
    • 53049104689 scopus 로고    scopus 로고
    • Individual reuse in description logic reasoning
    • B. Motik, I. Horrocks, Individual reuse in description logic reasoning, in: IJCAR, 2008, pp. 242-258.
    • (2008) IJCAR , pp. 242-258
    • Motik, B.1    Horrocks, I.2
  • 23
    • 78049358842 scopus 로고    scopus 로고
    • B. Motik, P.F. Patel-Schneider, and B. Cuenca Grau OWL 2 web ontology language: Direct semantics, 2009, latest version available at: http://www.w3.org/TR/owl2-semantics/
    • Motik, B.1    Patel-Schneider, P.F.2    Grau Cuenca, B.3
  • 24
    • 78049385974 scopus 로고    scopus 로고
    • Reasoning about sets via atomic decomposition
    • International Computer Science Institute (ICSI) Berkeley, CA, USA
    • H.J. Ohlbach, J. Koehler, Reasoning about sets via atomic decomposition, Technical report TR-96-031, International Computer Science Institute (ICSI), Berkeley, CA, USA, 1996, 41 pp.
    • (1996) Technical Report TR-96-031 , pp. 41
    • Ohlbach, H.J.1    Koehler, J.2
  • 25
    • 0033522692 scopus 로고    scopus 로고
    • Modal logics, description logics and arithmetic reasoning
    • H.J. Ohlbach, and J. Koehler Modal logics, description logics and arithmetic reasoning Artificial Intelligence 109 1999 1 31
    • (1999) Artificial Intelligence , vol.109 , pp. 1-31
    • Ohlbach, H.J.1    Koehler, J.2
  • 27
    • 0028496625 scopus 로고
    • Reasoning with individuals in concept languages
    • A. Schaerf Reasoning with individuals in concept languages Data Knowl. Engineering 13 1994 141 176
    • (1994) Data Knowl. Engineering , vol.13 , pp. 141-176
    • Schaerf, A.1
  • 28
    • 14344269579 scopus 로고    scopus 로고
    • The complexity of reasoning with cardinality restrictions and nominals in expressive description logics
    • S. Tobies The complexity of reasoning with cardinality restrictions and nominals in expressive description logics J. Artificial Intelligence Res. 12 2000 199 217
    • (2000) J. Artificial Intelligence Res. , vol.12 , pp. 199-217
    • Tobies, S.1


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