Corpus ID: 18410323

A set-theoretical approach for ABox reasoning services (Extended Version)

@article{Cantone2017ASA,
  title={A set-theoretical approach for ABox reasoning services (Extended Version)},
  author={D. Cantone and Marianna Nicolosi Asmundo and D. Santamaria},
  journal={ArXiv},
  year={2017},
  volume={abs/1702.03096}
}
  • D. Cantone, Marianna Nicolosi Asmundo, D. Santamaria
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
  • In this paper we consider the most common ABox reasoning services for the description logic $\dlssx$ ($\shdlssx$, for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment \flqsr. $\shdlssx$ is a very expressive description logic admitting various concept and role constructs, datatypes, and it allows one to represent rule based languages such as SWRL. Decidability results are achieved by defining a generalized version of the… CONTINUE READING
    1 Citations

    References

    SHOWING 1-10 OF 29 REFERENCES
    Data Complexity of Query Answering in Description Logics
    • 462
    • PDF
    Reasoning with Individuals for the Description Logic SHIQ
    • 318
    • PDF
    The Even More Irresistible SROIQ
    • 978
    • PDF
    A Set-Theoretic Approach to ABox Reasoning Services
    • 13
    • PDF
    A Conjunctive Query Language for Description Logic Aboxes
    • 131
    • PDF