Document Open Access Logo

A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics

Authors Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo



PDF
Thumbnail PDF

File

LIPIcs.CSL.2011.129.pdf
  • Filesize: 0.59 MB
  • 15 pages

Document Identifiers

Author Details

Domenico Cantone
Cristiano Longo
Marianna Nicolosi Asmundo

Cite AsGet BibTex

Domenico Cantone, Cristiano Longo, and Marianna Nicolosi Asmundo. A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 129-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.129

Abstract

We present a decision procedure for a quantified fragment of set theory involving ordered pairs and some operators to manipulate them. When our decision procedure is applied to formulae in this fragment whose quantifier prefixes have length bounded by a fixed constant, it runs in nondeterministic polynomial-time. Related to this fragment, we also introduce a description logic which provides an unusually large set of constructs, such as, for instance, Boolean constructs among roles. The set-theoretic nature of the description logics semantics yields a straightforward reduction of the knowledge base consistency problem to the satisfiability problem for formulae of our fragment with quantifier prefixes of length at most 2, from which the NP-completeness of reasoning in this novel description logic follows. Finally, we extend this reduction to cope also with SWRL rules.
Keywords
  • NP-complete decision procedures
  • set theory
  • description logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail