LIPIcs.MFCS.2019.17.pdf
- Filesize: 0.51 MB
- 15 pages
Document
Finite Satisfiability of Unary Negation Fragment with Transitivity
Authors
Emanuel Kieroński 
-
Part of:
Volume:
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-08-20
File
Document Identifiers
Author Details
Cite AsGet BibTex
Daniel Danielski and Emanuel Kieroński. Finite Satisfiability of Unary Negation Fragment with Transitivity. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 17:1-17:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.MFCS.2019.17
https://doi.org/10.4230/LIPIcs.MFCS.2019.17
Abstract
We show that the finite satisfiability problem for the unary negation fragment with an arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require that some binary symbols are interpreted as arbitrary transitive relations, some as partial orders and some as equivalences. We also consider finite satisfiability of various extensions of our primary logic, in particular capturing the concepts of nominals and role hierarchies known from description logic. As the unary negation fragment can express unions of conjunctive queries, our results have interesting implications for the problem of finite query answering, both in the classical scenario and in the description logics setting.
Subject Classification
ACM Subject Classification
- Theory of computation → Logic
Keywords
- unary negation fragment
- transitivity
- finite satisfiability
- finite open-world query answering
- description logics
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads