liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 3 of 3
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Nguyen, Linh Anh
    et al.
    Institute of Informatics, University of Warsaw, Warsaw, Poland; Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnamn.
    Nguyen, Thi-Bich-Loc
    Department of Information Technology, Hue University of Sciences, Hue, Vietnam.
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems. Linköping University, The Institute of Technology.
    A Horn Fragment with PTime Data Complexity of Regular Description Logic with Inverse2014In: VNU Journal of Computer Science and Communication Engineering, ISSN 0866-8612, Vol. 30, no 4, p. 14-28Article in journal (Refereed)
    Abstract [en]

    We study a Horn fragment called Horn-RegI of the regular description logic with inverse RegI, which extends the description logic ALC with inverse roles and regular role inclusion axioms characterized by finite automata. In contrast to the well-known Horn fragments EL, DL-Lite, DLP, Horn-SHIQ and Horn-SROIQ of description logics, Horn-RegI allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms, while still has PTIME data complexity. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We provide an algorithm with PTIME data complexity for checking satisfiability of Horn-RegI knowledge bases.

  • 2. Nguyen, Linh Anh
    et al.
    Nguyen, Thi-Bich-Loc
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems.
    HornDL: An Expressive Horn Description Logic with PTime Data Complexity2013In: Web Reasoning and Rule Systems / [ed] Wolfgang Faber, Domenico Lembo, Springer Berlin/Heidelberg, 2013, p. 259-264Conference paper (Refereed)
    Abstract [en]

    We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn- SROIQ , while still has PTime data complexity. In comparison with Horn- SROIQ , HornDL additionally allows the universal role and assertions of the form irreflexive (s), ¬s(a,b) , a≐̸b . More importantly, in contrast to all the well-known Horn fragments EL , DL-Lite, DLP, Horn- SHIQ , Horn- SROIQ of description logics, HornDL allows a form of the concept constructor “universal restriction” to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. In the long version of this paper, we present the first algorithm with PTime data complexity for checking satisfiability of HornDL knowledge bases.

  • 3.
    Nguyen, Linh Anh
    et al.
    Ton Duc Thang University, Vietnam; University of Warsaw, Poland.
    Nguyen, Thi-Bich-Loc
    Hue University of Sciences, Vietnam.
    Szalas, Andrzej
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems. Linköping University, Faculty of Science & Engineering. University of Warsaw, Poland.
    Towards richer rule languages with polynomial data complexity for the Semantic Web2015In: Data & Knowledge Engineering, ISSN 0169-023X, E-ISSN 1872-6933, Vol. 96-97, p. 57-77Article in journal (Refereed)
    Abstract [en]

    We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-Reg(1), Horn-SHTQ and Horn-SROIQ, while still has PTime data complexity. In comparison with Horn-SROIQ, Horn-DL additionally allows the universal role and assertions of the form irreflexive(s), -s(a, b), a b. More importantly, in contrast to all the well-known Horn fragments epsilon L, DL-Lite, DLP, Horn-SHIQ, and Horn-SROIQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We develop the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases.

1 - 3 of 3
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf